Sheets/NeetCode150

133 problems

NeetCode150

Follow the NeetCode150 sheet end-to-end — a proven, ordered set of problems.

127Total problems

0Solved

0%Completion

24/85/24Easy/Med/Hard

Generate Brackets· Recursion

Recursion · Backtracking · Strings

Medium

25m

Power Set· Recursion

Recursion · Backtracking · Bit Manipulation

Medium

20m

Combination Sum II· Recursion

Recursion · Backtracking · Arrays

Medium

25m

All Palindromic Splits of a String· Recursion

Recursion · Backtracking · Strings

Hard

40m

Word Search in Matrix· Recursion

Recursion · Backtracking · Arrays

Medium

35m

String Segmentation· Recursion

Recursion · Backtracking · Dynamic Programming

Medium

30m

Two Sum· Hashing

Arrays · Hashing

Easy

15m

Longest Consecutive Sequence· Hashing

Arrays · Hashing

Medium

25m

Count Subarrays with Target Sum· Hashing

Arrays · Hashing · Prefix Sum

Medium

25m

Finding the Single Element in an Array· Arrays

Arrays · Bit Manipulation

Easy

15m

Largest Subarray Sum· Arrays

Arrays · Dynamic Programming · Divide and Conquer

Medium

20m

Maximum Subarray Product· Arrays

Arrays · Dynamic Programming

Medium

25m

Arrange Colors in Order· Arrays

Arrays · Two Pointers · Sorting

Medium

20m

Majority Element· Arrays

Arrays · Hashing · Greedy

Easy

15m

Maximize Share Profit· Arrays

Arrays · Greedy · Dynamic Programming

Easy

15m

Three Sum· Arrays

Arrays · Two Pointers · Sorting

Medium

25m

Four Sum· Arrays

Arrays · Two Pointers · Sorting

Medium

30m

Merge Intervals· Arrays

Arrays · Sorting · Greedy

Medium

25m

Search Element in Rotated Sorted Array· Binary Search

Binary Search · Arrays

Medium

25m

Find Minimum in Rotated Sorted Array· Binary Search

Binary Search · Arrays

Medium

20m

Find Peak Element· Binary Search

Binary Search · Arrays

Medium

25m

Monkey Eating Bananas· Binary Search

Binary Search · Arrays · Greedy

Medium

25m

Median of Two Sorted Arrays· Binary Search

Binary Search · Arrays

Hard

45m

Search in a 2D Sorted Matrix· Binary Search

Binary Search · Arrays · Matrix

Medium

20m

Search in a 2D Sorted Matrix II· Binary Search

Binary Search · Arrays · Matrix

Medium

25m

Count Set Bits in an Integer· Bit Manipulation

Bit Manipulation

Easy

10m

Single Element· Bit Manipulation

Bit Manipulation · Arrays

Easy

15m

Insert Interval· Greedy Algorithms

Arrays · Greedy · Sorting

Medium

25m

Non Overlapping Intervals· Greedy Algorithms

Arrays · Greedy · Sorting

Medium

25m

Jump Game· Greedy Algorithms

Arrays · Greedy · Dynamic Programming

Medium

25m

Jump Game-II· Greedy Algorithms

Arrays · Greedy · Dynamic Programming

Medium

25m

LRU Cache· Greedy Algorithms

Linked List · Hashing · Greedy

Medium

35m

Longest Substring Without Repeating Characters· Sliding Window & Two Pointers

Strings · Sliding Window · Hashing

Medium

25m

Max Consecutive Ones III· Sliding Window & Two Pointers

Arrays · Sliding Window

Medium

25m

Fruits & Baskets· Sliding Window & Two Pointers

Arrays · Sliding Window · Hashing

Medium

25m

Longest Repeating Character Replacement· Sliding Window & Two Pointers

Strings · Sliding Window · Hashing

Medium

25m

Max Points From Cards· Sliding Window & Two Pointers

Arrays · Sliding Window · Prefix Sum

Medium

25m

Subarrays with K Distinct Integers· Sliding Window & Two Pointers

Arrays · Sliding Window · Hashing

Hard

40m

Minimum Window Substring· Sliding Window & Two Pointers

