1. | Find All People With Secret | 4 Approaches | Google | Leetcode 2092 | 1:23:52 | |
|
2. | Maximal Rectangle | Multiple Hidden Problems | Intuition | Leetcode 85 | codestorywithMIK | 1:20:50 | |
|
3. | Maximum Balanced Subsequence Sum | Super Detailed Video | DP Concepts & Qns-16 | Leetcode-2926 | 1:19:01 | |
|
4. | Valid Parenthesis String | 4 Detailed Approaches | Leetcode 678 | codestorywithMIK | 1:13:23 | |
|
5. | Cherry Pickup II | 3 Approaches | Super Detailed | Leetcode 1463 | 1:07:51 | |
|
6. | Minimum Time to Revert Word to Initial State | Part I | Part II | KMP | Leetcode 3029 | 3031 | 1:07:22 | |
|
7. | N-Queens | 2 Approaches | Super Detailed | Magic Of Recursion | Recursion Concepts And Questions | 1:06:37 | |
|
8. | Maximum Number That Sum of the Prices Is Less Than or Equal to K |Brute Force |Optimal |Contest 380 | 1:06:23 | |
|
9. | Number of Ways of Cutting a Pizza - (Google, TikTok) | Leetcode-1444 | Explanation ➕ Live Coding | 1:06:23 | |
|
10. | Apply Operations to Maximize Frequency Score | Weekly Contest 376 | Leetcode 2968 | 1:06:02 | |
|
11. | Second Minimum Time to Reach Destination | 2 Approaches | FULL DRY RUN | Leetcode 2045 | 1:05:57 | |
|
12. | Knuth-Morris-Pratt KMP String Matching Algorithm | Search Pattern | GFG POTD | 1:05:36 | |
|
13. | Minimum Falling Path Sum II | 4 Approaches | Detailed Dry Run | Leetcode 1289 | codestorywithMIK | 1:05:22 | |
|
14. | Minimum Number of K Consecutive Bit Flips | 3 Approaches | Detailed | Leetcode 995 | 3191 | 1:03:24 | |
|
15. | Maximize the Number of Partitions After Operations | Leetcode Weekly Contest 379 | Leetcode 10038 | 1:02:17 | |
|
16. | Freedom Trail | Recursion | Memoization | Bottom Up | Detailed | Leetcode 514 | codestorywithMIK | 1:01:27 | |
|
17. | Find Subarray With Bitwise AND Closest to K | Sliding Window | Leetcode 3171 | codestorywithMIK | 1:00:23 | |
|
18. | Earliest Second to Mark Indices I | Detailed Intuition | Leetcode Weekly Contest 386 | Leetcode 3048 | 1:00:09 | |
|
19. | Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402 | 1:00:03 | |
|
20. | K Inverse Pairs Array | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 629 | 59:47 | |
|
21. | Number of Possible Sets of Closing Branches | Intuition | Leetcode-2959 | Bi-Weekly Contest 119 | 59:30 | |
|
22. | Constrained Subsequence Sum | Recursion | Memoization | Sliding Window | GOOGLE | Leetcode - 1425 | 58:50 | |
|
23. | Maximum Xor Product | Super Detailed | Leetcode Weekly Contest 372 | Leetcode-2939 | 58:41 | |
|
24. | Edit Distance | Recursion | Memo | Bottom Up | DP On Strings | Leetcode 72 | DP Concepts & Qns-21 | 58:11 | |
|
25. | Count Complete Substrings | Sliding Window | Weekly Contest 374 | Leetcode-2953 | 57:57 | |
|
26. | Palindromic Substrings | Blueprint | Palindrome Problems | 4 Approaches | Leetcode 647 | 57:30 | |
|
27. | Frequency of the Most Frequent Element | Binary Search | Sliding Window | META | Leetcode-1838 | 57:25 | |
|
28. | Number of Submatrices That Sum to Target | Subarray Sum Equals K | Leetcode 1074 | Leetcode 560 | 56:53 | |
|
29. | Out of Boundary Paths | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 576 | 56:46 | |
|
30. | Minimum Penalty for a Shop | MULTIPLE APPROACHES | Dry Run | META | Leetcode - 2483 | 55:28 | |
|
31. | Segment Tree | Introduction | Basics | Build Segment Tree | Video 1 | codestorywithMIK | 54:43 | |
|
32. | Regular Expression Matching | Brute Force | Optimal | Recursion Concepts And Questions | 54:24 | |
|
33. | Shortest Common Supersequence | 3 Approaches | DP On Strings |DP Concepts & Qns 20|codestorywithMIK | 53:05 | |
|
34. | Count Beautiful Substrings II | Detailed Approach | Intuition | Leetcode - 2949 | Weekly Contest 373 | 52:40 | |
|
35. | Largest Submatrix With Rearrangements | Build Intuition | 3 Approaches | Leetcode 1727 | 52:34 | |
|
36. | Best Time to Buy and Sell Stock with Cooldown - (Google,Microsoft,Amazon) : Explanation➕Live Coding | 51:58 | |
|
37. | Greatest Common Divisor Traversal | Why Graph | Why DSU | Google | Leetcode 2709 | 51:53 | |
|
38. | Furthest Building You Can Reach | What is Lazy Greedy | Recursion | Memoization | Leetcode 1642 | 51:23 | |
|
39. | Maximum Points After Collecting Coins From All Nodes | Memoization | Optimisations | Leetcode - 2920 | 51:15 | |
|
40. | Longest Arithmetic Subsequence | Recur + Memo | Bottom Up | GOOGLE | Leetcode-1027 | Live Code | 50:37 | |
|
41. | Sum of Subarray Minimums (Amazon, Google, Meta) : Explanation ➕ Live Coding 🧑🏻💻👩🏻💻 | 49:39 | |
|
42. | LFU Cache - (Microsoft) : Explanation➕Live Coding | 49:29 | |
|
43. | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Broken in Steps | Leetcode-1489 | 49:10 | |
|
44. | Range Update Query | Lazy Propagation | Segment Tree Concepts & Qns | Video 7 | codestorywithMIK | 49:06 | |
|
45. | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Leetcode 1438 |Detailed | 49:01 | |
|
46. | Minimum Falling Path Sum - (Google, Microsoft, Amazon, Flipkart, OLA…) : Explanation ➕ Live Coding | 48:56 | |
|
47. | Count Vowels Permutation | Recursion | Memoization | Bottom Up | GOOGLE | META | Leetcode - 1220 | 48:44 | |
|
48. | Shortest Path Visiting All Nodes | Clean | Simple | Intuitive | BFS | GOOGLE | Leetcode-847 | | 48:35 | |
|
49. | Longest Common Suffix Queries | Simple TRIE | Clean Code | Leetcode 3093 | codestorywithMIK | 48:34 | |
|
50. | Minimum Cost to Convert String I | Weekly Contest 377 | 2 Approaches | Leetcode 2976 | 48:11 | |
|
51. | Quick Sort | Simple Story | Story To Code | Recursion Concepts And Questions | Video 9 | 47:40 | |
|
52. | Longest Palindromic Substring | Recursion Memo | Bottom Up | DP On Strings | Leetcode 5 | 47:31 | |
|
53. | Gas Station (Google, Amazon, Uber, Microsoft, FactSet, Zoho, Flipkart) : Explanation ➕ Live Coding | 46:30 | |
|
54. | Minimum Cost For Tickets - (GOOGLE) | Leetcode-983 | 2 Approaches | Explanation ➕ Live Coding | 46:27 | |
|
55. | Count the nodes at distance K from leaf | 2 Approaches | Simple Dry Run | GFG POTD | 45:49 | |
|
56. | Largest Divisible Subset | LIS Variant | DP Concepts & Qns-18 | Leetcode-368 | 45:40 | |
|
57. | Island Perimeter | 3 Approaches | Google | Leetcode 463 | codestorywithMIK | 45:34 | |
|
58. | Maximum Strength of K Disjoint Subarrays | Recursion | Memoization | Leetcode 3077 | Contest 388 | 45:27 | |
|
59. | Minimum Operations to Make Array Equal to Target | Minimum Number of Increments|Leetcode 3229 & 1526 | 45:23 | |
|
60. | Copy List with Random Pointer | 2 Approaches | Clear Intuition | Dry Run | Microsoft| Leetcode - 138 | 45:08 | |
|
61. | Palindrome Linked List | 4 Approaches | Leetcode 234| codestorywithMIK | 44:53 | |
|
62. | Sum of Distances in Tree - (Google) : Explanation ➕ Live Coding | 44:46 | |
|
63. | Word Search II (Google, Amazon, Meta, Microsoft, Salesforce…) : Explanation ➕ Live Coding | 44:37 | |
|
64. | Number of Good Paths | GOOGLE | DSU | Explanation ➕ Live Coding | 44:27 | |
|
65. | Snakes and Ladders - (Microsoft, Amazon, Adobe..) : Explanation ➕ Live Coding | 44:24 | |
|
66. | Minimum Height Trees | Know Every Detail | Why BFS | GOOGLE | Leetcode 310 | codestorywithMIK | 44:23 | |
|
67. | Minimum Remove to Make Valid Parentheses | 3 Detailed Approaches | Leetcode 1249 | codestorywithMIK | 44:18 | |
|
68. | Largest Color Value in a Directed Graph | Leetcode - 1857 | META | Explanation ➕ Live Coding Trash | 44:15 | |
|
69. | Smallest Sufficient Team | Recur + Memo | Bit Manipulation Made Easy | AMAZON | Leetcode-1125 | 44:13 | |
|
70. | Minimum Cost Walk in Weighted Graph | Thought Process | DSU | Leetcode 3108 | codestorywithMIK | 44:02 | |
|
71. | Least Number of Unique Integers after K Removals | 3 Approaches | Greedy | Leetcode 1481 | 43:42 | |
|
72. | Longest Ideal Subsequence | LIS Variant | Bottom Up | Optimal | Leetcode 2370 | codestorywithMIK | 43:32 | |
|
73. | Bellman-Ford Algorithm | Full Detail | Microsoft, Amazon | Graph Concepts & Qns - 31 | Explanation | 43:22 | |
|
74. | Double a Number Represented as a Linked List | 4 Approaches | Story|Leetcode 2816 | codestorywithMIK | 43:12 | |
|
75. | Domino and Tromino Tiling - (Google) : Explanation ➕ Live Coding 👩🏻💻🧑🏻💻😱😱😱 | 43:02 | |
|
76. | All Ancestors of a Node in a Directed Acyclic Graph | 3 Approaches | Leetcode 2192 |codestorywithMIK | 42:56 | |
|
77. | Flatten Nested List Iterator | 3 Approaches | Full Details | GOOGLE | NETFLIX | Leetcode - 341 | 42:51 | |
|
78. | Shortest Path in Binary Matrix | Leetcode-1091 | Dijkstra in 2-D Matrix |Graph Concepts & Qns - 29 | 42:14 | |
|
79. | String Compression II | Recursion | Memo | Leetcode 1531 | 41:52 | |
|
80. | Median of Two Sorted Arrays | PART-2 | Best Approach | Binary Search | Google | Apple | Leetcode - 4 | 41:52 | |
|
81. | Maximum Subsequence Score | Intuition | AMAZON | Leetcode-2542 | Explanation ➕ Live Coding | 41:48 | |
|
82. | Maximize Score After N Operations | BRUTE FORCE To OPTIMAL | META | Leetcode-1799 | Live Code | 41:34 | |
|
83. | Number of Ways to Reorder Array to Get Same BST | Pascal's triangle | GOOGLE | Leetcode-1569 | 41:30 | |
|
84. | Clone Graph | Leetcode - 133 | Google, Facebook, Amazon | DFS+BFS | Explanation ➕ Live Coding🧑🏻💻 | 41:25 | |
|
85. | Maximize the Confusion of an Exam | 3 Approaches | MICROSOFT | Leetcode-2024 | Explanation | 41:16 | |
|
86. | Amount of Time for Binary Tree to Be Infected | Using DFS | One Pass | Leetcode 2385 | 41:14 | |
|
87. | Valid Sudoku -(Google, Amazon, Microsoft, Uber, Apple, Snapchat) : Explanation ➕ Live Coding | 41:14 | |
|
88. | Student Attendance Record II | Recursion | Memoization | Bottom Up | Leetcode 552 | codestorywithMIK | 40:53 | |
|
89. | Reorganize String | 2 Approaches | Time Complexity | Full Dry Run | TESLA | AMAZON | Leetcode-767 | 40:52 | |
|
90. | Build a Matrix With Conditions | BFS | DFS | Detailed Explanation | Leetcode 2392 | codestorywithMIK | 40:50 | |
|
91. | Rat in a Maze Problem | Simple Story To Code | Recursion Concepts And Questions | Video 11 | 40:50 | |
|
92. | Even Odd Tree | DFS | BFS | Leetcode 1609 | 40:37 | |
|
93. | Maximum Score From Removing Substrings | 2 Approaches | With Proof | Leetcode 1717 | 40:33 | |
|
94. | LRU Cache - (Adobe, Microsoft, Amazon, Twitch...):Explanation➕Live Coding | 40:32 | |
|
95. | Substring With Largest Variance | Full Dry Run | Leetcode-2272 | AMAZON, GOOGLE | Explanation | 40:29 | |
|
96. | Find the Longest Valid Obstacle Course at Each Position | META | Leetcode-1964 | Live Coding | 40:22 | |
|
97. | Permutations II | Two Approaches | Detailed | Recursion Concepts And Questions | 40:10 | |
|
98. | Shortest Uncommon Substring in an Array | Detailed Intuition | Dry Run | Leetcode 3076 | Contest 388 | 40:08 | |
|
99. | Maximum Length of a Concatenated String with Unique Characters | Using Bit Magic | Leetcode 1239 | 40:05 | |
|
100. | Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91 | 40:04 | |
|