InterviewBit Problems
Partitions : Solved
About the Partitions : Solved category
(1)
Partitions O(n) Solution
(1)
C++ O(n^2) solution with intuition
(5)
Easy C++ solution using prefix and suffix arrays
(1)
Beginner's O(n) C++ solution
(1)
C++ O(n) time and O(1) space solution
(2)
Simple with less code and least time complexity,take a look
(2)
Simple intuitive Java O(n) solution
(1)
Straight forward O(n) c++
(1)
C++ easy using prefix sum
(1)
C++ O(n) intuitive solution
(1)
Python O(n) solution with approach to get logic
(3)
Java solution can grab the logic in a single time
(1)
C++ simple answer, easy to understand
(1)
Easiest way to understand
(1)
How would you solve the return value for this array: [ 0, 0, 0, 0, 0, 0, 0, 0, 0 ]. Answer is 28
(2)
Java Solution-Simple and Easy
(2)
C++ O(N) solution Clean
(1)
C++ using cumulative sum and unordered map
(1)
CPP solution easy O(n)
(2)
Two pointer Approach with O(1) memory and O(n) Complexity
(1)
Optimal solution
(1)
O(n) solution intuitive
(2)
Nlogn simple approach
(1)
I think its easy to understand
(1)
Cpp solution passed all the test cases
(2)
Time limit Exceed please help if anyone solve
(1)
Cpp solution passed all test cases
(1)
Simple java solution by me
(2)
next page →