|
9 | 9 | - [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) `leetcode`
|
10 | 10 | - [Reverse First K elements of Queue](https://practice.geeksforgeeks.org/problems/reverse-first-k-elements-of-queue/1/) `GFG`
|
11 | 11 | - [Delete middle element of a stack](https://practice.geeksforgeeks.org/problems/delete-middle-element-of-a-stack/1/) `GFG`
|
| 12 | +- [Inorder Traversal (Iterative)](https://practice.geeksforgeeks.org/problems/inorder-traversal-iterative/1/) `GFG` |
| 13 | +- [Preorder traversal (Iterative)](https://practice.geeksforgeeks.org/problems/preorder-traversal-iterative/1/) `GFG` |
| 14 | +- [Flood fill](https://leetcode.com/problems/flood-fill/) `leetcode` |
12 | 15 |
|
13 | 16 | ## Medium
|
14 | 17 | - [Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/) `leetcode`
|
|
19 | 22 | - [Design circular Queue](https://leetcode.com/problems/design-circular-queue/) `leetcode`
|
20 | 23 | - [Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/) `leetcode`
|
21 | 24 | - [Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue/) `leetcode`
|
| 25 | +- [Circular tour](https://practice.geeksforgeeks.org/problems/circular-tour/1) `GFG` `Amex` `Amazon` |
22 | 26 | - [Task Scheduler](https://leetcode.com/problems/task-scheduler/) `leetcode`
|
23 | 27 | - [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem-1587115621/1/) `GFG`
|
24 | 28 | - [Max Rectangle](https://practice.geeksforgeeks.org/problems/max-rectangle/1/) `GFG`
|
25 | 29 | - [The Celebrity Problem](https://practice.geeksforgeeks.org/problems/the-celebrity-problem/1/) `Google` `GFG`
|
26 | 30 | - [Maximum Rectangular Area in a Histogram](https://practice.geeksforgeeks.org/problems/maximum-rectangular-area-in-a-histogram-1587115620/1/) `GFG`
|
| 31 | +- [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) `leetcode` |
| 32 | +- [Snake and Ladders](https://leetcode.com/problems/snakes-and-ladders/) `leetcode` |
27 | 33 |
|
28 | 34 | ## Hard
|
29 | 35 | - [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) `leetcode`
|
30 | 36 | - [Longest Valid Parantheses](https://leetcode.com/problems/longest-valid-parentheses/) `leetcode`
|
31 | 37 | - [Sliding window maximum](https://leetcode.com/problems/sliding-window-maximum/) `leetcode`
|
32 | 38 | - [Brace Expansion II](https://leetcode.com/problems/brace-expansion-ii/) `leetcode`
|
| 39 | +- [Card Rotation](https://practice.geeksforgeeks.org/problems/card-rotation5834/1/) `GFG` |
| 40 | +- [Minimum steps to reach target by a Knight](https://www.geeksforgeeks.org/minimum-steps-reach-target-knight/) `GFG` |
| 41 | +- [Count number of islands](https://leetcode.com/problems/number-of-islands/) `leetcode` |
0 commit comments