| 401. | Minimum Operations to Make Array Equal to Target | Minimum Number of Increments|Leetcode 3229 & 1526 | 4,020 | |
|
| 402. | Minimum Add to Make Parentheses Valid | Simple Intuition | Leetcode 921 | codestorywithMIK | 4,012 | |
|
| 403. | Valid Word | Easy | Leetcode 3136 | codestorywithMIK | 4,001 | |
|
| 404. | Recursion : The Ultimate Guru π₯ | 3,998 | |
|
| 405. | Custom Sort String | 2 Approaches | Intuition | Meta | Leetcode 791 | 3,993 | |
|
| 406. | My First Salary β€οΈ | 3,970 | |
|
| 407. | Convert 1D Array Into 2D Array | 2 Approaches | Leetcode 2022 | codestorywithMIK | 3,969 | |
|
| 408. | Design a Stack With Increment Operation | Better Approach | O(1) | Leetcode 1381 | codestorywithMIK | 3,966 | |
|
| 409. | Segment Tree | Update Query | Story To Code | Video 2 | 3,946 | |
|
| 410. | Longest Palindromic Substring | Recursion | Memoization | Microsoft | Leetcode - 5 | 3,941 | |
|
| 411. | Constrained Subsequence Sum | Recursion | Memoization | Sliding Window | GOOGLE | Leetcode - 1425 | 3,935 | |
|
| 412. | Number of Islands | DFS | BFS | Same as Island Perimeter | Leetcode 200 | codestorywithMIK | 3,915 | |
|
| 413. | Make Two Arrays Equal by Reversing Subarrays | Easy | Leetcode 1460 | codestorywithMIK | 3,882 | |
|
| 414. | Crawler Log Folder | 2 Approaches | Dry Runs | Leetcode 1598 | codestorywithMIK | 3,869 | |
|
| 415. | Delete Characters to Make Fancy String | Simple & Easy | Leetcode 1957 | codestorywithMIK | 3,860 | |
|
| 416. | Minimum Cost for Cutting Cake I & II | Thought Process | Leetcode 3218 | 3219 | codestorywithMIK | 3,851 | |
|
| 417. | TLE agaya last waale test case me π₯Ί | 3,842 | |
|
| 418. | Maximum Number of Integers to Choose From a Range I | Simple | Leetcode 2554 | codestorywithMIK | 3,833 | |
|
| 419. | Cherry Pickup II | 3 Approaches | Super Detailed | Leetcode 1463 | 3,831 | |
|
| 420. | Minimize the Maximum Adjacent Element Difference | Detailed Explanation | Leetcode 3357 | MIK | 3,825 | |
|
| 421. | Extra Characters in a String | Tree Diagram | Recursion | Memoization | MADE EASY | Leetcode - 2707 | 3,812 | |
|
| 422. | Take Gifts From the Richest Pile | Simple Explanation | Leetcode 2558 | codestorywithMIK | 3,804 | |
|
| 423. | Reorder List | 3 Approaches | Leetcode 143 | codestorywithMIK | 3,780 | |
|
| 424. | DSA Shorts with MIK - 3 | 3,778 | |
|
| 425. | Minimum Number of Operations to Make Array XOR Equal to K | Easy | Leetcode 2997 | codestorywithMIK | 3,767 | |
|
| 426. | Relative Ranks | 3 Approaches | Leetcode 506 | codestorywithMIK | 3,760 | |
|
| 427. | Maximum Difference Between Increasing Elements | Easy | Leetcode 2016 | codestorywithMIK | 3,753 | |
|
| 428. | Replace Words | Using TRIE | Uber | Leetcode 648 | codestorywithMIK | 3,752 | |
|
| 429. | 132 Pattern | Intuition explained | Brute Force | Better | Optimal | META | AMAZON | Leetcode - 456 | 3,750 | |
|
| 430. | One Love = CODING β€οΈπ¨π»βπ» | 3,712 | |
|
| 431. | Adding Spaces to a String | Straight Forward Easy | Leetcode 2109 | codestorywithMIK | 3,709 | |
|
| 432. | Sequential Digits | 2 Approaches | Leetcode 1291 | 3,707 | |
|
| 433. | No Loop Needed | Find Min & Max in 1 Line using STL | C++ Competitive Programming Hack | 3,695 | |
|
| 434. | Merge Two 2D Arrays by Summing Values | Multiple Approaches | Leetcode 2570 | codestorywithMIK | 3,650 | |
|
| 435. | Remove Duplicate Letters | Why Monotonic Stack | Intuition | GOOGLE | Leetcode - 316 | 3,649 | |
|
| 436. | Lexicographically Minimum String After Removing Stars | Easy | Leetcode 3170 | codestorywithMIK | 3,621 | |
|
| 437. | Divide a String Into Groups of Size k | Easy | Leetcode 2138 | codestorywithMIK | 3,618 | |
|
| 438. | Final Array State After K Multiplication Operations I | Detailed | Leetcode 3264 | codestorywithMIK | 3,611 | |
|
| 439. | Out of Boundary Paths | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 576 | 3,575 | |
|
| 440. | Thoda bed rest lelu ? π₯Ή | 3,574 | |
|
| 441. | Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91 | 3,556 | |
|
| 442. | Check if One String Swap Can Make Strings Equal | 2 Approaches | Leetcode 1790 | codestorywithMIK | 3,530 | |
|
| 443. | Parallel Courses III | Topological Sorting | Intuition | Dry Run | UBER | Leetcode - 2050 | 3,518 | Vlog |
|
| 444. | Thank You For The Trust πβ€οΈπ₯Ί | 3,509 | |
|
| 445. | Burden of being Average | codestorywithMIK | 3,505 | |
|
| 446. | Frequency of the Most Frequent Element | Binary Search | Sliding Window | META | Leetcode-1838 | 3,467 | |
|
| 447. | Reconstruct Itinerary | Clean | Simple | Intuitive | GOOGLE | Leetcode-332 | Live Code | 3,462 | |
|
| 448. | Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK | 3,460 | |
|
| 449. | Time Needed to Buy Tickets | 3 Approaches | Leetcode 2073 | codestorywithMIK | 3,443 | |
|
| 450. | Special Array I | 2 Approaches | Leetcode 3151 | codestorywithMIK | 3,430 | |
|
| 451. | Maximum Length of a Concatenated String with Unique Characters | Using Bit Magic | Leetcode 1239 | 3,425 | |
|
| 452. | Longest Strictly Increasing or Strictly Decreasing Subarray | Leetcode 3105 | codestorywithMIK | 3,413 | |
|
| 453. | Unique Length-3 Palindromic Subsequences | 2 Ways | Intuition | META | GOOGLE | Leetcode-1930 | 3,384 | |
|
| 454. | Minimum Length of String After Deleting Similar Ends | Simple Two Pointers | Leetcode 1750 | 3,383 | |
|
| 455. | Insert Greatest Common Divisors in Linked List | 2 Approaches | Leetcode 2807 | codestorywithMIK | 3,376 | |
|
| 456. | Subarrays with K Different Integers | Approach-2 | One Pass | Leetcode 992 | codestorywithMIK | 3,376 | |
|
| 457. | Shortest Path Visiting All Nodes | Clean | Simple | Intuitive | BFS | GOOGLE | Leetcode-847 | | 3,348 | |
|
| 458. | Minimum Number of Operations to Make Array Continuous | Brute Force | Optimal | Leetcode - 2009 | 3,342 | |
|
| 459. | Word Break | Tree Diagram | Recursion | Memoization | Similar Problems | Leetcode-139 | 3,337 | |
|
| 460. | Knight Dialer | Recursion Memoization | Bottom Up DP | Google | Dropbox | Leetcode 935 | 3,329 | |
|
| 461. | Youtube Audio Track Feature | Change Audio Language | codestorywithMIK | 3,326 | |
|
| 462. | Two Sum - Explanation β Live Coding π§π»βπ»(In Hinglish π) | 3,303 | |
|
| 463. | Minimum Number of Operations to Make Array Empty | Explained with Reasons | Greedy | Leetcode 2870 | 3,294 | |
|
| 464. | Longest Increasing Subsequence | Patience Sorting | DP Concepts & Qns-17 | Leetcode 300 | 3,287 | |
|
| 465. | Segment Tree | Range Sum Query | Story To Code | Video 3 | 3,274 | |
|
| 466. | Convert an Array Into a 2D Array With Conditions | With Dry Run | Leetcode 2610 | 3,261 | |
|
| 467. | Counting Words With a Given Prefix | Brute Force | Trie | Leetcode 2185 | codestorywithMIK | 3,240 | | Brute Force
|
| 468. | Fair Distribution of Cookies | Khandani Backtracking Template | Leetcode-2305 | Explanation + Coding | 3,234 | |
|
| 469. | Soup Servings | INTUITIVE | Recursion | Memoization | GOOGLE | Leetcode-808 | 3,227 | |
|
| 470. | Find Mode in Binary Search Tree | 2 Approaches | Follow Up | Leetcode-501 | GOOGLE | 3,222 | |
|
| 471. | Integer Break | Tree Diagram | Recursion | Memoization | AMAZON | Leetcode - 343 | 3,215 | |
|
| 472. | Count Alternating Subarrays | Super Easy | Leetcode 3031 | Weekly Contest 391 | codestorywithMIK | 3,210 | |
|
| 473. | Minimum Difficulty of a Job Schedule | Bottom Up | Amazon | Leetcode 1335 | 3,207 | |
|
| 474. | Predict the Winner | Two Recursive Approaches | Memoization | Game Strategy | AMAZON | Leetcode-486 | 3,198 | |
|
| 475. | Double a Number Represented as a Linked List | 4 Approaches | Story|Leetcode 2816 | codestorywithMIK | 3,197 | |
|
| 476. | Minimum Array Sum | Detailed for Beginners | Contest Problem | Leetcode 3366 | codestorywithMIK | 3,196 | |
|
| 477. | CANDY | 2 Approaches | O(1) Space | O(N) Space | AMAZON | Leetcode - 135 | 3,196 | |
|
| 478. | Priorities π₯Ήπ₯Ήπ₯Ή | 3,184 | |
|
| 479. | Largest Submatrix With Rearrangements | Build Intuition | 3 Approaches | Leetcode 1727 | 3,176 | |
|
| 480. | Divisible and Non-divisible Sums Difference | Constant Time | Leetcode 2894 | codestorywithMIK | 3,174 | |
|
| 481. | Image Smoother | 2 Simple Approaches | AMAZON | Leetcode-661 | 3,153 | |
|
| 482. | Number of Music Playlists | Made Super Easy | Recursion | Memoization | META | Leetcode-920 | 3,138 | |
|
| 483. | K-th Symbol in Grammar | Recursion | Recurrence Relation Explained | GOOGLE | Leetcode - 779 | 3,117 | |
|
| 484. | Even Odd Tree | DFS | BFS | Leetcode 1609 | 3,086 | |
|
| 485. | Design a Food Rating System | Clean Approach | Leetcode-2353 | 3,062 | |
|
| 486. | Poor Pigs | Maths | With Intuition | Clear Explanation | Leetcode - 458 | 3,043 | |
|
| 487. | Number of Laser Beams in a Bank | Clear Explanation | Dry Run | Amazon | Leetcode 2125 | 3,034 | |
|
| 488. | Painting the Walls | Why Greedy Fails | Recursion | Memoization | GOOGLE | Leetcode - 2742 | 3,012 | |
|
| 489. | Unique Binary Search Trees II | Similar Problem | Recursion | Memoization | Amazon | Leetcode-95 | 2,996 | |
|
| 490. | Find Bottom Left Tree Value | 3 Approaches | Simple Story | Microsoft | Leetcode 513 | 2,990 | |
|
| 491. | Largest Positive Integer That Exists With Its Negative |4 Approaches|Leetcode 2441 |codestorywithMIK | 2,980 | |
|
| 492. | Minimum Operations to Reduce X to Zero | 2 Approaches | Recursion | Hashmap | Leetcode - 1658 | 2,980 | |
|
| 493. | Maximum Number of Moves to Kill All Pawns | Step By Step Detailed | Leetcode 3283 | codestorywithMIK | 2,969 | |
|
| 494. | Maximal Network Rank | Simple and Straight | 2 Ways | MICROSOFT | Leetcode-239 | Dry Run | Live Code | 2,967 | |
|
| 495. | Count All Valid Pickup and Delivery Options | CLEAR INTUITION | META | Leetcode - 1359 | 2,954 | |
|
| 496. | Restore the Array From Adjacent Pairs | Easy Explanation | Dry Run | Intuition | Leetcode-1743 | 2,941 | |
|
| 497. | Minimum Time to Collect All Apples in a Tree - (Microsoft) : Explanation β Live Coding | 2,931 | |
|
| 498. | Divide Array Into Arrays With Max Difference| Why Sorting | Google | Leetcode 2966 | 2,930 | |
|
| 499. | Minimize the Maximum Difference of Pairs | Binary Search Pattern | INTUITION | META | Leetcode-2616 | 2,925 | |
|
| 500. | Introduction - Why & what ? | 2,924 | |
|