Strings · Sliding Window · Hashing

Hard

45m

Balanced Parenthesis· Stacks & Queues

Stack · Strings

Easy

15m

Implement Min Stack· Stacks & Queues

Stack · Design

Medium

25m

Next Greater Element· Stacks & Queues

Stack · Monotonic Stack · Arrays

Easy

20m

Trapping Rainwater· Stacks & Queues

Arrays · Stack · Two Pointers

Hard

40m

Asteroid Collision· Stacks & Queues

Arrays · Stack

Medium

25m

Largest Rectangle in Histogram· Stacks & Queues

Arrays · Stack · Monotonic Stack

Hard

40m

Middle of the Linked List· Linked List

Linked List · Two Pointers

Easy

15m

Reverse a Linked List· Linked List

Linked List · Recursion

Easy

15m

Cycle Detection· Linked List

Linked List · Two Pointers

Easy

15m

Find Start Node of a Cycle· Linked List

Linked List · Two Pointers

Medium

20m

Palindrome Linked List· Linked List

Linked List · Two Pointers · Recursion

Easy

20m

Delete Kth Node From End· Linked List

Linked List · Two Pointers

Medium

25m

Sort Linked List· Linked List

Linked List · Sorting · Merge Sort

Medium

30m

Intersection of Two Linked Lists· Linked List

Linked List · Two Pointers · Hashing

Easy

20m

Add Two Numbers· Linked List

Linked List · Maths · Recursion

Medium

25m

Reverse Nodes in K-Group· Linked List

Linked List · Recursion

Hard

40m

Clone Smart Device Chain with Random Pointer· Linked List

Linked List · Hashing · Recursion

Hard

40m

Preorder Traversal· Binary Trees

Trees · DFS · Recursion

Easy

10m

Inorder Traversal· Binary Trees

Trees · DFS · Recursion

Easy

10m

Postorder Traversal· Binary Trees

Trees · DFS · Recursion

Easy

10m

Level Order Traversal· Binary Trees

Trees · BFS · Queue

Medium

20m

Balanced Binary Tree· Binary Trees

Trees · Recursion · DFS

Easy

20m

Diameter of Binary Tree· Binary Trees

Trees · Recursion · DFS

Easy

20m

Maximum Path Sum of a Binary Tree· Binary Trees

Trees · Recursion · DFS

Hard

35m

Identical Binary Trees· Binary Trees

Trees · Recursion · DFS

Easy

10m

Symmetric Binary Tree· Binary Trees

Trees · Recursion · DFS

Easy

15m

Zig-Zag Level Order Traversal· Binary Trees

Trees · BFS · Queue

Medium

25m

Right View of Binary Tree· Binary Trees

Trees · DFS · BFS

Medium

20m

Lowest Common Ancestor of a Binary Tree· Binary Trees

Trees · DFS · Recursion

Medium

25m

Preorder Inorder Tree Build· Binary Trees

Trees · Recursion · DFS

Hard

35m

Tree Serialization and Deserialization· Binary Trees

Trees · DFS · BFS

Hard

40m

Search in BST· Binary Search Tree

Binary Search Tree · Recursion · Binary Search

Easy

10m

Insertion in BST· Binary Search Tree

Binary Search Tree · Recursion

Medium

20m

Deletion in BST· Binary Search Tree

Binary Search Tree · Recursion

Medium

25m

Kth Smallest Element in BST· Binary Search Tree

Binary Search Tree · Recursion · Stack

Medium

20m

Validate a Binary Search Tree· Binary Search Tree

Binary Search Tree · Recursion · DFS

Medium

20m

Lowest Common Ancestor in BST· Binary Search Tree

Binary Search Tree · Recursion

Medium

20m

Kth Largest Element· Heaps

Heap · Sorting · Arrays

Medium

20m

Merge K Sorted Linked Lists· Heaps

Heap · Linked List · Sorting

Hard

35m

Top K Frequent Elements· Heaps

Heap · Hashing · Sorting

Medium

25m

Tasks Scheduling· Heaps

Heap · Greedy · Hashing

Medium

30m

Median Tracker In Data Stream· Heaps

Heap · Sorting

