This is what i came thru a problem in some coding test. problem statement was like that we have to add all the elements of an array except the element at the i
In order to make it easy for others to help me I have put all the codes here https://pastebin.com/WENzM41k it will starts as 2 agents compete each other. I'm t
What is the most concise and efficient way to find out if a JavaScript array contains a value? This is the only way I know to do it: function contains(a, obj) {
Here is the requirement details: time = ["09-13", "12-14"] getResult(time) = false The first performance runs from 9 a.m. to 1 p.m. and the second one starts
I am trying to find number of ways o calculate arithmetic mean of a subarray of an array. It boils down to this; given an array X and an integer S, how many con
I have an array of numbers, now I want to find all possible subset sums and get the top z elements in it. Example: Input : arr[] = {2, 4, 5}, z = 3 SubsetSums
Give a binary string consisting of 0's and 1's only. E.g., 0100101. We are allowed to pick any two indexes and swap them. We have to return the minimum number o
I am trying to write down a method to get all PDF images from a FPDF_DOCUMENT object to perform actions on them and return back theFPDF_DOCUMENT with the images
I am not sure where to start with the following python puzzle. "You are holding a link of a chain. Implement a method longerSide to find which side of the chain
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
So I'm designing a few programs for editing photos in python using PIL and one of them was converting an image to greyscale (I'm avoiding the use of any functio
We have two arrays of equal length, A and B. also, for every i: 0 <= a_i, b_i <= m for some 1<=m<= 1000000. We want to check if a single swap bet
I have a list of shapes (list of points) e.g. rectangles which I want to group/cluster together. This is what I have: And this is what I want to achieve. How
I can't think of an algorithm for my code. Please help me out. We have two files. The first one has text (Text length is n-words). The second
Hi I have an algorithm that uses binary tree to heapify and then sort the list i need to convert this sort algorithm to change into d-heap or d-ary heap or k-ar
This is a question on leetcode. For some reason my code only works for 7/164 test cases. i would like to know why my algorithm is not efficient. what is a solut
I'm trying to get from a function the absolute difference of a nested list. I have a fixed matrix, and I would like to get the result when is not fixed. At the
I would like to form random groups out of a number of individuals. For the individuals I have information about their location (two possibilities) and the team
I'm trying to implement Integer Programming for Nearest Neighbor Classifier in python using cvxpy. Short intro Given a dataset of n points with a color (red or