๐Ÿ—๏ธ NeetCode 150 โ€” SRS

Kotlin
โญ Critical (58) ๐Ÿ“‹ Active (129) ๐Ÿ“š All (150) 58 critical ยท 71 optional ยท 21 skip
โญ critical โ€” high frequency, must know โ—‹ optional โ€” good to know, lower priority โ€” skip โ€” rarely appears outside FAANG
150Total
0Due
0Done
๐Ÿ”„ Refresh ๐Ÿ” Reset All

๐Ÿ“‹ Due Now (150)

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

๐Ÿ“š Problems

Arrays & Hashing (9)

#1 โญ Contains Duplicate LC [E] New
#2 โญ Valid Anagram LC [E] New
#3 โญ Two Sum LC [E] New
#4 โญ Group Anagrams LC [M] New
#5 โญ Top K Frequent Elements LC [M] New
#6 โ—‹ Encode and Decode Strings LC [M] New
#7 โญ Product of Array Except Self LC [M] New
#8 โ—‹ Valid Sudoku LC [M] New
#9 โ—‹ Longest Consecutive Sequence LC [M] New

Two Pointers (5)

#10 โญ Valid Palindrome LC [E] New
#11 โญ Two Sum II Input Array Is Sorted LC [M] New
#12 โญ 3Sum LC [M] New
#13 โญ Container With Most Water LC [M] New
#14 โ—‹ Trapping Rain Water LC [H] New

Sliding Window (6)

#15 โญ Best Time to Buy And Sell Stock LC [E] New
#16 โญ Longest Substring Without Repeating Characters LC [M] New
#17 โญ Longest Repeating Character Replacement LC [M] New
#18 โญ Permutation In String LC [M] New
#19 โ—‹ Minimum Window Substring LC [H] New
#20 โ—‹ Sliding Window Maximum LC [H] New

Stack (6)

#21 โญ Valid Parentheses LC [E] New
#22 โญ Min Stack LC [M] New
#23 โ—‹ Evaluate Reverse Polish Notation LC [M] New
#24 โญ Daily Temperatures LC [M] New
#25 โ—‹ Car Fleet LC [M] New
#26 โ—‹ Largest Rectangle In Histogram LC [H] New

Binary Search (7)

#27 โญ Binary Search LC [E] New
#28 โญ Search a 2D Matrix LC [M] New
#29 โ—‹ Koko Eating Bananas LC [M] New
#30 โญ Find Minimum In Rotated Sorted Array LC [M] New
#31 โญ Search In Rotated Sorted Array LC [M] New
#32 โ—‹ Time Based Key Value Store LC [M] New
#33 โ—‹ Median of Two Sorted Arrays LC [H] New

Linked List (11)

#34 โญ Reverse Linked List LC [E] New
#35 โญ Merge Two Sorted Lists LC [E] New
#36 โญ Linked List Cycle LC [E] New
#37 โญ Reorder List LC [M] New
#38 โญ Remove Nth Node From End of List LC [M] New
#39 โ—‹ Copy List With Random Pointer LC [M] New
#40 โญ Add Two Numbers LC [M] New
#41 โ—‹ Find The Duplicate Number LC [M] New
#42 โญ LRU Cache LC [M] New
#43 โ—‹ Merge K Sorted Lists LC [H] New
#44 โ€” Reverse Nodes In K Group LC [H] New

Trees (15)

#45 โญ Invert Binary Tree LC [E] New
#46 โญ Maximum Depth of Binary Tree LC [E] New
#47 โญ Diameter of Binary Tree LC [E] New
#48 โ—‹ Balanced Binary Tree LC [E] New
#49 โ—‹ Same Tree LC [E] New
#50 โ—‹ Subtree of Another Tree LC [E] New
#51 โญ Lowest Common Ancestor of a Binary Search Tree LC [M] New
#52 โญ Binary Tree Level Order Traversal LC [M] New
#53 โ—‹ Binary Tree Right Side View LC [M] New
#54 โ—‹ Count Good Nodes In Binary Tree LC [M] New
#55 โญ Validate Binary Search Tree LC [M] New
#56 โ—‹ Kth Smallest Element In a Bst LC [M] New
#57 โ—‹ Construct Binary Tree From Preorder And Inorder Traversal LC [M] New
#58 โ—‹ Binary Tree Maximum Path Sum LC [H] New
#59 โ—‹ Serialize And Deserialize Binary Tree LC [H] New

Heap / Priority Queue (7)

#60 โ—‹ Kth Largest Element In a Stream LC [E] New
#61 โ—‹ Last Stone Weight LC [E] New
#62 โญ K Closest Points to Origin LC [M] New
#63 โญ Kth Largest Element In An Array LC [M] New
#64 โ—‹ Task Scheduler LC [M] New
#65 โ—‹ Design Twitter LC [M] New
#66 โ—‹ Find Median From Data Stream LC [H] New

Backtracking (10)