Hard

35m

Number of Provinces· Graphs

Graph · DFS · Union Find

Medium

25m

Number Of Islands· Graphs

Graph · BFS · DFS

Medium

25m

Rotten Oranges· Graphs

Graph · BFS · Queue

Medium

25m

Flood Fill· Graphs

Graph · BFS · DFS

Easy

15m

Nearest Zero· Graphs

Graph · BFS

Medium

25m

'O' Within 'X' Boundary· Graphs

Graph · DFS · BFS

Medium

30m

Word Transformation Sequence· Graphs

Graph · BFS · Hashing

Hard

40m

Bipartite Graph — DFS· Graphs

Graph · DFS · BFS

Medium

25m

Task Completion I· Graphs

Graph · Topological Sort · BFS

Medium

25m

Task Completion II· Graphs

Graph · Topological Sort · BFS

Medium

30m

Alien Dictionary Sort· Graphs

Graph · Topological Sort · Strings

Hard

35m

Minimum Effort Path· Graphs

Graph · Heap · Binary Search

Medium

30m

Cheapest Flight within K Stops· Graphs

Graph · Bellman-Ford · Dynamic Programming

Medium

30m

City With Least Neighbors· Graphs

Graph · Floyd Warshall

Medium

30m

Merge User Profiles· Graphs

Graph · Union Find · Hashing

Medium

30m

Largest Connected Group· Graphs

Graph · Union Find

Medium

30m

Climbing Stairs· Dynamic Programming

Dynamic Programming · Recursion

Easy

15m

House Robber I· Dynamic Programming

Dynamic Programming · Arrays

Medium

20m

House Robber II· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Unique Paths I· Dynamic Programming

Dynamic Programming · Arrays

Medium

20m

Unique Paths II· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Minimum Path Sum· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Triangle· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Partition Equal Subset Sum· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Possible Coin Combinations· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Target Expression Count· Dynamic Programming

Dynamic Programming · Recursion

Medium

25m

Longest Common Subsequence· Dynamic Programming

Dynamic Programming · Strings

Medium

25m

Longest Palindromic Subsequence· Dynamic Programming

Dynamic Programming · Strings

Medium

25m

Minimum Deletions to Make Strings Equal· Dynamic Programming

Dynamic Programming · Strings

Medium

25m

Shortest Common Supersequence· Dynamic Programming

Dynamic Programming · Strings

Hard

30m

Edit Distance· Dynamic Programming

Dynamic Programming · Strings

Hard

35m

WildCard Matching· Dynamic Programming

Dynamic Programming · Strings

Hard

35m

Stock Trading II· Dynamic Programming

Dynamic Programming · Greedy · Arrays

Medium

20m

Stock Trading III· Dynamic Programming

Dynamic Programming · Arrays

Hard

30m

Stock Trading IV· Dynamic Programming

Dynamic Programming · Arrays

Hard

30m

Buy and Sell Products with Transaction Fee· Dynamic Programming

Dynamic Programming · Greedy · Arrays

Medium

25m

Building a Growing Sequence of Heights· Dynamic Programming

Dynamic Programming · Arrays · Binary Search

Medium

25m

Find the Largest Divisible Chain· Dynamic Programming

Dynamic Programming · Arrays · Sorting

Medium

25m

Longest Increasing Subsequence Count· Dynamic Programming

Dynamic Programming · Arrays

Hard

30m

Maximum Coins from Bursting Bubbles· Dynamic Programming

Dynamic Programming · Recursion

Hard

40m

Maximal Unity Rectangle Discovery· Dynamic Programming

Dynamic Programming · Stack · Monotonic Stack

Hard

40m

Implementation of Tries I· Tries

Trie · Strings

Medium

25m

Implementation of Tries II· Tries

Trie · Strings

Medium

30m

Maximum XOR of Two Numbers· Tries

Trie · Bit Manipulation

Hard

30m

Min Additions To Make Parentheses Valid· Strings — Advanced Algorithms

Strings · Stack · Greedy

Medium

20m

Number of Palindromic Substrings· Strings — Advanced Algorithms

Strings · Dynamic Programming · Two Pointers

Medium

25m