InterviewBit Problems
Sliding Window Maximum : Solved
About the Sliding Window Maximum : Solved category
(1)
Giving tle, please suggest changes
(1)
Simple solution with few lines of python code
(2)
Python (Solution) Using Queue
(1)
Solution using priority queue
(1)
The optimal solution is O(A log B) better that O(AB)
(1)
Python solution without using queue
(2)
Simple C++ Solution using multiset
(1)
From where is 0 getting added at the beginning of the result vector?
(1)
Solution Without using stack or queue
(1)
Optimal O(n) solution with explanatory comments
(1)
Please tell me differnce in time complexicity of this solution and optimal solution
(1)
Easy CPP solution with Nearest Largest Element on Left (done previously in stack)
(1)
Ver Very Easy C++ sol
(2)
C++ intuitive solution without Deque
(1)
TLE with Priority Queue of size 2
(1)
Cpp solution using double ended queue
(3)
JAVA Solution: O(N) Time and O(1) Space
(1)
Simple C++ Solution : Using Multiset
(1)
Someone help me with my code
(1)
Easy JAVA Solution Using Next Greater Element Concept
(1)
C++ Approach TC: O(N) simple code, Improvisations are Welcomed!
(1)
Deque solution for the question using O(n)
(1)
Can someone please help me to understand the intuition behind the solution?
(2)
Linear cpp map solution
(1)
Best code in C++ using deque in Sliding Window Approach
(1)
C++ Solution using queue
(1)
How much time did you take to solve it
(2)
Title of your commentUse deque to solve the problem
(1)
Runtime error in the code
(1)
next page →