Problems
Easy
- Next greater element I
leetcode - Valid Parentheses
leetcode - Min Stack
leetcode - Remove Outermost Parentheses
leetcode - Remove All Adjacent Duplicates In String
leetcode - Number of Recent Calls
leetcode - Reverse First K elements of Queue
GFG - Delete middle element of a stack
GFG - Inorder Traversal (Iterative)
GFG - Preorder traversal (Iterative)
GFG - Flood fill
leetcode - Implement Queue using Stacks
leetcode
Medium
- Design a Stack With Increment Operation
leetcode - Minimum Add to Make Parentheses Valid
leetcode - Decode String
leetcode - Asteroid Collision
leetcode - 132 Pattern
leetcode - Design circular Queue
leetcode - Find the Most Competitive Subsequence
leetcode - Design Front Middle Back Queue
leetcode - Circular tour
GFGAmexAmazon - Task Scheduler
leetcode - Stock span problem
GFG - Max Rectangle
GFG - The Celebrity Problem
GoogleGFG - Maximum Rectangular Area in a Histogram
GFG - Binary Tree Right Side View
leetcode - Snake and Ladders
leetcode
Hard
- Longest Valid Parantheses
leetcode - Sliding window maximum
leetcode - Brace Expansion II
leetcode - Card Rotation
GFG - Minimum steps to reach target by a Knight
GFG - Count number of islands
leetcode