- Implement Deque using Circular Array
- Deque Intro
- Deque Java Collection Docs
- Given a string with unbalanced brackets how do you remove minimum number of extra brackets so that you are left with balanced brackets in the string – RemoveExtraBrackets.java
- Simply Path
- [Skip] Sliding Window Maximum (Maximum of all subarrays of size k) – Given an array and an integer k, find the maximum for each and every contiguous subarray of size k. Youtube. We are skipping this question as it the dequeue implementation is tough and not worth the time. It will be difficult to reproduce the same in an interview env. We will have to check the BST implementation for the same.
- [Skip]Remove duplicates from a string while maintaining order and getting lexicographically smallest string – RemoveDuplicateMaintainingOrder.java