#67 โญ Subsets LC [M] New
#68 โญ Combination Sum LC [M] New
#69 โ—‹ Combination Sum II LC [M] New
#70 โญ Permutations LC [M] New
#71 โ—‹ Subsets II LC [M] New
#72 โญ Generate Parentheses LC [M] New
#73 โญ Word Search LC [M] New
#74 โ—‹ Palindrome Partitioning LC [M] New
#75 โ—‹ Letter Combinations of a Phone Number LC [M] New
#76 โ—‹ N Queens LC [H] New

Tries (3)

#77 โญ Implement Trie Prefix Tree LC [M] New
#78 โ—‹ Design Add And Search Words Data Structure LC [M] New
#79 โ€” Word Search II LC [H] New

Graphs (13)

#80 โญ Number of Islands LC [M] New
#81 โ—‹ Max Area of Island LC [M] New
#82 โญ Clone Graph LC [M] New
#83 โ—‹ Walls And Gates LC [M] New
#84 โญ Rotting Oranges LC [M] New
#85 โ—‹ Pacific Atlantic Water Flow LC [M] New
#86 โ—‹ Surrounded Regions LC [M] New
#87 โญ Course Schedule LC [M] New
#88 โ—‹ Course Schedule II LC [M] New
#89 โ—‹ Graph Valid Tree LC [M] New
#90 โ—‹ Number of Connected Components In An Undirected Graph LC [M] New
#91 โ—‹ Redundant Connection LC [M] New
#92 โ€” Word Ladder LC [H] New

Advanced Graphs (6)

#93 โ€” Network Delay Time LC [M] New
#94 โ€” Reconstruct Itinerary LC [H] New
#95 โ€” Min Cost to Connect All Points LC [M] New
#96 โ€” Swim In Rising Water LC [H] New
#97 โ€” Alien Dictionary LC [H] New
#98 โ€” Cheapest Flights Within K Stops LC [M] New

1-D Dynamic Programming (12)

#99 โญ Climbing Stairs LC [E] New
#100 โ—‹ Min Cost Climbing Stairs LC [E] New
#101 โญ House Robber LC [M] New
#102 โ—‹ House Robber II LC [M] New
#103 โ—‹ Longest Palindromic Substring LC [M] New
#104 โ—‹ Palindromic Substrings LC [M] New
#105 โ—‹ Decode Ways LC [M] New
#106 โญ Coin Change LC [M] New
#107 โ—‹ Maximum Product Subarray LC [M] New
#108 โญ Word Break LC [M] New
#109 โ—‹ Longest Increasing Subsequence LC [M] New
#110 โ—‹ Partition Equal Subset Sum LC [M] New

2-D Dynamic Programming (11)

#111 โญ Unique Paths LC [M] New
#112 โญ Longest Common Subsequence LC [M] New
#113 โ—‹ Best Time to Buy And Sell Stock With Cooldown LC [M] New
#114 โ—‹ Coin Change II LC [M] New
#115 โ—‹ Target Sum LC [M] New
#116 โ—‹ Interleaving String LC [M] New
#117 โ€” Longest Increasing Path In a Matrix LC [H] New
#118 โ€” Distinct Subsequences LC [H] New
#119 โ—‹ Edit Distance LC [M] New
#120 โ€” Burst Balloons LC [H] New
#121 โ€” Regular Expression Matching LC [H] New

Greedy (8)

#122 โญ Maximum Subarray LC [M] New
#123 โ—‹ Jump Game LC [M] New
#124 โ—‹ Jump Game II LC [M] New
#125 โ—‹ Gas Station LC [M] New
#126 โ—‹ Hand of Straights LC [M] New
#127 โ—‹ Merge Triplets to Form Target Triplet LC [M] New
#128 โ—‹ Partition Labels LC [M] New
#129 โ—‹ Valid Parenthesis String LC [M] New

Intervals (6)

#130 โญ Insert Interval LC [M] New
#131 โญ Merge Intervals LC [M] New
#132 โ—‹ Non Overlapping Intervals LC [M] New
#133 โ—‹ Meeting Rooms LC [E] New
#134 โญ Meeting Rooms II LC [M] New
#135 โ€” Minimum Interval to Include Each Query LC [H] New

Math & Geometry (8)

#136 โญ Rotate Image LC [M] New
#137 โญ Spiral Matrix LC [M] New
#138 โ—‹ Set Matrix Zeroes LC [M] New
#139 โ—‹ Happy Number LC [E] New
#140 โ—‹ Plus One LC [E] New
#141 โ—‹ Pow(x, n) LC [M] New
#142 โ—‹ Multiply Strings LC [M] New
#143 โ—‹ Detect Squares LC [M] New

Bit Manipulation (7)

#144 โ€” Single Number LC [E] New
#145 โ€” Number of 1 Bits LC [E] New
#146 โ€” Counting Bits LC [E] New
#147 โ€” Reverse Bits LC [E] New
#148 โ€” Missing Number LC [E] New
#149 โ€” Sum of Two Integers LC [M] New
#150 โ€” Reverse Integer LC [M] New