201. | Count Sub Islands | Easiest Thought Process | Leetcode 1905 | codestorywithMIK | 7,019 | | Counter-Strike: Source
|
202. | Linked List in Binary Tree | Easy | Dry Run | Leetcode 1367 | codestorywithMIK | 7,018 | |
|
203. | Balance a Binary Search Tree | Simple Explanation | Leetcode 1382 | codestorywithMIK | 6,973 | |
|
204. | Design a Number Container System | 2 Approaches | Leetcode 2349 | codestorywithMIK | 6,970 | |
|
205. | Find the K-th Character in String Game I | Two Approaches | Leetcode 3304 | codestorywithMIK | 6,958 | |
|
206. | Special Array II | 3 Detailed Approaches | Beginners Alert | Leetcode 3152 | codestorywithMIK | 6,916 | |
|
207. | Minimum Difference Between Largest and Smallest Value in Three Moves | 2 Approaches | Leetcode 1509 | 6,912 | |
|
208. | All Ancestors of a Node in a Directed Acyclic Graph | 3 Approaches | Leetcode 2192 |codestorywithMIK | 6,878 | |
|
209. | Find the City With the Smallest Number of Neighbors at a Threshold Distance | 3 Ways | Leetcode 1334 | 6,845 | | Threshold
|
210. | Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK | 6,828 | |
|
211. | Maximum Distance in Arrays | Leetcode 624 | codestorywithMIK | 6,824 | |
|
212. | Redundant Connection | DSU | DFS | BFS | Leetcode 684 | codestorywithMIK | 6,809 | | The Redundant
|
213. | Why I Will NEVER Promote Paid DSA Courses! 🚫 The Truth You Need to Know | codestorywithMIK | 6,784 | |
|
214. | Subarray Product Less Than K | Khandani Sliding Window template | Leetcode 713 | codestorywithMIK | 6,779 | |
|
215. | Count Unguarded Cells in the Grid | Simple Explanation | Leetcode 2257 | codestorywithMIK | 6,777 | | The Grid
|
216. | Count Servers that Communicate | 3 Detailed Approaches | Dry Runs | Leetcode 1267 | codestorywithMIK | 6,758 | |
|
217. | Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK | 6,755 | |
|
218. | First Completely Painted Row or Column | 3 Approaches | Detailed | Leetcode 2661 | codestorywithMIK | 6,719 | |
|
219. | Longest Harmonious Subsequence | Test your IQ | Leetcode 594 | codestorywithMIK | 6,713 | |
|
220. | Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK | 6,707 | |
|
221. | Minimum Height Trees | Know Every Detail | Why BFS | GOOGLE | Leetcode 310 | codestorywithMIK | 6,693 | |
|
222. | Longest Binary Subsequence Less Than or Equal to K | 2 Ways | Leetcode 2311 | codestorywithMIK | 6,692 | |
|
223. | Minimized Maximum of Products Distributed to Any Store | Leetcode 2064 | codestorywithMIK | 6,691 | |
|
224. | Longest Ideal Subsequence | LIS Variant | Bottom Up | Optimal | Leetcode 2370 | codestorywithMIK | 6,686 | |
|
225. | Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK | 6,676 | |
|
226. | Find Subsequence of Length K With the Largest Sum | 2 Approaches | Leetcode 2099 | codestorywithMIK | 6,657 | |
|
227. | Number of Steps to Reduce a Number in Binary Representation to One | 2 Approaches | Leetcode 1404 | 6,656 | |
|
228. | Count Good Triplets | Simple Approach | Slight Improvements | Leetcode 1534 | codestorywithMIK | 6,644 | |
|
229. | Minimum Number of Changes to Make Binary String Beautiful | 2 Ways | Leetcode 2914 |codestorywithMIK | 6,619 | | Binaries
|
230. | Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK | 6,588 | |
|
231. | Check if Number is a Sum of Powers of Three | Maths Proof | 3 Ways | Leetcode 1780 |codestorywithMIK | 6,574 | |
|
232. | Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK | 6,567 | |
|
233. | Partition Labels | 2 Clean Approaches | Leetcode 763 | codestorywithMIK | 6,561 | |
|
234. | The Earliest and Latest Rounds Where Players Compete | Detailed Intuition | Leetcode 1900 | MIK | 6,546 | |
|
235. | Maximum Sum of Distinct Subarrays With Length K | Khandani Template |Leetcode 2461 |codestorywithMIK | 6,536 | |
|
236. | Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK | 6,517 | |
|
237. | Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK | 6,496 | |
|
238. | The Imperial Delhi | Weekend Getaway | Luxury Stay | 5 Star hotel | WeekendWithMik | 6,485 | |
|
239. | Sort the Jumbled Numbers | 2 Approaches | Leetcode 2191 | codestorywithMIK | 6,473 | |
|
240. | Product of the Last K Numbers | Brute Force | Follow Up Optimal | Leetcode 1352 | codestorywithMIK | 6,470 | | Brute Force
|
241. | Remove Sub-Folders from the Filesystem | 2 Simple Approaches | Leetcode 1233 | codestorywithMIK | 6,431 | |
|
242. | Construct String With Repeat Limit | 2 Simple Approaches | Leetcode 2182 | codestorywithMIK | 6,427 | |
|
243. | Sum of Prefix Scores of Strings | Trie | Full Easy Dry Run | Leetcode 2416 | codestorywithMIK | 6,416 | |
|
244. | Finding Pairs With a Certain Sum | Simple Explanation | Leetcode 1865 | codestorywithMIK | 6,410 | |
|
245. | Replace Words | Using HashSet | Uber | Leetcode 648 | codestorywithMIK | 6,318 | |
|
246. | Most Stones Removed with Same Row or Column | Using DSU | DRY RUN | Leetcode 947 | codestorywithMIK | 6,314 | |
|
247. | Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK | 6,307 | |
|
248. | Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK | 6,298 | |
|
249. | Check if Array Is Sorted and Rotated | 3 Approaches | Leetcode 1752 | codestorywithMIK | 6,294 | |
|
250. | Minimum Obstacle Removal to Reach Corner I | Using Studied Concept | Leetcode 2290 |codestorywithMIK | 6,286 | |
|
251. | Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK | 6,283 | |
|
252. | Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK | 6,247 | |
|
253. | Find Minimum Diameter After Merging Two Trees | Leetcode 3203 | Graph Concepts & Qns - 45 | MIK | 6,234 | |
|
254. | Student Attendance Record II | Recursion | Memoization | Bottom Up | Leetcode 552 | codestorywithMIK | 6,230 | |
|
255. | Single Number III | Detailed Explanation | Leetcode 260 | codestorywithMIK | 6,222 | |
|
256. | Closest Prime Numbers in Range | 2 Detailed Approaches | Leetcode 2523 | codestorywithMIK | 6,211 | |
|
257. | Valid Parenthesis String | 4 Detailed Approaches | Leetcode 678 | codestorywithMIK | 6,180 | |
|
258. | Number of Ways to Arrive at Destination | Straight Forward Simple | Leetcode 1976 | codestorywithMIK | 6,123 | |
|
259. | Count Prefix and Suffix Pairs I | Brute Force | Trie | Leetcode 3042 | codestorywithMIK | 6,123 | | Brute Force
|
260. | Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code | 6,107 | |
|
261. | Minimum Time to Visit a Cell In a Grid | Using Studied Concept | Leetcode 2577 | codestorywithMIK | 6,096 | |
|
262. | Island Perimeter | 3 Approaches | Google | Leetcode 463 | codestorywithMIK | 6,094 | |
|
263. | Binary Search Tree to Greater Sum Tree | Brute | Better | Optimal | Leetcode 1038 | codestorywithMIK | 6,063 | |
|
264. | First Missing Positive | In Depth Intuition | Clean Code | Leetcode 41 | codestorywithMIK | 6,047 | |
|
265. | Bitwise XOR of All Pairings | 2 Simple Approaches | Dry Runs | Leetcode 2425 | codestorywithMIK | 6,034 | |
|
266. | Max Difference You Can Get From Changing an Integer | Made Easy | Leetcode 1432 | codestorywithMIK | 6,022 | |
|
267. | Debug by Day, Deadlift by Night | codestorywithMIK | 6,002 | |
|
268. | Find the Prefix Common Array of Two Arrays | 3 Detailed Approach | Leetcode 2657 | codestorywithMIK | 5,989 | |
|
269. | Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK | 5,988 | |
|
270. | Neighboring Bitwise XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2683 | codestorywithMIK | 5,986 | | XOR
|
271. | Special Array With X Elements Greater Than or Equal X | 3 Approaches |Leetcode 1608|codestorywithMIK | 5,983 | |
|
272. | Making A Large Island | Brute Force | Better | Optimal | Dry Run | Leetcode 827 | codestorywithMIK | 5,929 | | Brute Force
|
273. | Number of Students Unable to Eat Lunch | 2 Approaches | Leetcode 1700 | codestorywithMIK | 5,923 | |
|
274. | My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK | 5,909 | |
|
275. | It’s Time | Go Get It | 5,900 | |
|
276. | Isomorphic Strings | Simple Thought Process | Leetcode 205| LinkedIn | codestorywithMIK | 5,870 | |
|
277. | Number Complement | Multiple Approaches | Leetcode 476 | codestorywithMIK | 5,856 | |
|
278. | Flip Equivalent Binary Trees | Simple Recursion | Dry Run | Leetcode 951 | codestorywithMIK | 5,856 | | Binaries
|
279. | Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK | 5,844 | |
|
280. | Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK | 5,831 | |
|
281. | Contiguous Array | Using same Pattern Approach | Similar Problems | Leetcode 525 | 5,828 | |
|
282. | Maximum Total Importance of Roads | Thought Process | Leetcode 2285 | codestorywithMIK | 5,824 | |
|
283. | Subarrays with K Different Integers | Approach-1 | With Reasons | Leetcode 992 | codestorywithMIK | 5,807 | |
|
284. | Find Kth Bit in Nth Binary String | Detailed Recursion | Dry Run | Leetcode 1545 | codestorywithMIK | 5,803 | |
|
285. | Defuse the Bomb | Detailed for Beginners | Leetcode 1652 | codestorywithMIK | 5,789 | |
|
286. | K Inverse Pairs Array | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 629 | 5,770 | |
|
287. | Relative Sort Array | Counting Sort | Using Lambda | Leetcode 1122 | codestorywithMIK | 5,760 | |
|
288. | But bhai…. | 5,744 | |
|
289. | Maximum Erasure Value | 2 Approaches | Leetcode 1695 | codestorywithMIK | 5,739 | |
|
290. | Rotating the Box | Brute Force | Optimal | Leetcode 1861 | codestorywithMIK | 5,697 | |
|
291. | Count Hills and Valleys in an Array | Simple Explanation | Leetcode 2210 | codestorywithMIK | 5,678 | |
|
292. | Length of Longest Subarray With at Most K Frequency | 2 Ways | Leetcode 2958 | codestorywithMIK | 5,677 | |
|
293. | Shortest Distance After Road Addition Queries I | Easy Explanation | Leetcode 3243 |codestorywithMIK | 5,661 | |
|
294. | Maximum Matrix Sum | Simple Thought Process | Leetcode 1975 | codestorywithMIK | 5,660 | |
|
295. | Get Equal Substrings Within Budget | Classic Sliding Window | Leetcode 1208 | codestorywithMIK | 5,658 | |
|
296. | That feeling ❤️🙏 | codestorywithMIK | 5,647 | |
|
297. | Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176 | 5,638 | | Brute Force
|
298. | Minimum Length of String After Operations | 2 Approaches |Intuition |Leetcode 3223 |codestorywithMIK | 5,629 | |
|
299. | Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK | 5,589 | |
|
300. | Where coding meets storytelling | MIK | 5,579 | |
|