1. | How codestorywithMIK was started | Motivation | Rejections | 50K Special | 773 | |
|
2. | Remove K Digits | Intuition | Dry Run | Leetcode 402 | codestorywithMIK | 619 | |
|
3. | Patching Array | Thought Process | Dry Runs | GOOGLE | Leetcode 330 | codestorywithMIK | 590 | |
|
4. | IPO | Easy Beginner Friendly | Story To Code | Leetcode 502 | codestorywithMIK | 576 | |
|
5. | Filling Bookcase Shelves | Recursion Memoization | Why not Greedy | Leetcode 1105 | codestorywithMIK | 538 | |
|
6. | Minimum Swaps to Group All 1's Together II | 2 Ways | Dry Runs | Leetcode 2134 | codestorywithMIK | 513 | |
|
7. | Minimum Number of K Consecutive Bit Flips | 3 Approaches | Detailed | Leetcode 995 | 3191 | 532 | |
|
8. | Magnetic Force Between Two Balls | Simple Thought Process | Leetcode 1552 | codestorywithMIK | 511 | |
|
9. | Count Number of Teams | Simple thought process | Intuition | Leetcode 1395 | 482 | |
|
10. | Subarrays with K Different Integers | Approach-1 | With Reasons | Leetcode 992 | codestorywithMIK | 473 | |
|
11. | Grumpy Bookstore Owner | Simplest Thought Process | Leetcode 1052 | codestorywithMIK | 465 | |
|
12. | Task Scheduler | Easy Intuition | Using Heap | Leetcode 621 | codestorywithMIK | 444 | |
|
13. | Range Sum of Sorted Subarray Sums | Learning Something New | Leetcode 1508 | codestorywithMIK | 441 | |
|
14. | Find the Winner of the Circular Game | 3 Approaches | Leetcode 1823 | codestorywithMIK | 430 | |
|
15. | Reveal Cards In Increasing Order | 2 Approaches | Leetcode 950 | codestorywithMIK | 428 | |
|
16. | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Leetcode 1438 |Detailed | 492 | |
|
17. | Open the Lock | Why BFS | Similar Pattern Problems | META | Leetcode 752 | codestorywithMIK | 418 | |
|
18. | Minimum Deletions to Make String Balanced | Multiple Approaches | Leetcode 1653 | codestorywithMIK | 426 | |
|
19. | Subarray Product Less Than K | Khandani Sliding Window template | Leetcode 713 | codestorywithMIK | 391 | |
|
20. | First Missing Positive | In Depth Intuition | Clean Code | Leetcode 41 | codestorywithMIK | 387 | |
|
21. | Maximal Rectangle | Multiple Hidden Problems | Intuition | Leetcode 85 | codestorywithMIK | 423 | |
|
22. | Step-By-Step Directions From a Binary Tree Node to Another | 2 Approaches | Leetcode 2096 | 409 | |
|
23. | Number of Submatrices That Sum to Target | Subarray Sum Equals K | Leetcode 1074 | Leetcode 560 | 384 | |
|
24. | K Inverse Pairs Array | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 629 | 403 | |
|
25. | Number of Good Leaf Nodes Pairs | Using Graph And BFS | Dry Run | Leetcode 1530 | codestorywithMIK | 395 | |
|
26. | Minimum Number of Days to Make m Bouquets | Simple Thought Process| Leetcode 1482 | codestorywithMIK | 419 | |
|
27. | Number of Wonderful Substrings | Clear Intuition | Full Dry Run | Leetcode 1915 | codestorywithMIK | 456 | |
|
28. | Reverse Substrings Between Each Pair of Parentheses | 2 Approaches | Leetcode 1190 |codestorywithMIK | 394 | |
|
29. | Count Subarrays Where Max Element Appears at Least K Times | 2 Approaches | Leetcode 2962 | 375 | |
|
30. | Maximum Score From Removing Substrings | 2 Approaches | With Proof | Leetcode 1717 | 390 | |
|
31. | Contiguous Array | Using same Pattern Approach | Similar Problems | Leetcode 525 | 358 | |
|
32. | Most Profit Assigning Work | Multiple Approaches | With Intuition | Leetcode 826 | codestorywithMIK | 396 | |
|
33. | Count Triplets That Can Form Two Arrays of Equal XOR | Leetcode 1442 | codestorywithMIK | 393 | |
|
34. | Longest Ideal Subsequence | LIS Variant | Bottom Up | Optimal | Leetcode 2370 | codestorywithMIK | 346 | |
|
35. | Hand of Straights | Simple Thought Process | Google | Leetcode 846 | codestorywithMIK | 425 | |
|
36. | Create Binary Tree From Descriptions | Simplest Approach | Leetcode 2196 | codestorywithMIK | 349 | |
|
37. | Valid Parenthesis String | 4 Detailed Approaches | Leetcode 678 | codestorywithMIK | 376 | |
|
38. | Count Number of Nice Subarrays | 2 Approaches | Similar Concept | Leetcode 1248 | codestorywithMIK | 370 | |
|
39. | Bitwise AND of Numbers Range | 2 Approaches | Dry Run | Leetcode 201 | 333 | |
|
40. | Furthest Building You Can Reach | What is Lazy Greedy | Recursion | Memoization | Leetcode 1642 | 328 | |
|
41. | Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402 | 329 | |
|
42. | Build a Matrix With Conditions | BFS | DFS | Detailed Explanation | Leetcode 2392 | codestorywithMIK | 333 | |
|
43. | Find Common Characters | Simple Dry Run | Leetcode 1002 | codestorywithMIK | 350 | |
|
44. | Palindromic Substrings | Blueprint | Palindrome Problems | 4 Approaches | Leetcode 647 | 323 | |
|
45. | Maximum Total Importance of Roads | Thought Process | Leetcode 2285 | codestorywithMIK | 313 | |
|
46. | Single Number III | Detailed Explanation | Leetcode 260 | codestorywithMIK | 329 | |
|
47. | Length of Longest Subarray With at Most K Frequency | 2 Ways | Leetcode 2958 | codestorywithMIK | 307 | |
|
48. | Minimum Height Trees | Know Every Detail | Why BFS | GOOGLE | Leetcode 310 | codestorywithMIK | 347 | |
|
49. | Minimum Remove to Make Valid Parentheses | 3 Detailed Approaches | Leetcode 1249 | codestorywithMIK | 302 | |
|
50. | Constrained Subsequence Sum | Recursion | Memoization | Sliding Window | GOOGLE | Leetcode - 1425 | 297 | |
|
51. | Replace Words | Using HashSet | Uber | Leetcode 648 | codestorywithMIK | 311 | |
|
52. | Number of Students Unable to Eat Lunch | 2 Approaches | Leetcode 1700 | codestorywithMIK | 299 | |
|
53. | Isomorphic Strings | Simple Thought Process | Leetcode 205| LinkedIn | codestorywithMIK | 284 | |
|
54. | All Ancestors of a Node in a Directed Acyclic Graph | 3 Approaches | Leetcode 2192 |codestorywithMIK | 309 | |
|
55. | Binary Search Tree to Greater Sum Tree | Brute | Better | Optimal | Leetcode 1038 | codestorywithMIK | 306 | |
|
56. | Partition Array for Maximum Sum | Why DP | Recursion | Memo | Bottom Up | Leetcode 1043 | 280 | |
|
57. | Pseudo-Palindromic Paths in a Binary Tree | 2 Ways | Bit Magic | Leetcode 1457 | 280 | |
|
58. | Island Perimeter | 3 Approaches | Google | Leetcode 463 | codestorywithMIK | 275 | |
|
59. | Build Array Where You Can Find The Maximum Exactly K Comparisons |DP Concepts & Qns-14|Leetcode-1420 | 271 | |
|
60. | Student Attendance Record II | Recursion | Memoization | Bottom Up | Leetcode 552 | codestorywithMIK | 296 | |
|
61. | Largest Divisible Subset | LIS Variant | DP Concepts & Qns-18 | Leetcode-368 | 282 | |
|
62. | Binary Trees With Factors | Easy Intuition | Dry Run | GOOGLE | Leetcode - 823 | 277 | |
|
63. | Sort the Jumbled Numbers | 2 Approaches | Leetcode 2191 | codestorywithMIK | 282 | |
|
64. | Greatest Common Divisor Traversal | Why Graph | Why DSU | Google | Leetcode 2709 | 285 | |
|
65. | Number of Steps to Reduce a Number in Binary Representation to One | 2 Approaches | Leetcode 1404 | 293 | |
|
66. | Relative Sort Array | Counting Sort | Using Lambda | Leetcode 1122 | codestorywithMIK | 277 | |
|
67. | Segment Tree | Introduction | Basics | Build Segment Tree | Video 1 | codestorywithMIK | 433 | |
|
68. | Get Equal Substrings Within Budget | Classic Sliding Window | Leetcode 1208 | codestorywithMIK | 276 | |
|
69. | Unique Length-3 Palindromic Subsequences | 2 Ways | Intuition | META | GOOGLE | Leetcode-1930 | 266 | |
|
70. | Find the City With the Smallest Number of Neighbors at a Threshold Distance | 3 Ways | Leetcode 1334 | 269 | | Threshold
|
71. | Decoded String at Index | Clean Code | TCS | GOOGLE | ORACLE | Leetcode - 880 | 246 | |
|
72. | Design a Food Rating System | Clean Approach | Leetcode-2353 | 243 | |
|
73. | 132 Pattern | Intuition explained | Brute Force | Better | Optimal | META | AMAZON | Leetcode - 456 | 239 | |
|
74. | Thank/Love You all 3000 ❤️🙏 #coding #motivation #thankyou #subscribe #10000 #codestorywithMIK #code | 238 | |
|
75. | Merge Nodes in Between Zeros | 2 Approaches | Leap Of Faith | Leetcode 2181 | codestorywithMIK | 253 | |
|
76. | Extra Characters in a String | Tree Diagram | Recursion | Memoization | MADE EASY | Leetcode - 2707 | 234 | |
|
77. | Remove Duplicate Letters | Why Monotonic Stack | Intuition | GOOGLE | Leetcode - 316 | 234 | |
|
78. | Cherry Pickup II | 3 Approaches | Super Detailed | Leetcode 1463 | 236 | |
|
79. | Minimum Number of Operations to Make Array Continuous | Brute Force | Optimal | Leetcode - 2009 | 232 | |
|
80. | Maximum Nesting Depth of the Parentheses | 2 Approaches | Leetcode 1614 | codestorywithMIK | 234 | |
|
81. | Special Array With X Elements Greater Than or Equal X | 3 Approaches |Leetcode 1608|codestorywithMIK | 273 | |
|
82. | Last Moment Before All Ants Fall Out of a Plank | Easy Explanation | GOOGLE | Leetcode - 1503 | 243 | |
|
83. | Compare Version Numbers | stringstream | StringTokenizer | C++ | JAVA |Leetcode 165|codestorywithMIK | 235 | |
|
84. | Append Characters to String to Make Subsequence | Simple Approach | Leetcode 2486 | codestorywithMIK | 254 | |
|
85. | Repeated Substring Pattern | Full Intuition | Time Complexity | GOOGLE | AMAZON | Leetcode-459 | 226 | |
|
86. | Number of Music Playlists | Made Super Easy | Recursion | Memoization | META | Leetcode-920 | 225 | |
|
87. | Shortest Path Visiting All Nodes | Clean | Simple | Intuitive | BFS | GOOGLE | Leetcode-847 | | 224 | |
|
88. | Longest Palindrome | 3 Easy Approaches | Leetcode 409 | codestorywithMIK | 251 | | Counter-Strike: Source
|
89. | Amount of Time for Binary Tree to Be Infected | Using BFS | Leetcode 2385 | 241 | |
|
90. | Frequency of the Most Frequent Element | Binary Search | Sliding Window | META | Leetcode-1838 | 229 | |
|
91. | Time Needed to Buy Tickets | 3 Approaches | Leetcode 2073 | codestorywithMIK | 232 | |
|
92. | Count All Valid Pickup and Delivery Options | CLEAR INTUITION | META | Leetcode - 1359 | 220 | |
|
93. | Water Bottles | 3 Approaches | Easy Explanations | Leetcode 1518 | codestorywithMIK | 224 | |
|
94. | Find Center of Star Graph | 2 Simple Approaches | Leetcode 1791 | codestorywithMIK | 227 | |
|
95. | String Compression II | Recursion | Memo | Leetcode 1531 | 239 | |
|
96. | Champagne Tower | Recursion | Memoization | GOOGLE | Leetcode - 799 | 218 | |
|
97. | Crawler Log Folder | 2 Approaches | Dry Runs | Leetcode 1598 | codestorywithMIK | 224 | |
|
98. | Soup Servings | INTUITIVE | Recursion | Memoization | GOOGLE | Leetcode-808 | 217 | |
|
99. | Number of Laser Beams in a Bank | Clear Explanation | Dry Run | Amazon | Leetcode 2125 | 229 | |
|
100. | Minimum Number of Operations to Make Array Empty | Explained with Reasons | Greedy | Leetcode 2870 | 232 | |
|