Take U Forward
Striver's A to Z DSA Course
0%
Progress
0 / 315 videos
Playlist Videos
315 Videos0 / 315 Completed
1.
8:24
Don't watch my A2Z DSA Course
2.
8:51
How to setup VS code for DSA and CP | Input / Output split format
3.
1:26:27
C++ Basics in One Shot - Strivers A2Z DSA Course - L1
4.
35:16
Time and Space Complexity - Strivers A2Z DSA Course
5.
1:22:06
Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course
6.
1:07:37
Complete C++ STL in 1 Video | Time Complexity and Notes
7.
1:03:20
Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course
8.
22:46
Re 1. Introduction to Recursion | Recursion Tree | Stack Space | Strivers A2Z DSA Course
9.
22:04
Re 2. Problems on Recursion | Strivers A2Z DSA Course
10.
18:14
Re 3. Parameterised and Functional Recursion | Strivers A2Z DSA Course
11.
19:48
Re 4. Problems on Functional Recursion | Strivers A2Z DSA Course
12.
16:45
Re 5. Multiple Recursion Calls | Problems | Strivers A2Z DSA Course
13.
1:00:06
Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course
14.
43:44
Sorting - Part 1 | Selection Sort, Bubble Sort, Insertion Sort | Strivers A2Z DSA Course
15.
49:43
Merge Sort | Algorithm | Pseudocode | Dry Run | Code | Strivers A2Z DSA Course
16.
35:17
Quick Sort For Beginners | Strivers A2Z DSA Course
17.
43:26
Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video
18.
1:13:17
Rotate Array by K places | Union, Intersection of Sorted Arrays | Move Zeros to End | Arrays Part-2
19.
38:00
Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3
20.
41:42
Longest Subarray with sum K | Brute - Better - Optimal | Generate Subarrays
21.
18:20
2 Sum Problem | 2 types of the same problem for Interviews | Brute-Better-Optimal
22.
25:07
Sort an array of 0's 1's & 2's | Intuition of Algo🔥 | C++ Java Python | Brute-Better-Optimal
23.
18:13
Majority Element I | Brute-Better-Optimal | Moore's Voting Algorithm | Intuition 🔥|Brute to Optimal
24.
20:09
Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing
25.
9:11
DP 35. Best Time to Buy and Sell Stock | DP on Stocks 🔥
26.
21:37
Rearrange Array Elements by Sign | 2 Varieties of same Problem
27.
28:15
Next Permutation - Intuition in Detail 🔥 | Brute to Optimal
28.
11:53
Leaders in an Array | Brute - Optimal | Strivers A2Z DSA Course
29.
23:11
Longest Consecutive Sequence | Google Interview Question | Brute Better Optimal
30.
30:07
Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal
31.
17:47
Rotate Matrix/Image by 90 Degrees | Brute - Optimal
32.
16:33
Spiral Traversal of a Matrix | Spiral Matrix
33.
24:09
Count Subarray sum Equals K | Brute - Better -Optimal
34.
26:45
Pascal Triangle | Finding nCr in minimal time
35.
26:58
Majority Element II | Brute-Better-Optimal
36.
38:25
3 Sum | Brute - Better - Optimal with Codes
37.
28:47
4 Sum | Brute - Better - Optimal with Codes
38.
24:55
Number of Subarrays with xor K | Brute - Better - Optimal
39.
22:35
Merge Overlapping Intervals | Brute, Optimal with Precise TC analysis
40.
32:47
Merge Sorted Arrays Without Extra Space | 2 Optimal Solution
41.
42:24
Find the Missing and Repeating Number | 4 Approaches 🔥
42.
24:17
Count Inversions in an Array | Brute and Optimal
43.
32:26
Reverse Pairs | Hard Interview Question
44.
20:27
Maximum Product Subarray - Best Intuitive Approach Discussed
45.
33:27
BS-1. Binary Search Introduction | Real Life Example | Iterative | Recursive | Overflow Cases
46.
32:26
BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil
47.
25:28
BS-3. First and Last Occurrences in Array | Count occurrences in Array
48.
16:38
BS-4. Search Element in Rotated Sorted Array - I
49.
12:44
BS-5. Search Element in Rotated Sorted Array II
50.
17:08
BS-6. Minimum in Rotated Sorted Array
51.
5:01
BS-7. Find out how many times array has been rotated
52.
22:16
BS-8. Single Element in Sorted Array
53.
32:53
BS-9. Find Peak Element
54.
17:11
BS-10. Finding Sqrt of a number using Binary Search
55.
20:44
BS-11. Find the Nth root of an Integer
56.
21:04
BS-12. Koko Eating Bananas
57.
26:01
BS-13. Minimum days to make M bouquets | Binary Search
58.
16:00
BS-14. Find the Smallest Divisor Given a Threshold | Binary Search
59.
20:36
BS-15. Capacity to Ship Packages within D Days
60.
22:52
BS-16. Kth Missing Positive Number | Maths + Binary Search
61.
26:44
BS-17. Aggressive Cows | Binary Search Hard
62.
27:29
BS-18. Allocate Books or Book Allocation | Hard Binary Search
63.
11:20
BS 19. Painter's Partition and Split Array - Largest Sum
64.
59:12
BS-20. Minimise Maximum Distance between Gas Stations | 3 Approaches | Heap | Binary Search
65.
15:59
BS 21: Median of two Sorted Arrays of Different Sizes | Brute and Better Approach
66.
35:00
BS-21. Median of two Sorted Arrays of Different Sizes | Binary Search Approach With Intuition
67.
11:53
Bs-22. K-th element of two sorted arrays | Binary Search Approach
68.
10:18
BS 23. Row with maximum number of 1s | Binary Search on 2D Arrays
69.
15:42
BS-24. Search in a 2D Matrix - I | Binary Search of 2D
70.
15:29
BS-25. Search in a 2D Matrix - II | Binary Search on 2D
71.
20:02
BS-26. Find Peak Element-II | Binary Search
72.
23:13
BS-27. Median in a Row Wise Sorted Matrix
73.
9:50
L1. Introduction to Trees | Types of Trees
74.
4:43
L2. Binary Tree Representation in C++
75.
4:12
L3. Binary Tree Representation in Java
76.
9:59
L4. Binary Tree Traversals in Binary Tree | BFS | DFS
77.
7:29
L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation
78.
7:07
L6. Inorder Traversal of Binary Tree | C++ | Java | Code Explanation
79.
5:31
L7. Postorder Traversal of Binary Tree | C++ | Java | Code Explanation
80.
8:57
L8. Level Order Traversal of Binary Tree | BFS | C++ | Java
81.
6:50
L9. Iterative Preorder Traversal in Binary Tree | C++ | Java | Stack
82.
11:14
L10. iterative Inorder Traversal in Binary Tree | C++ | Java | Stack
83.
4:09
L11. Iterative Postorder Traversal using 2 Stack | C++ | Java | Binary Tree
84.
12:33
L12. Iterative Postorder Traversal using 1 Stack | C++ | Java | Binary Trees
85.
10:57
L13. Preorder Inorder Postorder Traversals in One Traversal | C++ | Java | Stack | Binary Trees
86.
8:05
L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java
87.
12:30
L15. Check for Balanced Binary Tree | C++ | Java
88.
13:47
L16. Diameter of Binary Tree | C++ | Java
89.
17:50
L17. Maximum Path Sum in Binary Tree | C++ | Java
90.
4:18
L18. Check it two trees are Identical or Not | C++ | Java
91.
8:21
L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java
92.
9:47
L20. Boundary Traversal in Binary Tree | C++ | Java
93.
18:53
L21. Vertical Order Traversal of Binary Tree | C++ | Java
94.
10:30
L22. Top View of Binary Tree | C++ | Java
95.
13:13
L23. Bottom View of Binary Tree | C++ | Java
96.
13:28
L24. Right/Left View of Binary Tree | C++ | Java
97.
9:20
L25. Check for Symmetrical Binary Trees | C++ | Java
98.
11:00
L26. Print Root to Node Path in Binary Tree | C++ | Java
99.
14:09
L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java
100.
22:41
L28. Maximum Width of Binary Tree | C++ | Java
101.
16:13
L29. Children Sum Property in Binary Tree | O(N) Approach | C++ | Java
102.
17:42
L30. Print all the Nodes at a distance of K in Binary Tree | C++ | Java
103.
18:24
L31. Minimum time taken to BURN the Binary Tree from a Node | C++ | Java
104.
16:13
L32. Count total Nodes in a COMPLETE Binary Tree | O(Log^2 N) Approach | C++ | Java
105.
8:41
L33. Requirements needed to construct a Unique Binary Tree | Theory
106.
18:52
L34. Construct a Binary Tree from Preorder and Inorder Traversal | C++ | Java
107.
19:46
L35. Construct the Binary Tree from Postorder and Inorder Traversal | C++ | Java
108.
17:18
L36. Serialize and De-serialize Binary Tree | C++ | Java
109.
23:50
L37. Morris Traversal | Preorder | Inorder | C++ | Java
110.
21:51
L38. Flatten a Binary Tree to Linked List | 3 Approaches | C++ | Java
111.
8:54
L39. Introduction to Binary Search Tree | BST
112.
6:33
L40. Search in a Binary Search Tree | BST | C++ | Java
113.
5:36
L41. Ceil in a Binary Search Tree | BST | C++ | Java
114.
5:00
L42. Floor in a Binary Search Tree | BST | C++ | Java
115.
8:18
L43. Insert a given Node in Binary Search Tree | BST | C++ | Java
116.
15:48
L44. Delete a Node in Binary Search Tree | BST | C++ | Java
117.
8:27
L45. K-th Smallest/Largest Element in BST
118.
9:39
L46. Check if a tree is a BST or BT | Validate a BST
119.
8:06
L47. LCA in Binary Search Tree
120.
16:32
L48. Construct a BST from a preorder traversal | 3 Methods
121.
10:47
L49. Inorder Successor/Predecessor in BST | 3 Methods
122.
14:00
L50. Binary Search Tree Iterator | BST | O(H) Space
123.
15:06
L51. Two Sum In BST | Check if there exists a pair with Sum K
124.
15:56
L52. Recover BST | Correct BST with two nodes swapped
125.
17:27
L53. Largest BST in Binary Tree
126.
13:43
G-1. Introduction to Graph | Types | Different Conventions Used
127.
16:04
G-2. Graph Representation in C++ | Two Ways to Represent
128.
13:13
G-3. Graph Representation in Java | Two Ways to Represent
129.
7:07
G-4. What are Connected Components ?
130.
19:39
G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs
131.
20:16
G-6. Depth-First Search (DFS) | C++ and Java | Traversal Technique in Graphs
132.
15:29
G-7. Number of Provinces | C++ | Java | Connected Components
133.
25:04
G-8. Number of Islands | Number of Connected Components in Matrix | C++ | Java
134.
20:34
G-9. Flood Fill Algorithm | C++ | Java
135.
22:30
G-10. Rotten Oranges | C++ | Java
136.
20:19
G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java
137.
19:10
G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java
138.
20:21
G-13. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java
139.
23:17
G-14. Surrounded Regions | Replace O's with X's | C++ | Java
140.
15:34
G-15. Number of Enclaves | Multi-source BFS | C++ | Java
141.
18:02
G-16. Number of Distinct Islands | Constructive Thinking + DFS | C++ | Java
142.
18:29
G-17. Bipartite Graph | BFS | C++ | Java
143.
14:54
G-18. Bipartite Graph | DFS | C++ | Java
144.
17:22
G-19. Detect cycle in a directed graph using DFS | Java | C++
145.
23:43
G-20. Find Eventual Safe States - DFS
146.
13:30
G-21. Topological Sort Algorithm | DFS
147.
13:50
G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS
148.
6:17
G-23. Detect a Cycle in Directed Graph | Topological Sort | Kahn's Algorithm | BFS
149.
11:32
G-24. Course Schedule I and II | Pre-requisite Tasks | Topological Sort
150.
16:57
G-25. Find Eventual Safe States - BFS - Topological Sort
151.
20:54
G-26. Alien Dictionary - Topological Sort
152.
26:36
G-27. Shortest Path in Directed Acyclic Graph - Topological Sort
153.
16:32
G-28. Shortest Path in Undirected Graph with Unit Weights
154.
28:07
G-29. Word Ladder - I | Shortest Paths
155.
25:42
G-30. Word Ladder - 2 | Shortest Paths
156.
23:40
G-31. Word Ladder - 2 | Optimised Approach for Leetcode
157.
22:42
G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1
158.
12:29
G-33. Dijkstra's Algorithm - Using Set - Part 2
159.
14:30
G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3
160.
19:20
G-35. Print Shortest Path - Dijkstra's Algorithm
161.
23:42
G-36. Shortest Distance in a Binary Maze
162.
24:30
G-37. Path With Minimum Effort
163.
23:56
G-38. Cheapest Flights Within K Stops
164.
19:31
G-39. Minimum Multiplications to Reach End
165.
24:06
G-40. Number of Ways to Arrive at Destination
166.
27:43
G-41. Bellman Ford Algorithm
167.
30:13
G-42. Floyd Warshall Algorithm
168.
12:56
G-43. Find the City With the Smallest Number of Neighbours at a Threshold Distance
169.
7:59
G-44. Minimum Spanning Tree - Theory
170.
19:10
G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java
171.
42:15
G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression
172.
13:11
G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java
173.
8:03
G-48. Number of Provinces - Disjoint Set
174.
14:48
G-49. Number of Operations to Make Network Connected - DSU
175.
22:01
G-50. Accounts Merge - DSU
176.
25:32
G-51. Number of Islands - II - Online Queries - DSU
177.
26:16
G-52. Making a Large Island - DSU
178.
23:51
G-53. Most Stones Removed with Same Row or Column - DSU
179.
22:44
G-54. Strongly Connected Components - Kosaraju's Algorithm
180.
23:25
G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time
181.
22:00
G-56. Articulation Point in Graph
182.
33:51
DP 1. Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimization Techniques
183.
13:17
DP 2. Climbing Stairs | Learn How to Write 1D Recurrence Relations
184.
38:50
DP 3. Frog Jump | Dynamic Programming | Learn to write 1D DP
185.
17:35
DP 4. Frog Jump with K Distance | Lecture 3 Follow Up Question
186.
32:23
DP 5. Maximum Sum of Non-Adjacent Elements | House Robber | 1-D | DP on Subsequences
187.
9:50
DP 6. House Robber 2 | 1D DP | DP on Subsequences
188.
52:18
DP 7. Ninja's Training | MUST WATCH for 2D CONCEPTS 🔥 | Vacation | Atcoder | 2D DP |
189.
48:29
DP 8. Grid Unique Paths | Learn Everything about DP on Grids | ALL TECHNIQUES 🔥
190.
12:59
DP 9. Unique Paths 2 | DP on Grid with Maze Obstacles
191.
23:47
DP 10. Minimum Path Sum in Grid | Asked to me In Microsoft Internship Interview | DP on GRIDS
192.
34:39
DP 11. Triangle | Fixed Starting Point and Variable Ending Point | DP on GRIDS
193.
42:38
DP 12. Minimum/Maximum Falling Path Sum | Variable Starting and Ending Points | DP on Grids
194.
43:23
DP 13. Cherry Pickup II | 3D DP Made Easy | DP On Grids
195.
38:49
DP 14. Subset Sum Equals to Target | Identify DP on Subsequences and Ways to Solve them
196.
9:43
DP 15. Partition Equal Subset Sum | DP on Subsequences
197.
29:50
Dp 16. Partition A Set Into Two Subsets With Minimum Absolute Sum Difference | DP on Subsequences
198.
36:57
DP 17. Counts Subsets with Sum K | Dp on Subsequences
199.
18:00
DP 18. Count Partitions With Given Difference | Dp on Subsequences
200.
41:19
DP 19. 0/1 Knapsack | Recursion to Single Array Space Optimised Approach | DP on Subsequences
201.
34:15
DP 20. Minimum Coins | DP on Subsequences | Infinite Supplies Pattern
202.
9:04
DP 21. Target Sum | DP on Subsequences
203.
22:17
DP 22. Coin Change 2 | Infinite Supply Problems | DP on Subsequences
204.
22:54
DP 23. Unbounded Knapsack | 1-D Array Space Optimised Approach
205.
22:54
DP 24. Rod Cutting Problem | 1D Array Space Optimised Approach
206.
47:09
Dp 25. Longest Common Subsequence | Top Down | Bottom-Up | Space Optimised | DP on Strings
207.
16:55
DP 26. Print Longest Common Subsequence | Dp on Strings
208.
14:01
DP 27. Longest Common Substring | DP on Strings 🔥
209.
9:38
DP 28. Longest Palindromic Subsequence
210.
12:00
DP 29. Minimum Insertions to Make String Palindrome
211.
7:30
DP 30. Minimum Insertions/Deletions to Convert String A to String B
212.
26:44
DP 31. Shortest Common Supersequence | DP on Strings
213.
40:15
DP 32. Distinct Subsequences | 1D Array Optimisation Technique 🔥
214.
37:39
DP 33. Edit Distance | Recursive to 1D Array Optimised Solution 🔥
215.
43:52
DP 34. Wildcard Matching | Recursive to 1D Array Optimisation 🔥
216.
35:34
DP 36. Buy and Sell Stock - II | Recursion to Space Optimisation
217.
31:50
DP 37. Buy and Sell Stocks III | Recursion to Space Optimisation
218.
12:24
DP 38. Buy and Stock Sell IV | Recursion to Space Optimisation
219.
15:21
DP 39. Buy and Sell Stocks With Cooldown | Recursion to Space Optimisation
220.
7:20
DP 40. Buy and Sell Stocks With Transaction Fee | Recursion to Space Optimisation
221.
24:35
DP 41. Longest Increasing Subsequence | Memoization
222.
25:57
DP 42. Printing Longest Increasing Subsequence | Tabulation | Algorithm
223.
16:27
DP 43. Longest Increasing Subsequence | Binary Search | Intuition
224.
14:39
DP 44. Largest Divisible Subset | Longest Increasing Subsequence
225.
16:57
DP 45. Longest String Chain | Longest Increasing Subsequence | LIS
226.
13:52
DP 46. Longest Bitonic Subsequence | LIS
227.
20:46
DP 47. Number of Longest Increasing Subsequences
228.
53:41
DP 48. Matrix Chain Multiplication | MCM | Partition DP Starts 🔥
229.
9:08
DP 49. Matrix Chain Multiplication | Bottom-Up | Tabulation
230.
30:02
DP 50. Minimum Cost to Cut the Stick
231.
34:00
DP 51. Burst Balloons | Partition DP | Interactive G-Meet Session Update
232.
34:55
DP 52. Evaluate Boolean Expression to True | Partition DP
233.
23:17
DP 53. Palindrome Partitioning - II | Front Partition 🔥
234.
21:39
DP 54. Partition Array for Maximum Sum | Front Partition 🔥
235.
11:04
DP 55. Maximum Rectangle Area with all 1's | DP on Rectangles
236.
15:59
DP 56. Count Square Submatrices with All Ones | DP on Rectangles 🔥
237.
45:17
L1. Introduction to LinkedList | Traversal | Length | Search an Element
238.
56:30
L2. Deletion and Insertion in LL | 8 Problems
239.
1:04:07
L3. Introduction to Doubly LinkedList | Insertions and Deletions
240.
18:30
L4. Reverse a DLL | Multiple Approaches
241.
14:48
L5. Add 2 numbers in LinkedList | Dummy Node Approach
242.
24:05
L6. Odd Even Linked List | Multiple Approaches
243.
23:23
L7. Sort a LinkedList of 0's, 1's and 2's | Multiple Approaches
244.
16:23
L8. Remove Nth Node from the end of the LinkedList | Multiple Approaches
245.
32:42
L9. Reverse a LinkedList | Iterative and Recursive
246.
20:02
L10. Check if a LinkedList is Palindrome or Not | Multiple Approaches
247.
25:28
L11. Add 1 to a number represented by LinkedList
248.
32:05
L12. Find the intersection point of Y LinkedList
249.
14:37
L13. Find the middle element of the LinkedList | Multiple Approaches
250.
20:26
L14. Detect a loop or cycle in LinkedList | With proof and Intuition
251.
14:01
L15. Find the length of the Loop in LinkedList
252.
16:36
L16. Delete the middle node of the LinkedList
253.
22:42
L17. Find the starting point of the Loop/Cycle in LinkedList | Multiple Approaches
254.
11:13
L18. Delete all occurrences of a Key in DLL
255.
14:14
L19. Find all Pairs with given Sum in DLL
256.
12:53
L20. Remove duplicates from sorted DLL
257.
24:31
L21. Reverse Nodes in K Group Size of LinkedList
258.
12:10
L22. Rotate a LinkedList
259.
18:55
L23. Merge two sorted Linked Lists
260.
32:58
L24. Flattening a LinkedList | Multiple Approaches with Dry Run
261.
30:02
L25. Merge K Sorted Lists | Multiple Approaches
262.
22:11
L26. Sort a Linked List | Merge Sort and Brute Force
263.
33:00
L27. Clone a LinkedList with Next and Random Pointers | Copy List with Random Pointers
264.
14:38
L28. Design a Browser History | LinkedList Implementation
265.
9:10
L2. Print all Divisors of a Number | Maths Playlist
266.
7:10
L3. Check if a Number if Prime or not | Maths Playlist
267.
18:53
L4. Print all prime factors of a Number | Maths Playlist
268.
12:39
L5. Power Exponentiation | Maths Playlist
269.
18:27
L6. Sieve of Eratosthenes | Maths Playlist
270.
16:39
L7. Count Prime in a range L-R | Maths Playlist
271.
16:57
L8. Smallest Prime Factor (SPF) | Prime Factorisation | Query Based Problem | Maths Playlist
272.
36:55
L1. Introduction to Sliding Window and 2 Pointers | Templates | Patterns
273.
11:13
L2. Maximum Points You Can Obtain from Cards | 2 Pointers and Sliding Window Playlist
274.
23:09
L3. Longest Substring Without Repeating Characters | 2 Pointers and Sliding Window Playlist
275.
29:58
L4. Max Consecutive Ones III | 2 Pointers and Sliding Window Playlist
276.
30:02
L5. Fruit Into Baskets | 2 Pointers and Sliding Window Playlist
277.
21:32
L6. Longest Substring With At Most K Distinct Characters | 2 Pointers and Sliding Window Playlist
278.
19:40
L7. Number of Substrings Containing All Three Characters | 2 Pointers and Sliding Window Playlist
279.
25:21
L8. Longest Repeating Character Replacement | 2 Pointers and Sliding Window Playlist
280.
20:27
L9. Binary Subarrays With Sum | 2 Pointers and Sliding Window Playlist
281.
4:54
L10. Count number of Nice subarrays | 2 Pointers and Sliding Window Playlist
282.
20:49
L11. Subarray with k different integers | 2 Pointers and Sliding Window Playlist
283.
27:06
L12. Minimum Window Substring | 2 Pointers and Sliding Window Playlist
284.
10:51
L1. Assign Cookies | Greedy Algorithm Playlist
285.
7:20
L3. Shortest Job First (or SJF) CPU Scheduling
286.
9:00
L2. Lemonade Change | Greedy Algorithm Playlist
287.
10:53
L4. Jump Game - I | Greedy Algorithm Playlist
288.
16:45
L5. Jump Game - II | Greedy Algorithm Playlist
289.
16:07
L6. Job Sequencing Problem | Greedy Algorithm Playlist
290.
13:12
L7. N Meeting in One Room | Greedy Algorithms Playlist
291.
8:46
L8. Non Overlapping Intervals | Greedy Algorithms Playlist
292.
13:16
L9. Insert Intervals | Greedy Algorithms Playlist
293.
18:10
L10. Minimum number of platforms required in a railway station
294.
26:09
L11. Valid Parenthesis String | Multiple Approaches
295.
18:41
L13. Fractional Knapsack Algorithm
296.
30:10
L12. Candy | Slope Approach Intuition Based
297.
1:05:06
L1. Introduction to Stack and Queue | Implementation using Data Structures
298.
12:28
L2. Check for Balanced Parentheses | Stack and Queue
299.
50:47
L3. Prefix, Infix, and Postfix Conversion | Stack and Queue Playlist
300.
20:55
L4. Implement Min Stack | Stack and Queue Playlist
301.
18:25
L5. Next Greater Element | Stack and Queue Playlist
302.
15:41
L6. Next Greater Element - II | Stack and Queue Playlist
303.
8:11
L7. Previous Smaller Element | Stack and Queue Playlist
304.
28:58
L8. Trapping Rainwater | 2 Approaches | Stack and Queue Playlist
305.
23:35
L9. Sum of Subarray Minimum | Stack and Queue Playlist
306.
10:34
L10. Sum of subarray ranges | Stack and Queue Playlist
307.
17:29
L11. Aestroid Collisions | Stack and Queue Playlist
308.
31:42
L12. Largest Rectangle in Histogram | Stack and Queue Playlist
309.
12:12
L13. Maximal Rectangle | Stack and Queue Playlist
310.
15:29
L14. Remove K Digits | Stack and Queue Playlist
311.
19:21
L15. Stock Span Problem | Stack and Queue Playlist
312.
19:58
L16. Sliding Window Maximum | Stack and Queue Playlist
313.
16:17
L17. The Celebrity Problem | Stack and Queue Playlist
314.
24:56
L18. Implement LRU Cache
315.
17:44