Here's an interesting problem I haven't managed to deal with yet. Given an arithmetic expression in Reverse Polish Notation, write a program to evaluate it. T
So this question came to my mind when solving some dijikstra's based leetcode problems. We have node, distance pairs in priority queue at each step. Having dupl
Why I created a duplicate thread I created this thread after reading Longest increasing subsequence with K exceptions allowed. I realised that the person who wa
I'm trying to write a program whose input is an array of integers, and its size. This code has to delete each element which is smaller than the element to the l
I am confused since google cannnot train their text generation models with each individuals personal vocabulary. I was trying to develop something similar but
An evil scientist has developed an injection that induces insatiable hunger in a fish. On giving this injection, a fish of size x can eat another fish of smalle
I have this question that is medium level and couldn't even think on how to solve this problem, my solution could be overkill as I have no idea on how to traver
I was trying to write a algorithm in javascript that returns all the possible 3 digit numbers numbers from a given array of length 6 For Example var arr = [1, 2
I have a set of axis aligned rectangles. When two rectangles overlap (partly or completely), they shall be merged into their common bounding box. This process w
Is there any method of solving the traveling salesman problem effective and that is not limited by space (as is the case of the Held-Karp algorithm), excepting
I have this method to merge 2 sorted arrays into one sorted array: public void merge(T[] a, int l1, int r1, T[] b, int l2, int r2, T[] c, int l3) {
How do I determine if the following relation is in BCNF form? R(U,V,W,X,Y,Z) UVW ->X VW -> YU VWY ->Z I understand that for a functional dependency A
I'm trying to find the time complexity of while loops and I have no idea where to begin. I understand how to find the complexity class of for loops, but when it
I'm doing an algorithm challenge on www.edabit.com, where you have a list of dice rolls, and: if the number is 6, the next number on the list is amplified by a
Given an array of integers, return indices of the two numbers such that they add up to a specific target. Example: Given nums = [3, 2, 4], target = 6, Because
I have written the algorithms for recursive and iterative binary search: Recursive AlgorithmBinSrch(a, i,l,x) // Given an array a[i :l] of elementsin nondecre
Edit: my main question is that I want to replicate the TI-84 plus RNG algorithm on my computer, so I can write it in a language like Javascript or Lua, to test
Example given in JavaScript: Suppose we have two arrays [0,0,0] and [1,1,1]. What's the algorithm to produce all possible ways these two arrays can be combine.
Write a method to test if a string meets the preconditions to become a palindrome. Eg: Input | Output mmo | True yakak | True travel |
I've seen several similar questions about how to generate all possible combinations of elements in an array. But I'm having a very hard time figuring out how to