InterviewBit Problems
Jump Game Array : Unsolved
About the Jump Game Array : Unsolved category
(1)
Wrong Test Case :
(1)
IDE does not work properly
(1)
Worst IDE ever So disappointing
(1)
Easy to understand solution using queue
(1)
Can we jump backwards
(2)
For input (present in comment) we aren't able to reach the last index. So why is the excepted answer 1. Please correct me if I'm wrong
(4)
DP is an overkill for this problem
(1)
C++ O(n) solution without dp
(1)
Easiest C++ Solution in O(n)
(1)
Why this solution is giving Memory Limit Exceeded error
(1)
Problem can be done without DP
(1)
O(n) solution without using DP
(1)
Accepted on Leetcode , Stack overflow on IB (Top down approach + recursion)
(1)
Bottom up method working but top down method is throwing stack overflow error
(3)
Completely irrelevant to Dynamic programming
(2)
Exception in thread "main" java.lang.StackOverflowError
(3)
My top-down approach(recursion) gives stack overflow error under efficiency.....but my bottom-up approach(iteration) solution is getting accepted, why?
(2)
Using standard DP procedure, getting a segmentation fault, looking for help
(2)
O(n^2) accepted
(2)
Different outputs while testing and submitting
(2)
Getting mle...o(1) memory is only allocated
(2)
My code is not working for a specific test case, any sort of help would be appreciated
(1)
Constraints are not defined
(2)
For input 1110 you are able to reach last index but expected output is 0
(2)
No need for DP O(n) time with O(1) space complexity
(1)
How is the answer 1? ------SOLVED
(2)
Regarding segmentation fault in large test-cases (Efficiency part)
(1)
O(n2) soln getting accepted
(1)
I wanted to clarify something....for input 1 1 0 5 2 the expected output shows 1
(2)
next page →