| 301. | XOR Queries of a Subarray | Simple Explanation | Leetcode 1310 | codestorywithMIK | 5,578 | |
|
| 302. | Divide Players Into Teams of Equal Skill | With Proof | Dry Run | Leetcode 2491 | codestorywithMIK | 5,571 | |
|
| 303. | Find the Lexicographically Largest String From the Box I | Another Approach | Leetcode 3403 | MIK | 5,570 | |
|
| 304. | Max Chunks To Make Sorted | 3 Detailed Approaches | Leetcode 769 | codestorywithMIK | 5,566 | |
|
| 305. | Intersection of Two Arrays II | 2 Approaches | Easy Explanations | Leetcode 350 | codestorywithMIK | 5,528 | |
|
| 306. | Binary Subarrays With Sum | 2 Approaches | Detailed Explanation | Leetcode 930 | 5,526 | |
|
| 307. | Number of Submatrices That Sum to Target | Subarray Sum Equals K | Leetcode 1074 | Leetcode 560 | 5,516 | |
|
| 308. | Minimum Remove to Make Valid Parentheses | 3 Detailed Approaches | Leetcode 1249 | codestorywithMIK | 5,490 | |
|
| 309. | Find the Student that Will Replace the Chalk | 2 Ways | Leetcode 1894 | codestorywithMIK | 5,484 | |
|
| 310. | Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts & Qns - 44 | MIK | 5,483 | |
|
| 311. | Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK | 5,478 | |
|
| 312. | Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK | 5,475 | | Counter-Strike: Source
|
| 313. | Minimum Number of Operations to Sort a Binary Tree by Level | Leetcode 2471 | codestorywithMIK | 5,446 | |
|
| 314. | Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK | 5,428 | |
|
| 315. | Average Waiting Time | Simple Simulation | Leetcode 1701 | codestorywithMIK | 5,418 | |
|
| 316. | Maximum Unique Subarray Sum After Deletion | Constant Space | Leetcode 3487 | codestorywithMIK | 5,395 | |
|
| 317. | Find All K-Distant Indices in an Array | Easy | Leetcode 2200 | codestorywithMIK | 5,377 | |
|
| 318. | Rotate String | Something to learn | Leetcode 796 | codestorywithMIK | 5,354 | |
|
| 319. | Longest Unequal Adjacent Groups Subsequence I | Simple Intuition | Leetcode 2900 | codestorywithMIK | 5,327 | |
|
| 320. | Smallest String Starting From Leaf | DFS | BFS | Google | Leetcode 988 | codestorywithMIK | 5,316 | |
|
| 321. | Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK | 5,308 | |
|
| 322. | Find Minimum Time to Reach Last Room II | Using Same Code | Leetcode 3342 | codestorywithMIK | 5,295 | |
|
| 323. | Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK | 5,280 | |
|
| 324. | Number of Ways to Split Array | Simple Thought Process | Leetcode 2270 | codestorywithMIK | 5,278 | |
|
| 325. | Maximize the Number of Target Nodes After Connecting Trees II | Full Dry Run | Leetcode 3373 | MIK | 5,236 | |
|
| 326. | Nasha hai bhai 🥹 | 5,216 | |
|
| 327. | Minimum String Length After Removing Substrings | 3 Approaches | Leetcode 2696 | codestorywithMIK | 5,210 | |
|
| 328. | Partition Array Such That Maximum Difference Is K | Simple Thought Process | Leetcode 2294 | MIK | 5,195 | |
|
| 329. | Minimum Increment to Make Array Unique | Sorting | Counting Sort | Leetcode 945 | codestorywithMIK | 5,192 | |
|
| 330. | Longest Palindrome | 3 Easy Approaches | Leetcode 409 | codestorywithMIK | 5,165 | | Counter-Strike: Source
|
| 331. | Find Score of an Array After Marking All Elements | 2 Approaches | Leetcode 2593 | codestorywithMIK | 5,132 | |
|
| 332. | Greatest Common Divisor Traversal | Why Graph | Why DSU | Google | Leetcode 2709 | 5,127 | |
|
| 333. | Furthest Building You Can Reach | What is Lazy Greedy | Recursion | Memoization | Leetcode 1642 | 5,125 | |
|
| 334. | Freedom Trail | Recursion | Memoization | Bottom Up | Detailed | Leetcode 514 | codestorywithMIK | 5,104 | |
|
| 335. | Maximum Difference by Remapping a Digit | Easy | 2 Ways | Leetcode 2566 | codestorywithMIK | 5,095 | | Counter-Strike: Source
|
| 336. | Partition Array According to Given Pivot | Multiple Approaches | Leetcode 2161 | codestorywithMIK | 5,068 | |
|
| 337. | Achaaaaaa ☕️🧑🏻💻 | 5,060 | |
|
| 338. | Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK | 5,057 | |
|
| 339. | Design Circular Deque | Simplest Explanation | 2 Ways | Leetcode 641 | codestorywithMIK | 4,989 | |
|
| 340. | A Message | Travel Tales | codestorywithMIK | 4,969 | |
|
| 341. | Palindromic Substrings | Blueprint | Palindrome Problems | 4 Approaches | Leetcode 647 | 4,967 | |
|
| 342. | Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402 | 4,901 | |
|
| 343. | Water Bottles | 3 Approaches | Easy Explanations | Leetcode 1518 | codestorywithMIK | 4,852 | |
|
| 344. | Minimum Operations to Exceed Threshold Value II |Easy Explanation | Leetcode 3066 | codestorywithMIK | 4,824 | | Threshold
|
| 345. | Partition Array for Maximum Sum | Why DP | Recursion | Memo | Bottom Up | Leetcode 1043 | 4,809 | |
|
| 346. | Find the Power of K-Size Subarrays I | Simple Explanation | Dry Run| Leetcode 3254 |codestorywithMIK | 4,801 | |
|
| 347. | Largest Divisible Subset | LIS Variant | DP Concepts & Qns-18 | Leetcode-368 | 4,801 | |
|
| 348. | Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK | 4,766 | |
|
| 349. | String Compression III | Simple Simulation | Leetcode 3163 | codestorywithMIK | 4,764 | |
|
| 350. | Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK | 4,743 | |
|
| 351. | Find Champion II | Easy Explanation | Leetcode 2924 | codestorywithMIK | 4,722 | |
|
| 352. | Make String a Subsequence Using Cyclic Increments | Similar Problem |Leetcode 2825 |codestorywithMIK | 4,713 | |
|
| 353. | Minimum Falling Path Sum II | 4 Approaches | Detailed Dry Run | Leetcode 1289 | codestorywithMIK | 4,695 | |
|
| 354. | DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | 4,686 | |
|
| 355. | Lucky Numbers in a Matrix | 2 Approaches | Dry Run | Leetcode 1380 | codestorywithMIK | 4,656 | |
|
| 356. | Minimum Recolors to Get K Consecutive Black Blocks | 2 Approaches | Leetcode 2379 | codestorywithMIK | 4,646 | |
|
| 357. | Count Total Number of Colored Cells | Maths Proof | 2 Approaches | Leetcode 2579 | codestorywithMIK | 4,632 | |
|
| 358. | Decoded String at Index | Clean Code | TCS | GOOGLE | ORACLE | Leetcode - 880 | 4,585 | |
|
| 359. | What is Lambda Capture | C++ | Java | Leetcode 2942 | codestorywithMIK | 4,574 | |
|
| 360. | Binary Trees With Factors | Easy Intuition | Dry Run | GOOGLE | Leetcode - 823 | 4,525 | |
|
| 361. | Delete Nodes From Linked List Present in Array | Simple | Dry Run | Leetcode 3217 | codestorywithMIK | 4,522 | |
|
| 362. | Count the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK | 4,519 | |
|
| 363. | Count Substrings That Satisfy K-Constraint I & II | Detailed Explanation | Leetcode 3258 & 3261 | 4,506 | |
|
| 364. | Merge Nodes in Between Zeros | 2 Approaches | Leap Of Faith | Leetcode 2181 | codestorywithMIK | 4,498 | |
|
| 365. | Find Lucky Integer in an Array | 3 Approaches | In Place | Leetcode 1394 | codestorywithMIK | 4,494 | |
|
| 366. | Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK | 4,492 | | Counter-Strike: Source
|
| 367. | You will never have to ❤️ | 4,490 | |
|
| 368. | Find All People With Secret | 4 Approaches | Google | Leetcode 2092 | 4,490 | |
|
| 369. | Find Missing and Repeated Values | Mathematical Proof | Leetcode 2965 | codestorywithMIK | 4,483 | |
|
| 370. | Set Matrix Zeroes | Multiple Approaches | Leetcode 73 | codestorywithMIK | 4,465 | |
|
| 371. | Compare Version Numbers | stringstream | StringTokenizer | C++ | JAVA |Leetcode 165|codestorywithMIK | 4,456 | |
|
| 372. | Find Center of Star Graph | 2 Simple Approaches | Leetcode 1791 | codestorywithMIK | 4,394 | |
|
| 373. | Maximal Score After Applying K Operations | Standard Heap Problem | Leetcode 2530 | codestorywithMIK | 4,374 | |
|
| 374. | Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK | 4,338 | |
|
| 375. | Are sir lekin 🥺 | 4,321 | |
|
| 376. | Pass the Pillow | 2 Approaches | Easy Explanations | Leetcode 2582 | codestorywithMIK | 4,319 | |
|
| 377. | Append Characters to String to Make Subsequence | Simple Approach | Leetcode 2486 | codestorywithMIK | 4,299 | |
|
| 378. | Divide Array Into Equal Pairs | 5 Approaches | Leetcode 2206 | codestorywithMIK | 4,296 | |
|
| 379. | Check If N and Its Double Exist | Special Motivation | Leetcode 1346 | codestorywithMIK | 4,277 | |
|
| 380. | Clear Digits | 4 Detailed Approaches | Leetcode 3174 | codestorywithMIK | 4,268 | |
|
| 381. | Bitwise AND of Numbers Range | 2 Approaches | Dry Run | Leetcode 201 | 4,266 | |
|
| 382. | Sum of Left Leaves | 2 Approaches | META | Leetcode 404 | codestorywithMIK | 4,256 | |
|
| 383. | Remove Nodes From Linked List | 3 Detailed Approaches | Story | Leetcode 2487 | codestorywithMIK | 4,243 | |
|
| 384. | Validate Binary Tree Nodes | Using Binary Tree Properties | BFS | META | Leetcode - 1361 | 4,234 | |
|
| 385. | Build Array Where You Can Find The Maximum Exactly K Comparisons |DP Concepts & Qns-14|Leetcode-1420 | 4,231 | |
|
| 386. | Minimum Number of Moves to Seat Everyone | Counting Sort | Sort | Leetcode 2037 | codestorywithMIK | 4,229 | |
|
| 387. | Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK | 4,228 | |
|
| 388. | Relatable ? 🥹 #codestorywithmik | 4,211 | |
|
| 389. | Knuth-Morris-Pratt KMP String Matching Algorithm | Search Pattern | GFG POTD | 4,205 | |
|
| 390. | No Face, No Setup | 4,188 | |
|
| 391. | Longest Palindromic Substring | Recursion Memo | Bottom Up | DP On Strings | Leetcode 5 | 4,173 | |
|
| 392. | Convert Binary Number in a Linked List to Integer | 2 Approaches | Leetcode 1290 | codestorywithMIK | 4,164 | |
|
| 393. | Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK | 4,150 | |
|
| 394. | Maximum Nesting Depth of the Parentheses | 2 Approaches | Leetcode 1614 | codestorywithMIK | 4,124 | |
|
| 395. | Final Prices With a Special Discount in a Shop | Something to learn |Leetcode 1475 |codestorywithMIK | 4,122 | |
|
| 396. | Amount of Time for Binary Tree to Be Infected | Using BFS | Leetcode 2385 | 4,120 | |
|
| 397. | Lemonade Change | Leetcode 860 | codestorywithMIK | 4,082 | | Counter-Strike: Source
|
| 398. | Pseudo-Palindromic Paths in a Binary Tree | 2 Ways | Bit Magic | Leetcode 1457 | 4,061 | |
|
| 399. | String Compression II | Recursion | Memo | Leetcode 1531 | 4,061 | |
|
| 400. | Find All Groups of Farmland | DFS | BFS | Brute Force | Leetcode 1992 | codestorywithMIK | 4,048 | |
|
