1. | DP bole to Dynamic Programming 🥹 | codestorywithMIK | 27,463 | |
|
2. | Can you guess ? | 26,548 | |
|
3. | Are bhai 🥹❤️🙏 | 23,389 | |
|
4. | Business 💰❌ | Mission 🧑🏻💻✅ | 20,696 | |
|
5. | Array k aaage koi bol sakta hai kya | codestorywithMIK | 19,331 | |
|
6. | Maximum Number of Events That Can Be Attended | Detailed Approach | Leetcode 1353 | codestorywithMIK | 17,398 | |
|
7. | Achanak se yaad agaya | Leetcode POTD | codestorywithMIK | 17,360 | |
|
8. | Are bhai 🥺 | codestorywithMIK | 15,685 | |
|
9. | How it feels being good at DSA + Dev 🔥🔥 | codestorywithMIK | 15,138 | |
|
10. | Find the Original Typed String II | Multiple Approaches | Detailed | Leetcode 3333 |codestorywithMIK | 14,149 | |
|
11. | Make Sum Divisible by P | Simplest Explanation | Full Dry Run | Leetcode 1590 | codestorywithMIK | 13,976 | |
|
12. | Is it a secret ? | codestorywithMIK | 13,284 | |
|
13. | Find the Maximum Length of Valid Subsequence | Part I | Part II | Leetcode 3201 | 3202 | MIK | 13,123 | |
|
14. | Zero Array Transformation II | Brute Force | Better | Leetcode 3356 | codestorywithMIK | 12,859 | | Brute Force
|
15. | Find the Longest Substring Containing Vowels in Even Counts | Leetcode 1371 | codestorywithMIK | 12,836 | | Counter-Strike: Source
|
16. | Count of Substrings Containing Every Vowel and K Consonants II | Leetcode 3306 | codestorywithMIK | 12,664 | |
|
17. | Find the Maximum Length of Valid Subsequence I | Detailed Intuition | Leetcode 3201 | MIK | 12,554 | |
|
18. | 2025 Placement Roadmap | How I Would Have Prepared | Year 2025 Special | Happy New Year | 12,447 | |
|
19. | Longest Nice Subarray | Brute Force | Better | Optimal | Dry Runs | Leetcode 2401 | codestorywithMIK | 12,193 | | Brute Force
|
20. | Interviewer : Bhai kitni salary loge 🥺 | 12,118 | |
|
21. | Reschedule Meetings for Maximum Free Time I | Detailed Intuition | Leetcode 3439 | codestorywithMIK | 11,907 | |
|
22. | Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK | 11,743 | | Counter-Strike: Source
|
23. | Spiral Matrix III | Simple Simulation | Made Easy | Leetcode 885 | codestorywithMIK | 11,708 | |
|
24. | Distribute Candies Among Children II | 4 Approaches | Detailed | Leetcode 2929 | codestorywithMIK | 11,524 | |
|
25. | Check If Array Pairs Are Divisible by k | Simplest Explanation | Leetcode 1497 | codestorywithMIK | 11,515 | |
|
26. | Filling Bookcase Shelves | Recursion Memoization | Why not Greedy | Leetcode 1105 | codestorywithMIK | 11,465 | |
|
27. | Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK | 11,421 | |
|
28. | Maximum Number of Points with Cost | Detailed Explanation | Leetcode 1937 | codestorywithMIK | 11,399 | |
|
29. | It’s what I do that defines me | codestorywithMIK | 11,233 | |
|
30. | Integer to English Words | Story To Code | Leetcode 273 | codestorywithMIK | 11,087 | |
|
31. | Are mummy 🥹 | 11,069 | |
|
32. | Find K-th Smallest Pair Distance | Multiple Approaches | Leetcode 719 | codestorywithMIK | 10,994 | |
|
33. | Sometimes rejection is just redirection | codestorywithMIK | 10,947 | |
|
34. | Minimum Number of Days to Disconnect Island | Studied Concept | Leetcode 1568 | codestorywithMIK | 10,878 | |
|
35. | Fraction Addition and Subtraction | Simple Simulation | Leetcode 592 | codestorywithMIK | 10,868 | |
|
36. | This Is Your Sign to Keep Going |Motivation | codestorywithMIK | 10,819 | |
|
37. | Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK | 10,750 | | The Hidden
|
38. | Shortest Subarray with Sum at Least K | Already Studied Concept | Leetcode 862 | codestorywithMIK | 10,691 | |
|
39. | Itna Motivation ? 🥹 | codestorywithMIK | 10,676 | |
|
40. | Zero Array Transformation I | Brute Force | Optimal | Leetcode 3356 | codestorywithMIK | 10,613 | |
|
41. | Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK | 10,516 | |
|
42. | Minimum Swaps to Group All 1's Together II | 2 Ways | Dry Runs | Leetcode 2134 | codestorywithMIK | 10,513 | |
|
43. | Different Ways to Add Parentheses | Simple Story To Code | Leetcode 241 | codestorywithMIK | 10,480 | |
|
44. | Sum of k-Mirror Numbers | Super Detailed | Minute Details | Leetcode 2081 | codestorywithMIK | 10,412 | |
|
45. | Maximum Manhattan Distance After K Changes | Detailed Explanation | Leetcode 3443 | codestorywithMIK | 10,373 | |
|
46. | Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK | 10,339 | | Counter-Strike: Source
|
47. | Trapping Rain Water II | Deep Dive Explanation | What | Why | How | Leetcode 407 | codestorywithMIK | 10,336 | |
|
48. | Patching Array | Thought Process | Dry Runs | GOOGLE | Leetcode 330 | codestorywithMIK | 10,321 | |
|
49. | Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK | 10,298 | |
|
50. | Maje hi Maje | DSA | HLD | LLD | codestorywithMIK | 10,273 | |
|
51. | Grid Game | Detailed Explanation | Complete Ry Run | Leetcode 2017 | codestorywithMIK | 10,199 | | The Grid
|
52. | Find the Punishment Number of an Integer | Multiple Ways | Dry Run |Leetcode 2698 | codestorywithMIK | 10,159 | |
|
53. | Regions Cut By Slashes | Already Studied Concept | Easy Code | Leetcode 959 | codestorywithMIK | 10,139 | |
|
54. | Extra Characters in a String | Recursion | Bottom Up | Easy | Leetcode 2707 | codestorywithMIK | 10,132 | |
|
55. | Reschedule Meetings for Maximum Free Time II | Detailed Intuition | Leetcode 3440 | codestorywithMIK | 10,122 | |
|
56. | The Number of the Smallest Unoccupied Chair | Brute Force | Optimal |Leetcode 1942 |codestorywithMIK | 10,073 | |
|
57. | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Leetcode 1438 |Detailed | 10,048 | |
|
58. | Count the Number of Good Subarrays | Thought Process | Khandani Template | Leetcode 2537 | MIK | 10,022 | |
|
59. | Shortest Palindrome | Multiple Ways | KMP Zindabaad | Leetcode 214 | codestorywithMIK | 10,000 | |
|
60. | K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK | 9,975 | |
|
61. | Longest Happy String | Simple Thought Process | Leetcode 1405 | codestorywithMIK | 9,949 | |
|
62. | Minimum Number of Swaps to Make the String Balanced | Reason | Leetcode 1963 | codestorywithMIK | 9,934 | |
|
63. | Maximum Difference Between Even and Odd Frequency II | Super Detailed | Leetcode 3445 | MIK | 9,910 | |
|
64. | House Robber IV | Brute Force | Optimal | Leetcode 2560 | codestorywithMIK | 9,900 | | Brute Force
|
65. | Make Lexicographically Smallest Array by Swapping Elements | Brute Force | Optimal | Leetcode 2948 | 9,868 | | Brute Force
|
66. | Letter Tile Possibilities | 2 Ways | Using Standard Template | Leetcode 1079 | codestorywithMIK | 9,844 | |
|
67. | Magnetic Force Between Two Balls | Simple Thought Process | Leetcode 1552 | codestorywithMIK | 9,805 | |
|
68. | Smallest Subarrays With Maximum Bitwise OR | Detailed Explanation | Leetcode 2411 | codestorywithMIK | 9,707 | |
|
69. | Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK | 9,665 | |
|
70. | Minimum Number of K Consecutive Bit Flips | 3 Approaches | Detailed | Leetcode 995 | 3191 | 9,618 | |
|
71. | Segment Tree | Introduction | Basics | Build Segment Tree | Video 1 | codestorywithMIK | 9,580 | |
|
72. | Number of Atoms | Made Easy | Full Dry Run | Leetcode 726 | Google | codestorywithMIK | 9,578 | |
|
73. | Number of Sub-arrays With Odd Sum | Brute Force | Better | Optimal | Leetcode 1524 |codestorywithMIK | 9,573 | | Brute Force
|
74. | Minimum Cost to Make at Least One Valid Path in a Grid | 2 Detailed Approaches | Leetcode 1368 | MIK | 9,572 | |
|
75. | Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593 | 9,554 | |
|
76. | Maximum Value of an Ordered Triplet I | Multiple Approaches | Leetcode 2873 | codestorywithMIK | 9,476 | |
|
77. | Minimum Array End | How much you know about AND | Detailed | Leetcode 3133 | codestorywithMIK | 9,466 | |
|
78. | Minimum Deletions to Make String Balanced | Multiple Approaches | Leetcode 1653 | codestorywithMIK | 9,428 | |
|
79. | The voice beyond the face | codestorywithMIK | 9,389 | |
|
80. | Shifting Letters II | Leetcode 2381 | Difference Array Technique: Concepts & Questions - 2 | MIK | 9,384 | |
|
81. | Step-By-Step Directions From a Binary Tree Node to Another | 2 Approaches | Leetcode 2096 | 9,338 | |
|
82. | Count Number of Teams | Simple thought process | Intuition | Leetcode 1395 | 9,321 | |
|
83. | Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK | 9,301 | |
|
84. | Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK | 9,295 | |
|
85. | Painting a Grid With Three Different Colors | Thought Process | Leetcode 1931 | codestorywithMIK | 9,284 | |
|
86. | Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK | 9,237 | |
|
87. | IPO | Easy Beginner Friendly | Story To Code | Leetcode 502 | codestorywithMIK | 9,237 | |
|
88. | Leetcode Hard | No problem | codestorywithMIK | 9,192 | |
|
89. | Maximum Employees to Be Invited to a Meeting | Super Detailed | Leetcode 2127 | codestorywithMIK | 9,190 | |
|
90. | Number of Good Leaf Nodes Pairs | Using Graph And BFS | Dry Run | Leetcode 1530 | codestorywithMIK | 9,147 | |
|
91. | Minimize XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2429 | codestorywithMIK | 9,145 | |
|
92. | Take K of Each Character From Left and Right | 2 Approaches | Leetcode 2516 | codestorywithMIK | 9,106 | |
|
93. | Number of Wonderful Substrings | Clear Intuition | Full Dry Run | Leetcode 1915 | codestorywithMIK | 9,085 | |
|
94. | Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK | 9,062 | |
|
95. | Find if Array Can Be Sorted | Detailed Approaches | Dry Runs | Leetcode 3011 | codestorywithMIK | 9,031 | |
|
96. | Find the Closest Palindrome | Simple Observations | Leetcode 564 | codestorywithMIK | 9,001 | |
|
97. | Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK | 9,000 | |
|
98. | Modify Graph Edge Weights | Using Dijkstra | Thought Process | Leetcode 2699 | codestorywithMIK | 8,993 | |
|
99. | Grumpy Bookstore Owner | Simplest Thought Process | Leetcode 1052 | codestorywithMIK | 8,986 | |
|
100. | Minimum Limit of Balls in a Bag | Detailed | Why Binary Search | Leetcode 1760 | codestorywithMIK | 8,927 | |
|