Computer Courses
Striver's A2Z DSA Course (take U forward)
Sikhami InstituteEnglish
Free
Join for free- 315 video lectures (114h 32m)
- Certificate of completion
- Ask the teacher your doubts
- Watch on the web and in the Android app
About this course
Striver's complete data structures and algorithms course, built to take you from zero to placement-ready. More than 300 videos solve problems step by step, from brute force to the optimal solution, with code in C++ and Java. Who it's for: students preparing for coding interviews and campus placements. These are the free, official videos of the "Strivers A2Z-DSA Course" playlist from the take U forward YouTube channel (youtube.com/@takeuforward). All videos belong to take U forward (Striver); Sikhami is not affiliated with take U forward (Striver) and simply arranges the public playlist into a course, so you can learn one lesson at a time and keep track of your progress.
What you will learn
• Basics, sorting, arrays and binary search problems • Strings, linked lists and recursion with backtracking • Bit manipulation, stacks, queues and sliding window • Heaps, greedy algorithms and binary trees • Binary search trees and graphs (BFS, DFS, shortest paths, MST) • Dynamic programming on subsequences, strings, stocks and more • Tries and classic interview questions such as the LRU and LFU cache
Course content
1 section · 315 lectures · 114h 32m
1. Strivers A2Z-DSA Course | DSA Playlist | Placements
- Don't watch my A2Z DSA Course8m
- How to setup VS code for DSA and CP | Input / Output split format8m
- C++ Basics in One Shot - Strivers A2Z DSA Course - L11h 26m
- Time and Space Complexity - Strivers A2Z DSA Course35m
- Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course1h 22m
- Complete C++ STL in 1 Video | Time Complexity and Notes1h 7m
- Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course1h 3m
- Re 1. Introduction to Recursion | Recursion Tree | Stack Space | Strivers A2Z DSA Course22m
- Re 2. Problems on Recursion | Strivers A2Z DSA Course22m
- Re 3. Parameterised and Functional Recursion | Strivers A2Z DSA Course18m
- Re 4. Problems on Functional Recursion | Strivers A2Z DSA Course19m
- Re 5. Multiple Recursion Calls | Problems | Strivers A2Z DSA Course16m
- Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course1h 0m
- Sorting - Part 1 | Selection Sort, Bubble Sort, Insertion Sort | Strivers A2Z DSA Course43m
- Merge Sort | Algorithm | Pseudocode | Dry Run | Code | Strivers A2Z DSA Course49m
- Quick Sort For Beginners | Strivers A2Z DSA Course35m
- Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video43m
- Rotate Array by K places | Union, Intersection of Sorted Arrays | Move Zeros to End | Arrays Part-21h 13m
- Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-338m
- Longest Subarray with sum K | Brute - Better - Optimal | Generate Subarrays41m
- 2 Sum Problem | 2 types of the same problem for Interviews | Brute-Better-Optimal18m
- Sort an array of 0's 1's & 2's | Intuition of Algo🔥 | C++ Java Python | Brute-Better-Optimal25m
- Majority Element I | Brute-Better-Optimal | Moore's Voting Algorithm | Intuition 🔥|Brute to Optimal18m
- Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing20m
- DP 35. Best Time to Buy and Sell Stock | DP on Stocks 🔥9m
- Rearrange Array Elements by Sign | 2 Varieties of same Problem21m
- Next Permutation - Intuition in Detail 🔥 | Brute to Optimal28m
- Leaders in an Array | Brute - Optimal | Strivers A2Z DSA Course11m
- Longest Consecutive Sequence | Google Interview Question | Brute Better Optimal23m
- Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal30m
- Rotate Matrix/Image by 90 Degrees | Brute - Optimal17m
- Spiral Traversal of a Matrix | Spiral Matrix16m
- Count Subarray sum Equals K | Brute - Better -Optimal24m
- Pascal Triangle | Finding nCr in minimal time26m
- Majority Element II | Brute-Better-Optimal26m
- 3 Sum | Brute - Better - Optimal with Codes38m
- 4 Sum | Brute - Better - Optimal with Codes28m
- Number of Subarrays with xor K | Brute - Better - Optimal24m
- Merge Overlapping Intervals | Brute, Optimal with Precise TC analysis22m
- Merge Sorted Arrays Without Extra Space | 2 Optimal Solution32m
- Find the Missing and Repeating Number | 4 Approaches 🔥42m
- Count Inversions in an Array | Brute and Optimal24m
- Reverse Pairs | Hard Interview Question32m
- Maximum Product Subarray - Best Intuitive Approach Discussed20m
- BS-1. Binary Search Introduction | Real Life Example | Iterative | Recursive | Overflow Cases33m
- BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil32m
- BS-3. First and Last Occurrences in Array | Count occurrences in Array25m
- BS-4. Search Element in Rotated Sorted Array - I16m
- BS-5. Search Element in Rotated Sorted Array II12m
- BS-6. Minimum in Rotated Sorted Array17m
- BS-7. Find out how many times array has been rotated5m
- BS-8. Single Element in Sorted Array22m
- BS-9. Find Peak Element32m
- BS-10. Finding Sqrt of a number using Binary Search17m
- BS-11. Find the Nth root of an Integer20m
- BS-12. Koko Eating Bananas21m
- BS-13. Minimum days to make M bouquets | Binary Search26m
- BS-14. Find the Smallest Divisor Given a Threshold | Binary Search16m
- BS-15. Capacity to Ship Packages within D Days20m
- BS-16. Kth Missing Positive Number | Maths + Binary Search22m
- BS-17. Aggressive Cows | Binary Search Hard26m
- BS-18. Allocate Books or Book Allocation | Hard Binary Search27m
- BS 19. Painter's Partition and Split Array - Largest Sum11m
- BS-20. Minimise Maximum Distance between Gas Stations | 3 Approaches | Heap | Binary Search59m
- BS 21: Median of two Sorted Arrays of Different Sizes | Brute and Better Approach15m
- BS-21. Median of two Sorted Arrays of Different Sizes | Binary Search Approach With Intuition35m
- Bs-22. K-th element of two sorted arrays | Binary Search Approach11m
- BS 23. Row with maximum number of 1s | Binary Search on 2D Arrays10m
- BS-24. Search in a 2D Matrix - I | Binary Search of 2D15m
- BS-25. Search in a 2D Matrix - II | Binary Search on 2D15m
- BS-26. Find Peak Element-II | Binary Search20m
- BS-27. Median in a Row Wise Sorted Matrix23m
- L1. Introduction to Trees | Types of Trees9m
- L2. Binary Tree Representation in C++4m
- L3. Binary Tree Representation in Java4m
- L4. Binary Tree Traversals in Binary Tree | BFS | DFS9m
- L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation7m
- L6. Inorder Traversal of Binary Tree | C++ | Java | Code Explanation7m
- L7. Postorder Traversal of Binary Tree | C++ | Java | Code Explanation5m
- L8. Level Order Traversal of Binary Tree | BFS | C++ | Java8m
- L9. Iterative Preorder Traversal in Binary Tree | C++ | Java | Stack6m
- L10. iterative Inorder Traversal in Binary Tree | C++ | Java | Stack11m
- L11. Iterative Postorder Traversal using 2 Stack | C++ | Java | Binary Tree4m
- L12. Iterative Postorder Traversal using 1 Stack | C++ | Java | Binary Trees12m
- L13. Preorder Inorder Postorder Traversals in One Traversal | C++ | Java | Stack | Binary Trees10m
- L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java8m
- L15. Check for Balanced Binary Tree | C++ | Java12m
- L16. Diameter of Binary Tree | C++ | Java13m
- L17. Maximum Path Sum in Binary Tree | C++ | Java17m
- L18. Check it two trees are Identical or Not | C++ | Java4m
- L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java8m
- L20. Boundary Traversal in Binary Tree | C++ | Java9m
- L21. Vertical Order Traversal of Binary Tree | C++ | Java18m
- L22. Top View of Binary Tree | C++ | Java10m
- L23. Bottom View of Binary Tree | C++ | Java13m
- L24. Right/Left View of Binary Tree | C++ | Java13m
- L25. Check for Symmetrical Binary Trees | C++ | Java9m
- L26. Print Root to Node Path in Binary Tree | C++ | Java11m
- L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java14m
- L28. Maximum Width of Binary Tree | C++ | Java22m
- L29. Children Sum Property in Binary Tree | O(N) Approach | C++ | Java16m
- L30. Print all the Nodes at a distance of K in Binary Tree | C++ | Java17m
- L31. Minimum time taken to BURN the Binary Tree from a Node | C++ | Java18m
- L32. Count total Nodes in a COMPLETE Binary Tree | O(Log^2 N) Approach | C++ | Java16m
- L33. Requirements needed to construct a Unique Binary Tree | Theory8m
- L34. Construct a Binary Tree from Preorder and Inorder Traversal | C++ | Java18m
- L35. Construct the Binary Tree from Postorder and Inorder Traversal | C++ | Java19m
- L36. Serialize and De-serialize Binary Tree | C++ | Java17m
- L37. Morris Traversal | Preorder | Inorder | C++ | Java23m
- L38. Flatten a Binary Tree to Linked List | 3 Approaches | C++ | Java21m
- L39. Introduction to Binary Search Tree | BST8m
- L40. Search in a Binary Search Tree | BST | C++ | Java6m
- L41. Ceil in a Binary Search Tree | BST | C++ | Java5m
- L42. Floor in a Binary Search Tree | BST | C++ | Java5m
- L43. Insert a given Node in Binary Search Tree | BST | C++ | Java8m
- L44. Delete a Node in Binary Search Tree | BST | C++ | Java15m
- L45. K-th Smallest/Largest Element in BST8m
- L46. Check if a tree is a BST or BT | Validate a BST9m
- L47. LCA in Binary Search Tree8m
- L48. Construct a BST from a preorder traversal | 3 Methods16m
- L49. Inorder Successor/Predecessor in BST | 3 Methods10m
- L50. Binary Search Tree Iterator | BST | O(H) Space14m
- L51. Two Sum In BST | Check if there exists a pair with Sum K15m
- L52. Recover BST | Correct BST with two nodes swapped15m
- L53. Largest BST in Binary Tree17m
- G-1. Introduction to Graph | Types | Different Conventions Used13m
- G-2. Graph Representation in C++ | Two Ways to Represent16m
- G-3. Graph Representation in Java | Two Ways to Represent13m
- G-4. What are Connected Components ?7m
- G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs19m
- G-6. Depth-First Search (DFS) | C++ and Java | Traversal Technique in Graphs20m
- G-7. Number of Provinces | C++ | Java | Connected Components15m
- G-8. Number of Islands | Number of Connected Components in Matrix | C++ | Java25m
- G-9. Flood Fill Algorithm | C++ | Java20m
- G-10. Rotten Oranges | C++ | Java22m
- G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java20m
- G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java19m
- G-13. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java20m
- G-14. Surrounded Regions | Replace O's with X's | C++ | Java23m
- G-15. Number of Enclaves | Multi-source BFS | C++ | Java15m
- G-16. Number of Distinct Islands | Constructive Thinking + DFS | C++ | Java18m
- G-17. Bipartite Graph | BFS | C++ | Java18m
- G-18. Bipartite Graph | DFS | C++ | Java14m
- G-19. Detect cycle in a directed graph using DFS | Java | C++17m
- G-20. Find Eventual Safe States - DFS23m
- G-21. Topological Sort Algorithm | DFS13m
- G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS13m
- G-23. Detect a Cycle in Directed Graph | Topological Sort | Kahn's Algorithm | BFS6m
- G-24. Course Schedule I and II | Pre-requisite Tasks | Topological Sort11m
- G-25. Find Eventual Safe States - BFS - Topological Sort16m
- G-26. Alien Dictionary - Topological Sort20m
- G-27. Shortest Path in Directed Acyclic Graph - Topological Sort26m
- G-28. Shortest Path in Undirected Graph with Unit Weights16m
- G-29. Word Ladder - I | Shortest Paths28m
- G-30. Word Ladder - 2 | Shortest Paths25m
- G-31. Word Ladder - 2 | Optimised Approach for Leetcode23m
- G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 122m
- G-33. Dijkstra's Algorithm - Using Set - Part 212m
- G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 314m
- G-35. Print Shortest Path - Dijkstra's Algorithm19m
- G-36. Shortest Distance in a Binary Maze23m
- G-37. Path With Minimum Effort24m
- G-38. Cheapest Flights Within K Stops23m
- G-39. Minimum Multiplications to Reach End19m
- G-40. Number of Ways to Arrive at Destination24m
- G-41. Bellman Ford Algorithm27m
- G-42. Floyd Warshall Algorithm30m
- G-43. Find the City With the Smallest Number of Neighbours at a Threshold Distance12m
- G-44. Minimum Spanning Tree - Theory7m
- G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java19m
- G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression42m
- G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java13m
- G-48. Number of Provinces - Disjoint Set8m
- G-49. Number of Operations to Make Network Connected - DSU14m
- G-50. Accounts Merge - DSU22m
- G-51. Number of Islands - II - Online Queries - DSU25m
- G-52. Making a Large Island - DSU26m
- G-53. Most Stones Removed with Same Row or Column - DSU23m
- G-54. Strongly Connected Components - Kosaraju's Algorithm22m
- G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time23m
- G-56. Articulation Point in Graph22m
- DP 1. Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimization Techniques33m
- DP 2. Climbing Stairs | Learn How to Write 1D Recurrence Relations13m
- DP 3. Frog Jump | Dynamic Programming | Learn to write 1D DP38m
- DP 4. Frog Jump with K Distance | Lecture 3 Follow Up Question17m
- DP 5. Maximum Sum of Non-Adjacent Elements | House Robber | 1-D | DP on Subsequences32m
- DP 6. House Robber 2 | 1D DP | DP on Subsequences9m
- DP 7. Ninja's Training | MUST WATCH for 2D CONCEPTS 🔥 | Vacation | Atcoder | 2D DP |52m
- DP 8. Grid Unique Paths | Learn Everything about DP on Grids | ALL TECHNIQUES 🔥48m
- DP 9. Unique Paths 2 | DP on Grid with Maze Obstacles12m
- DP 10. Minimum Path Sum in Grid | Asked to me In Microsoft Internship Interview | DP on GRIDS23m
- DP 11. Triangle | Fixed Starting Point and Variable Ending Point | DP on GRIDS34m
- DP 12. Minimum/Maximum Falling Path Sum | Variable Starting and Ending Points | DP on Grids42m
- DP 13. Cherry Pickup II | 3D DP Made Easy | DP On Grids43m
- DP 14. Subset Sum Equals to Target | Identify DP on Subsequences and Ways to Solve them38m
- DP 15. Partition Equal Subset Sum | DP on Subsequences9m
- Dp 16. Partition A Set Into Two Subsets With Minimum Absolute Sum Difference | DP on Subsequences29m
- DP 17. Counts Subsets with Sum K | Dp on Subsequences36m
- DP 18. Count Partitions With Given Difference | Dp on Subsequences18m
- DP 19. 0/1 Knapsack | Recursion to Single Array Space Optimised Approach | DP on Subsequences41m
- DP 20. Minimum Coins | DP on Subsequences | Infinite Supplies Pattern34m
- DP 21. Target Sum | DP on Subsequences9m
- DP 22. Coin Change 2 | Infinite Supply Problems | DP on Subsequences22m
- DP 23. Unbounded Knapsack | 1-D Array Space Optimised Approach22m
- DP 24. Rod Cutting Problem | 1D Array Space Optimised Approach22m
- Dp 25. Longest Common Subsequence | Top Down | Bottom-Up | Space Optimised | DP on Strings47m
- DP 26. Print Longest Common Subsequence | Dp on Strings16m
- DP 27. Longest Common Substring | DP on Strings 🔥14m
- DP 28. Longest Palindromic Subsequence9m
- DP 29. Minimum Insertions to Make String Palindrome12m
- DP 30. Minimum Insertions/Deletions to Convert String A to String B7m
- DP 31. Shortest Common Supersequence | DP on Strings26m
- DP 32. Distinct Subsequences | 1D Array Optimisation Technique 🔥40m
- DP 33. Edit Distance | Recursive to 1D Array Optimised Solution 🔥37m
- DP 34. Wildcard Matching | Recursive to 1D Array Optimisation 🔥43m
- DP 36. Buy and Sell Stock - II | Recursion to Space Optimisation35m
- DP 37. Buy and Sell Stocks III | Recursion to Space Optimisation31m
- DP 38. Buy and Stock Sell IV | Recursion to Space Optimisation12m
- DP 39. Buy and Sell Stocks With Cooldown | Recursion to Space Optimisation15m
- DP 40. Buy and Sell Stocks With Transaction Fee | Recursion to Space Optimisation7m
- DP 41. Longest Increasing Subsequence | Memoization24m
- DP 42. Printing Longest Increasing Subsequence | Tabulation | Algorithm25m
- DP 43. Longest Increasing Subsequence | Binary Search | Intuition16m
- DP 44. Largest Divisible Subset | Longest Increasing Subsequence14m
- DP 45. Longest String Chain | Longest Increasing Subsequence | LIS16m
- DP 46. Longest Bitonic Subsequence | LIS13m
- DP 47. Number of Longest Increasing Subsequences20m
- DP 48. Matrix Chain Multiplication | MCM | Partition DP Starts 🔥53m
- DP 49. Matrix Chain Multiplication | Bottom-Up | Tabulation9m
- DP 50. Minimum Cost to Cut the Stick30m
- DP 51. Burst Balloons | Partition DP | Interactive G-Meet Session Update34m
- DP 52. Evaluate Boolean Expression to True | Partition DP34m
- DP 53. Palindrome Partitioning - II | Front Partition 🔥23m
- DP 54. Partition Array for Maximum Sum | Front Partition 🔥21m
- DP 55. Maximum Rectangle Area with all 1's | DP on Rectangles11m
- DP 56. Count Square Submatrices with All Ones | DP on Rectangles 🔥15m
- L1. Introduction to LinkedList | Traversal | Length | Search an Element45m
- L2. Deletion and Insertion in LL | 8 Problems56m
- L3. Introduction to Doubly LinkedList | Insertions and Deletions1h 4m
- L4. Reverse a DLL | Multiple Approaches18m
- L5. Add 2 numbers in LinkedList | Dummy Node Approach14m
- L6. Odd Even Linked List | Multiple Approaches24m
- L7. Sort a LinkedList of 0's, 1's and 2's | Multiple Approaches23m
- L8. Remove Nth Node from the end of the LinkedList | Multiple Approaches16m
- L9. Reverse a LinkedList | Iterative and Recursive32m
- L10. Check if a LinkedList is Palindrome or Not | Multiple Approaches20m
- L11. Add 1 to a number represented by LinkedList25m
- L12. Find the intersection point of Y LinkedList32m
- L13. Find the middle element of the LinkedList | Multiple Approaches14m
- L14. Detect a loop or cycle in LinkedList | With proof and Intuition20m
- L15. Find the length of the Loop in LinkedList14m
- L16. Delete the middle node of the LinkedList16m
- L17. Find the starting point of the Loop/Cycle in LinkedList | Multiple Approaches22m
- L18. Delete all occurrences of a Key in DLL11m
- L19. Find all Pairs with given Sum in DLL14m
- L20. Remove duplicates from sorted DLL12m
- L21. Reverse Nodes in K Group Size of LinkedList24m
- L22. Rotate a LinkedList12m
- L23. Merge two sorted Linked Lists18m
- L24. Flattening a LinkedList | Multiple Approaches with Dry Run32m
- L25. Merge K Sorted Lists | Multiple Approaches30m
- L26. Sort a Linked List | Merge Sort and Brute Force22m
- L27. Clone a LinkedList with Next and Random Pointers | Copy List with Random Pointers33m
- L28. Design a Browser History | LinkedList Implementation14m
- L2. Print all Divisors of a Number | Maths Playlist9m
- L3. Check if a Number if Prime or not | Maths Playlist7m
- L4. Print all prime factors of a Number | Maths Playlist18m
- L5. Power Exponentiation | Maths Playlist12m
- L6. Sieve of Eratosthenes | Maths Playlist18m
- L7. Count Prime in a range L-R | Maths Playlist16m
- L8. Smallest Prime Factor (SPF) | Prime Factorisation | Query Based Problem | Maths Playlist16m
- L1. Introduction to Sliding Window and 2 Pointers | Templates | Patterns36m
- L2. Maximum Points You Can Obtain from Cards | 2 Pointers and Sliding Window Playlist11m
- L3. Longest Substring Without Repeating Characters | 2 Pointers and Sliding Window Playlist23m
- L4. Max Consecutive Ones III | 2 Pointers and Sliding Window Playlist29m
- L5. Fruit Into Baskets | 2 Pointers and Sliding Window Playlist30m
- L6. Longest Substring With At Most K Distinct Characters | 2 Pointers and Sliding Window Playlist21m
- L7. Number of Substrings Containing All Three Characters | 2 Pointers and Sliding Window Playlist19m
- L8. Longest Repeating Character Replacement | 2 Pointers and Sliding Window Playlist25m
- L9. Binary Subarrays With Sum | 2 Pointers and Sliding Window Playlist20m
- L10. Count number of Nice subarrays | 2 Pointers and Sliding Window Playlist4m
- L11. Subarray with k different integers | 2 Pointers and Sliding Window Playlist20m
- L12. Minimum Window Substring | 2 Pointers and Sliding Window Playlist27m
- L1. Assign Cookies | Greedy Algorithm Playlist10m
- L3. Shortest Job First (or SJF) CPU Scheduling7m
- L2. Lemonade Change | Greedy Algorithm Playlist9m
- L4. Jump Game - I | Greedy Algorithm Playlist10m
- L5. Jump Game - II | Greedy Algorithm Playlist16m
- L6. Job Sequencing Problem | Greedy Algorithm Playlist16m
- L7. N Meeting in One Room | Greedy Algorithms Playlist13m
- L8. Non Overlapping Intervals | Greedy Algorithms Playlist8m
- L9. Insert Intervals | Greedy Algorithms Playlist13m
- L10. Minimum number of platforms required in a railway station18m
- L11. Valid Parenthesis String | Multiple Approaches26m
- L13. Fractional Knapsack Algorithm18m
- L12. Candy | Slope Approach Intuition Based30m
- L1. Introduction to Stack and Queue | Implementation using Data Structures1h 5m
- L2. Check for Balanced Parentheses | Stack and Queue12m
- L3. Prefix, Infix, and Postfix Conversion | Stack and Queue Playlist50m
- L4. Implement Min Stack | Stack and Queue Playlist20m
- L5. Next Greater Element | Stack and Queue Playlist18m
- L6. Next Greater Element - II | Stack and Queue Playlist15m
- L7. Previous Smaller Element | Stack and Queue Playlist8m
- L8. Trapping Rainwater | 2 Approaches | Stack and Queue Playlist28m
- L9. Sum of Subarray Minimum | Stack and Queue Playlist23m
- L10. Sum of subarray ranges | Stack and Queue Playlist10m
- L11. Aestroid Collisions | Stack and Queue Playlist17m
- L12. Largest Rectangle in Histogram | Stack and Queue Playlist31m
- L13. Maximal Rectangle | Stack and Queue Playlist12m
- L14. Remove K Digits | Stack and Queue Playlist15m
- L15. Stock Span Problem | Stack and Queue Playlist19m
- L16. Sliding Window Maximum | Stack and Queue Playlist19m
- L17. The Celebrity Problem | Stack and Queue Playlist16m
- L18. Implement LRU Cache24m
- Implement LFU cache in C++/Java | Leetcode(Hard)17m