InterviewBit Problems
Max Distance : Solved
About the Max Distance : Solved category
(1)
Most elegant and short python solution
(4)
C++ (O(n) Solution)
(2)
O(n) solution using only suffmax array || C++
(3)
Doubt regarding space taken by set and vector
(1)
C++ solution O(nlogn) complexity
(1)
O(nlogn) using vector pair C++
(1)
Simplest solution: O(n) time complexity with only ONE auxiliary array O(n) in Python
(3)
O(n) time solution with rightMax stack ,instead of array. Save space and have less comparison, especially in best case
(2)
Simplest way possible: O(n) time complexity and only ONE auxiliary array O(n)
(3)
Simple c++ solution with O(n^2)
(1)
Simple C++ solution O(n log n )
(1)
Intermittent rejection of answer in judge
(1)
Simple Solution. (in Java)
(1)
Simple cpp solution and accepted solution
(2)
Simple Java solution, but time limit exceed, need proper solution!
(1)
Hope this helps
(1)
Working Code (Simple)
(1)
Given Solution desont work For this test case
(1)
Simple O(nlogn) solution
(3)
O(n) with 2 Stacks in Java
(1)
Java time ->o(n) and two auxiliary arrays o(n))
(5)
O(n) using one stack
(1)
Simple and easy solution in O(n):
(2)
2 approaches in C++
(1)
Simple C++ Solution using Left Minimum and Right Maximum Array
(1)
Easy to understand, solved using vector pair in c++
(3)
O(n) solution C++
(4)
Can anybody tell , what is the problem with this divide and conquer(Binary search ) implementation . It is giving wrong ans to few test cases
(1)
Simple to Follow Solution
(1)
next page →