InterviewBit Problems
Order of People Heights : Solved
About the Order of People Heights : Solved category
(1)
Please someone help whats wrong in my code [ c++ ]
(1)
Simple C++ solution using segment tree
(1)
O(n log n) Solution in Python
(1)
Simple c++ solution using sorting
(1)
Easiest C++ Solution using sorting
(1)
Time - O(n log n) . No segment trees. Easy to understand C++ solution
(4)
Check out this Java O(N*logN) solution
(1)
NlogN solution using BIT
(1)
Full Explanation of Easiest solution using Sorting
(1)
Short and simple BIT n*logn*logn approach. C++
(1)
Seg Tree Solution
(1)
CPP Solution using ST
(1)
N(log(N)^2) using fenwick tree
(1)
[C++] solution in o(n^2)
(2)
Solution of 4 lines in Python
(3)
Line-4 solution in 🐍
(2)
Cpp n(logn) solution using fenwick tree easy to understand
(2)
Approach in Python
(2)
Time complexity O(n logn) solution using ArrayList
(2)
13 line cpp O(nlogn)
(4)
Very short and easy solution
(2)
Alternate method (without using Segment Tree)
(1)
Solution using linkedList with enough code comments [Java, Time: O(nlogn) Space: O(n)]
(2)
O(NlogN) python solution using BST with detailed explanation (No segment trees)
(1)
Solution using segment tree in O(nlog(n)) time
(1)
Simplification in given complete solution in Java
(1)
Simple soln. using map in O(nlogn)
(2)
Cleanest and simplest O(N^2) solution using a vector
(1)
A super simple solution using map!
(6)
next page →