So I know how the reduce, accumulator and how fold works in C++, Python, etc... But for some reason in Scade Suite it's kinda confusing to me. Scade Suite Examp
Problem: You are given an array of integers that contain numbers in random order. Write a program to find and return the number which occurs the maximum
I know that one can detect cycles in direct graphs using DFS and BFS. I want to know whether we can detect cycles in directed graphs using Union-Find or not? I
My code to access elements of array using for loop. The output of the program is [19,17,15] which are the elements of array int a[] = { 12, 15, 16, 17, 19, 23 }
According to the manual there are 4 types of ETS tables: set – The table is a set table: one key, one object, no order among objects. This is the default
I am currently practicing algorithms and DS. I have stumbled upon a question that I can't figure out how to solve. So the question's link is there: In summary,
The only reason I see for using merge sort over quick sort is if the list was already (or mostly) sorted. Merge sort requires more space as it creates an extra
I have a dataset with multiple individuals and two variables from different points of time, for example: Company Employees at t=1 (before a specific event) Rev
I am doing a project for class and am stuck on trying to develop this method. Would anyone be able to give me an example? The instructions for the method are be
The picture above has 25 action points such that: Each of the four corners of each of the three layers is an action point. The midsection of each of the four s
I'm studying about circular queue in data structure . As you can see from the code below, I try to delete a specific data and insert data on Circular queue. How
I have currently implemented a version of this tutorial: Real Time AI Face Landmark Detection in 20 Minutes with Tensorflow.JS and React It demonstrates how to
I was asked in an interview today below question. I gave O(nlgn) solution but I was asked to give O(n) solution. I could not come up with O(n) solution. Can you
Given a sorted array like [1,2,4,4,4]. Each element in the array should occur exactly same number of times as element. For Example 1 should occur 1 time, 2 shou
How to map key/value pairs of a "map" in JavaScript: var map = {"a": 1, "b": 2, "c": 3}; alert(JSON.stringify(map)); I need to get an mapper containing key/
Recently I have conversation with a colleague about what would be the optimal way to convert List to Map in Java and if there any specific benefits of doing so.
I want to extract and process all the files in a zipped file? import re import zipfile import pathlib import pandas as pd # Download mHealth dataset def parse
Can you please confirm the meaning of the concept 'heapify', the source I am learning from says that heapify is building a heap from an array (from scratch) Thi
I'm trying to solve this problem: Given an array of positive integers, and an integer Y, you are allowed to replace at most Y array-elements with lesser val
guys please its due asapp Transform the following infix expression to postfix form (using stacks). (A + 2) * (B - C + D * E) + F