InterviewBit Problems
Min Jumps Array : Solved
About the Min Jumps Array : Solved category
(1)
Easy BFS solution, no tle
(1)
Easiest Sol O(N) C++
(3)
Best O(N) solution here C++
(1)
Easy C++ solution(iterative approach)
(1)
Challenge | Similar problem
(1)
Python 3 solution (Easy approach)
(1)
[C++][Min Jumps Array] simple 2 pass greedy approach
(1)
Fenwick Tree DP O(nlogn) solution
(1)
C++ o(n) and o(1)
(1)
Time complexity O(n) , space complexity O(1) solution
(1)
This is the solution maintaning the max element O(1),O(n)
(1)
O(n) and O(1) space using BFS
(2)
Java efficient solution
(1)
DP(n^2) and greedy solution
(1)
DP will work :D need to do some optimization ;)
(6)
Test case missing
(1)
My Java O(n^2) solution doesnt work, whereas I have seen a c++ O(n^2) code work
(1)
What's wrong with this soln it's saying TLE .Help!
(1)
Greedy Solution O(n)
(2)
Simple Greedy Solution
(1)
Shouldn't this problem be classified under Greedy?
(6)
Why time limit exceeds, accepted as partially correct answer, Can't figure out the reason
(1)
O(n) solution with O(1) space complexity cpp
(1)
O(nlogn) solution , Accepted ! By using segment trees / C++
(2)
Time always exceeds. use binary indexed tree
(1)
Top down approach ,segmentation fault!
(1)
O(n) and O(1) space complexity Soln
(1)
Fastest Solution in C++ is incorrect
(1)
Java greedy Solution
(1)
next page →