NeetCode 150 - Essential LeetCode Problems for Coding Interviews

via freeCodeCamp

Start learning Write review

Master 150 essential LeetCode problems in this comprehensive coding course designed to prepare for technical interviews at top tech companies. Learn to solve algorithmic challenges covering arrays, strings, linked lists, trees, graphs, dynamic programming, and bit manipulation. Work through carefully selected problems that represent the most common patterns tested in technical interviews, with detailed explanations and solutions for each challenge. Access supplementary resources including a spreadsheet of frequently asked interview questions, Java solution implementations on GitHub, and practice materials. Progress through nearly 15 hours of structured content, starting from fundamental problems like "Contains Duplicate" and advancing to complex challenges like "Reverse Integer", building a strong foundation in algorithmic problem-solving along the way.

Syllabus

- Into
- 1 Contains Duplicate, 2 Valid Anagram
- 3 Two Sum, 4 Group Anagrams
- 5 Top K Frequent Elements, 6 Product of Array Except Self
- 7 Valid Sudoku, 8 Encode and Decode Strings
- 9 Longest Consecutive Sequence, 10 Valid Palindrome
- 11 Two Sum II Input Array Is Sorted, 12 3Sum
- 13 Container With Most Water, 14 Trapping Rain Water
- 15 Best Time to Buy And Sell Stock, 16 Longest Substring w/out Repeating Characters
- 17 Longest Repeating Character Replacement, 18 Permutation In String
- 19 Minimum Window Substring, 20 Sliding Window Maximum
- 21 Valid Parentheses, 22 Min Stack
- 23 Evaluate Reverse Polish Notation, 24 Generate Parentheses
- 25 Daily Temperatures, 26 Car Fleet
- 27 Largest Rectangle In Histogram, 28 Binary Search
- 29 Search a 2D Matrix, 30 Koko Eating Bananas
- 31 Find Minimum In Rotated Sorted Array, 32 Search In Rotated Sorted Array
- 33 Time Based Key Value Store, 34 Median of Two Sorted Arrays
- 35 Reverse Linked List, 36 Merge Two Sorted Lists
- 37 Reorder List, 38 Remove Nth Node From End of List
- 39 Copy List With Random Pointer, 40 Add Two Numbers
- 41 Linked List Cycle, 42 Find The Duplicate Number
- 43 LRU Cache, 44 Merge K Sorted Lists
- 45 Reverse Nodes In K Group, 46 Invert Binary Tree
- 47 Maximum Depth of Binary Tree, 48 Diameter of Binary Tree
- 49 Balanced Binary Tree, 50 Same Tree
- 51 Subtree of Another Tree, 52 Lowest Common Ancestor of a Binary Search Tree
- 53 Binary Tree Level Order Traversal, 54 Binary Tree Right Side View
- 55 Count Good Nodes In Binary Tree, 56 Validate Binary Search Tree
- 57 Kth Smallest Element In a Bst, 58 Construct Binary Tree
- 59 Binary Tree Maximum Path Sum, 60 Serialize And Deserialize Binary Tree
- 61 Implement Trie Prefix Tree, 62 Design Add And Search Words
- 63 Word Search II, 64 Kth Largest Element In a Stream
- 65 Last Stone Weight, 66 K Closest Points to Origin
- 67 Kth Largest Element In An Array, 68 Task Scheduler
- 69 Design Twitter, 70 Find Median From Data Stream
- 71 Subsets, 72 Combination Sum
- 73 Permutations, 74 Subsets II
- 75 Combination Sum II, 76 Word Search
- 77 Palindrome Partitioning, 78 Letter Combinations of a Phone
- 79 N Queens, 80 Number of Islands
- 81 Clone Graph, 82 Max Area of Island
- 83 Pacific Atlantic Water Flow, 84 Surrounded Regions
- 85 Rotting , 86 Walls And Gates
- 87 Course Schedule, 88 Course Schedule II
- 89 Redundant Connection, 90 Number of Connected Components
- 91 Graph Valid Tree, 92 Word Ladder
- 93 Reconstruct Itinerary, 94 Min Cost to Connect All Points
- 95 Network Delay Time, 96
- 97 Alien Dictionary, 98 Cheapest Flights Within K Stops
- 99 Climbing Stairs, 100 Min Cost Climbing Stairs
- 101 House Robber, 102 House Robber II
- 103 Longest Palindromic Substring, 104 Palindromic Substrings
- 105 Decode Ways, 106 Coin Change
- 107 Maximum Product Subarray, 108 Word Break
- 109 Longest Increasing Subsequence, 110 Partition Equal Subset Sum
- 111 Unique Paths, 112 Longest Common Subsequence
- 113 Best Time to Buy And Sell Stock, 114 Coin Change II
- 115 Target Sum, 116 Interleaving String
- 117 Longest Increasing Path In a Matrix, 118 Distinct Subsequences
- 119 Edit Distance, 120 Burst Balloons
- 121 Regular Expression Matching, 122 Maximum Subarray
- 123 Jump Game, 124 Jump Game II
- 125 ⛽, 126 Hand of Straights
- 127 Merge Triplets to Form Target Triplet, 128 Partition Labels
- 129 Valid Parenthesis String, 130 Insert Interval
- 131 Merge Intervals, 132 Non Overlapping Intervals
- 133 Meeting Rooms, 134 Meeting Rooms II
- 135 Minimum Interval to Include Each Query, 136 Rotate Image
- 137 Spiral Matrix, 138 Set Matrix Zeroes
- 139 Happy Number, 140 Plus One
- 141 Powx, n, 142 Multiply Strings
- 143 Detect Squares, 144 Single Number
- 145 Number of 1 Bits, 146 Counting Bits
- 147 Reverse Bits, 148 Missing Number
- 149 Sum of Two Integers, 150 Reverse Integer