1. Data Structure and Algorithm Mastery

    • Buy now
    • Learn more
    • Discussions
  2. Arrays

    • Arrays Basics
  3. Binary Search

    • Binary Search Introduction
    • Binary Search Application
  4. LinkedList

    • Linked List Implementation and Operations
    • Linked List Reverse in groups
  5. Hashing

    • Hashing
  6. Heaps

    • Heap tree implementation
    • Median in a stream
  7. Stacks And Queues

    • Stacks Introduction
    • Sum Subarray Ranges
    • Queues
  8. Sliding Window

    • Sliding window Intro
    • Sliding window Advanced
  9. Graphs and trees

    • Basics for Graph and Tree
    • Binary Tree
    • BFS on Graph
    • Topological sorting
    • BFS On Grid
    • Union Find and MST
    • Dijkstra On Graph
    • Minimum Cost to Reach Destination in Time
    • Topological Sorting with DFS
  10. Backtracking

    • Backtracking Inclusion Exclusion
    • Rat in a Maze
  11. Dynamic programming

    • Dynamic Programming Inclusion exclusion
    • Matrix chain multiplication
    • Arithmetic Slices
  12. Trie

    • Trie Operations and Applications
  13. Intervals

    • Merge and Insert Intervals
  14. Greedy

    • Greedy approch
  15. Special Topics

    • Segment Tree
    • KMP
  1. Products
  2. Course
  3. Section
  4. Lesson

Stacks Introduction

  1. Data Structure and Algorithm Mastery

    • Buy now
    • Learn more
    • Discussions
  2. Arrays

    • Arrays Basics
  3. Binary Search

    • Binary Search Introduction
    • Binary Search Application
  4. LinkedList

    • Linked List Implementation and Operations
    • Linked List Reverse in groups
  5. Hashing

    • Hashing
  6. Heaps

    • Heap tree implementation
    • Median in a stream
  7. Stacks And Queues

    • Stacks Introduction
    • Sum Subarray Ranges
    • Queues
  8. Sliding Window

    • Sliding window Intro
    • Sliding window Advanced
  9. Graphs and trees

    • Basics for Graph and Tree
    • Binary Tree
    • BFS on Graph
    • Topological sorting
    • BFS On Grid
    • Union Find and MST
    • Dijkstra On Graph
    • Minimum Cost to Reach Destination in Time
    • Topological Sorting with DFS
  10. Backtracking

    • Backtracking Inclusion Exclusion
    • Rat in a Maze
  11. Dynamic programming

    • Dynamic Programming Inclusion exclusion
    • Matrix chain multiplication
    • Arithmetic Slices
  12. Trie

    • Trie Operations and Applications
  13. Intervals

    • Merge and Insert Intervals
  14. Greedy

    • Greedy approch
  15. Special Topics

    • Segment Tree
    • KMP

Implement stack using array https://www.geeksforgeeks.org/problems/implement-stack-using-array/1

Backspace String Compare 

https://leetcode.com/problems/backspace-string-compare/description/
Solution - https://leetcode.com/problems/backspace-string-compare/submissions/1260650161

Closest smaller on left - 

https://www.geeksforgeeks.org/problems/smallest-number-on-left3403/1

Solution - https://discuss.geeksforgeeks.org/comment/8a1a79cb-fee2-4d7f-a47c-71c7335f6df4/practice

Largest Rectangle in Histogram

https://leetcode.com/problems/largest-rectangle-in-histogram/description/

Solution 1 - https://leetcode.com/problems/largest-rectangle-in-histogram/submissions/1261030550

Solution 2 - https://leetcode.com/problems/largest-rectangle-in-histogram/submissions/1864166546