1. | How codestorywithMIK was started | Motivation | Rejections | 50K Special | 227 | |
|
2. | Subarrays with K Different Integers | Approach-1 | With Reasons | Leetcode 992 | codestorywithMIK | 208 | |
|
3. | Decoded String at Index | Clean Code | TCS | GOOGLE | ORACLE | Leetcode - 880 | 194 | |
|
4. | Word Break | Tree Diagram | Recursion | Memoization | Similar Problems | Leetcode-139 | 161 | |
|
5. | Find K-th Smallest Pair Distance | Multiple Approaches | Leetcode 719 | codestorywithMIK | 154 | |
|
6. | K Inverse Pairs Array | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 629 | 150 | |
|
7. | Build Array Where You Can Find The Maximum Exactly K Comparisons |DP Concepts & Qns-14|Leetcode-1420 | 143 | |
|
8. | Number of Good Leaf Nodes Pairs | Using Graph And BFS | Dry Run | Leetcode 1530 | codestorywithMIK | 138 | |
|
9. | Minimum Time to Collect All Apples in a Tree - (Microsoft) : Explanation ➕ Live Coding | 136 | |
|
10. | Remove K Digits | Intuition | Dry Run | Leetcode 402 | codestorywithMIK | 131 | |
|
11. | Regions Cut By Slashes | Already Studied Concept | Easy Code | Leetcode 959 | codestorywithMIK | 130 | |
|
12. | Shortest Path Visiting All Nodes | Clean | Simple | Intuitive | BFS | GOOGLE | Leetcode-847 | | 127 | |
|
13. | Unique Binary Search Trees II | Similar Problem | Recursion | Memoization | Amazon | Leetcode-95 | 126 | |
|
14. | Combinations | INTUITIVE | Backtracking Template | Two Ways | Similar Problems | Leetcode-77 | 119 | |
|
15. | Find the Longest Substring Containing Vowels in Even Counts | Leetcode 1371 | codestorywithMIK | 119 | | Counter-Strike: Source
|
16. | Maximum Number of Points with Cost | Detailed Explanation | Leetcode 1937 | codestorywithMIK | 119 | |
|
17. | Interleaving String | Khandaani Tareeka | Memoization | GOOGLE | Leetcode-97 | 118 | |
|
18. | Sliding Window Maximum | Monotonic Deque | INTUITIVE | GOOGLE | Leetcode-239 | Dry Run | 116 | |
|
19. | Max Dot Product of Two Subsequences | Recursion | Memoization | AMAZON | Leetcode - 1458 | 114 | |
|
20. | Count All Valid Pickup and Delivery Options | CLEAR INTUITION | META | Leetcode - 1359 | 113 | |
|
21. | 132 Pattern | Intuition explained | Brute Force | Better | Optimal | META | AMAZON | Leetcode - 456 | 113 | |
|
22. | Minimum ASCII Delete Sum for Two Strings | INTUITIVE | Recursion | Memoization | Leetcode-712 | 112 | |
|
23. | Smallest Sufficient Team | Recur + Memo | Bit Manipulation Made Easy | AMAZON | Leetcode-1125 | 110 | |
|
24. | Remove Duplicate Letters | Why Monotonic Stack | Intuition | GOOGLE | Leetcode - 316 | 110 | |
|
25. | 2 Keys Keyboard | Detailed Explanations | Leetcode 650 | codestorywithMIK | 109 | |
|
26. | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Broken in Steps | Leetcode-1489 | 107 | |
|
27. | Longest Palindromic Substring | Recursion | Memoization | Microsoft | Leetcode - 5 | 107 | |
|
28. | Count Number of Teams | Simple thought process | Intuition | Leetcode 1395 | 107 | |
|
29. | Text Justification | Broken into Pieces | GOOGLE | Leetcode-68 | Explanation + Live Coding | 107 | |
|
30. | Predict the Winner | Two Recursive Approaches | Memoization | Game Strategy | AMAZON | Leetcode-486 | 106 | |
|
31. | Integer Break | Tree Diagram | Recursion | Memoization | AMAZON | Leetcode - 343 | 105 | |
|
32. | Champagne Tower | Recursion | Memoization | GOOGLE | Leetcode - 799 | 104 | |
|
33. | Subarray Sums Divisible by K - (Microsoft, Amazon, Paytm) : Explanation ➕ Live Coding | 103 | |
|
34. | Minimize the Maximum Difference of Pairs | Binary Search Pattern | INTUITION | META | Leetcode-2616 | 102 | |
|
35. | Constrained Subsequence Sum | Recursion | Memoization | Sliding Window | GOOGLE | Leetcode - 1425 | 101 | |
|
36. | Segment Tree | Introduction | Basics | Build Segment Tree | Video 1 | codestorywithMIK | 101 | |
|
37. | Number of Ways to Stay in the Same Place After Some Steps | Recursion | Memoization | Leetcode- 1269 | 101 | |
|
38. | Copy List with Random Pointer | 2 Approaches | Clear Intuition | Dry Run | Microsoft| Leetcode - 138 | 101 | |
|
39. | Maximum Subsequence Score | Intuition | AMAZON | Leetcode-2542 | Explanation ➕ Live Coding | 101 | |
|
40. | Furthest Building You Can Reach | What is Lazy Greedy | Recursion | Memoization | Leetcode 1642 | 100 | |
|
41. | Count Triplets That Can Form Two Arrays of Equal XOR | Leetcode 1442 | codestorywithMIK | 99 | |
|
42. | Strange Printer | INTUITIVE | Recursion | Memoization | NetEase | Leetcode-664 | 99 | |
|
43. | Minimum Replacements to Sort the Array | Cleanest Code | Full Dry Run | GOOGLE | Leetcode - 2366 | 98 | |
|
44. | Binary Trees With Factors | Easy Intuition | Dry Run | GOOGLE | Leetcode - 823 | 97 | |
|
45. | Gas Station (Google, Amazon, Uber, Microsoft, FactSet, Zoho, Flipkart) : Explanation ➕ Live Coding | 97 | |
|
46. | Frog Jump | Khandaani Tareeka | Memoization | GOOGLE | AMAZON | META | Leetcode-403 | 96 | |
|
47. | Last Moment Before All Ants Fall Out of a Plank | Easy Explanation | GOOGLE | Leetcode - 1503 | 95 | |
|
48. | Find the Closest Palindrome | Simple Observations | Leetcode 564 | codestorywithMIK | 95 | |
|
49. | Maximum Number of Events That Can Be Attended II | Recur + Memo | 2 Ways | AMAZON | Leetcode-1751 | 94 | |
|
50. | Substring With Largest Variance | Full Dry Run | Leetcode-2272 | AMAZON, GOOGLE | Explanation | 93 | |
|
51. | The Imperial Delhi | Weekend Getaway | Luxury Stay | 5 Star hotel | WeekendWithMik | 93 | |
|
52. | Number of Submatrices That Sum to Target | Subarray Sum Equals K | Leetcode 1074 | Leetcode 560 | 92 | |
|
53. | Minimum Number of K Consecutive Bit Flips | 3 Approaches | Detailed | Leetcode 995 | 3191 | 92 | |
|
54. | Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402 | 92 | |
|
55. | Single Number III | Detailed Explanation | Leetcode 260 | codestorywithMIK | 92 | |
|
56. | Out of Boundary Paths | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 576 | 91 | |
|
57. | Patching Array | Thought Process | Dry Runs | GOOGLE | Leetcode 330 | codestorywithMIK | 91 | |
|
58. | Pseudo-Palindromic Paths in a Binary Tree | 2 Ways | Bit Magic | Leetcode 1457 | 91 | |
|
59. | Maximal Rectangle | Multiple Hidden Problems | Intuition | Leetcode 85 | codestorywithMIK | 91 | |
|
60. | Reconstruct Itinerary | Clean | Simple | Intuitive | GOOGLE | Leetcode-332 | Live Code | 91 | |
|
61. | Replace Words | Using HashSet | Uber | Leetcode 648 | codestorywithMIK | 90 | |
|
62. | Minimum Deletions to Make String Balanced | Multiple Approaches | Leetcode 1653 | codestorywithMIK | 90 | |
|
63. | Minimum Penalty for a Shop | MULTIPLE APPROACHES | Dry Run | META | Leetcode - 2483 | 89 | |
|
64. | Painting the Walls | Why Greedy Fails | Recursion | Memoization | GOOGLE | Leetcode - 2742 | 89 | |
|
65. | Sort Items by Groups Respecting Dependencies | Broken into Simple Steps | Intuition | Leetcode-1203 | 88 | |
|
66. | Maximum Number of Achievable Transfer Requests | Khandani Backtracking Template | Leetcode-1601 | 87 | |
|
67. | Maximize the Confusion of an Exam | 3 Approaches | MICROSOFT | Leetcode-2024 | Explanation | 87 | |
|
68. | First Missing Positive | In Depth Intuition | Clean Code | Leetcode 41 | codestorywithMIK | 87 | |
|
69. | Maximum Running Time of N Computers | Binary Search | INTUITION | Dry Run | GOOGLE | Leetcode-2141 | 86 | |
|
70. | Extra Characters in a String | Tree Diagram | Recursion | Memoization | MADE EASY | Leetcode - 2707 | 86 | |
|
71. | Filling Bookcase Shelves | Recursion Memoization | Why not Greedy | Leetcode 1105 | codestorywithMIK | 86 | |
|
72. | Single Number II | Multiple Approaches | GOOGLE, AMAZON | META | Leetcode-137 | Explanation | 85 | |
|
73. | Number of Music Playlists | Made Super Easy | Recursion | Memoization | META | Leetcode-920 | 85 | |
|
74. | Number of Nodes in the Sub-Tree With the Same Label : Explanation ➕ Live Coding | 84 | |
|
75. | Permutations | INTUITIVE | Backtracking Template | Two Ways | Similar Problems | Leetcode-46 | 84 | |
|
76. | Number of Wonderful Substrings | Clear Intuition | Full Dry Run | Leetcode 1915 | codestorywithMIK | 84 | |
|
77. | Palindromic Substrings | Blueprint | Palindrome Problems | 4 Approaches | Leetcode 647 | 84 | |
|
78. | Check If Array Pairs Are Divisible by k | Simplest Explanation | Leetcode 1497 | codestorywithMIK | 84 | |
|
79. | Divide Intervals Into Minimum Number of Groups | Simple Intuition | Leetcode 2406 | codestorywithMIK | 83 | |
|
80. | Letter Combinations of a Phone Number | INTUITIVE | Backtracking Template | Leetcode-17 | 83 | |
|
81. | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Leetcode 1438 |Detailed | 83 | |
|
82. | Grumpy Bookstore Owner | Simplest Thought Process | Leetcode 1052 | codestorywithMIK | 83 | |
|
83. | Roadmap for DP | How to Start DP ? | Topics in DP | DP Concepts & Qns - 1 | 83 | Guide |
|
84. | Majority Element I | Majority Element II : Boyer-Moore | Made Simple | Leetcode - 229 and 169 | 82 | |
|
85. | Fair Distribution of Cookies | Khandani Backtracking Template | Leetcode-2305 | Explanation + Coding | 82 | |
|
86. | Coin Change II | Made Super Easy | Recursion | Memoization | AMAZON | Leetcode-518 | 81 | |
|
87. | My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK | 81 | |
|
88. | Range Sum of Sorted Subarray Sums | Learning Something New | Leetcode 1508 | codestorywithMIK | 81 | |
|
89. | Second Minimum Time to Reach Destination | 2 Approaches | FULL DRY RUN | Leetcode 2045 | 81 | |
|
90. | All Possible Full Binary Trees | Recursion Tree | Memoization | GOOGLE | AMAZON | Leetcode-894 | 80 | |
|
91. | Unique Paths | Recursion | Memoization | AMAZON | CISCO | PAYTM | OLA | LINKEDIN | Leetcode - 62 | 80 | |
|
92. | Modify Graph Edge Weights | Using Dijkstra | Thought Process | Leetcode 2699 | codestorywithMIK | 80 | |
|
93. | Minimum Speed to Arrive on Time | Binary Search | INTUITION | Online Assessment | Leetcode-1870 | 80 | |
|
94. | Balance a Binary Search Tree | Simple Explanation | Leetcode 1382 | codestorywithMIK | 79 | |
|
95. | Concatenated Words - (META) : Explanation ➕ Live Coding | 79 | |
|
96. | Maximal Network Rank | Simple and Straight | 2 Ways | MICROSOFT | Leetcode-239 | Dry Run | Live Code | 79 | |
|
97. | Shortest Path to Get All Keys | Full Detail | Leetcode-864 | GOOGLE | Explanation ➕ Live Coding | 79 | |
|
98. | IPO | Easy Beginner Friendly | Story To Code | Leetcode 502 | codestorywithMIK | 79 | |
|
99. | Count Vowels Permutation | Recursion | Memoization | Bottom Up | GOOGLE | META | Leetcode - 1220 | 79 | |
|
100. | Longest Arithmetic Subsequence | Recur + Memo | Bottom Up | GOOGLE | Leetcode-1027 | Live Code | 79 | |
|