StudyDSA

StudyDSA

NeetCode 150 🚀

A comprehensive list curated by Navdeep Singh (NeetCode). It is an expansion of the Blind 75 list and features a blend of beginner-friendly and more challenging problems.

Copyright © StudyDSA. All rights reserved.

NeetCode 150 🚀

A comprehensive list curated by Navdeep Singh (NeetCode). It is an expansion of the Blind 75 list and features a blend of beginner-friendly and more challenging problems.

Array / String

Completed	Title		Status	Notes	Solution
	Contains Duplicate	Easy
	Valid Anagram	Easy
	Two Sum	Easy
	Group Anagrams	Medium
	Top K Frequent Elements	Medium
	Encode and Decode Strings	Medium
	Product of Array Except Self	Medium
	Valid Sudoku	Medium
	Longest Consecutive Sequence	Medium
	Design Twitter	Medium

Two Pointers

Completed	Title		Status	Notes	Solution
	Valid Palindrome	Easy
	Palindromic Substrings	Medium
	Longest Palindromic Substring	Medium
	Two Sum II - Input Array Is Sorted	Medium
	Container With Most Water	Medium
	3Sum	Medium
	Trapping Rain Water	Hard

Sliding Window

Completed	Title		Status	Notes	Solution
	Longest Substring Without Repeating Characters	Medium
	Longest Repeating Character Replacement	Medium
	Permutation in String	Medium
	Minimum Window Substring	Hard
	Sliding Window Maximum	Hard

Stacks

Completed	Title		Status	Notes	Solution
	Valid Parentheses	Easy
	Min Stack	Medium
	Evaluate Reverse Polish Notation	Medium
	Generate Parentheses	Medium
	Daily Temperatures	Medium
	Car Fleet	Medium
	Largest Rectangle in Histogram	Hard

Binary Search

Completed	Title		Status	Notes	Solution
	Binary Search	Easy
	Search a 2D Matrix	Medium
	Find Minimum in Rotated Sorted Array	Medium
	Search in Rotated Sorted Array	Medium
	Time Based Key-Value Store	Medium
	Koko Eating Bananas	Medium
	Median of Two Sorted Arrays	Hard

Linked Lists

Completed	Title		Status	Notes	Solution
	Reverse Linked List	Easy
	Linked List Cycle	Easy
	Merge Two Sorted Lists	Easy
	Reorder List	Medium
	Remove Nth Node From End of List	Medium
	Copy List with Random Pointer	Medium
	Add Two Numbers	Medium
	Find the Duplicate Number	Medium
	LRU Cache	Medium
	Merge k Sorted Lists	Hard
	Reverse Nodes in k-Group	Hard

Trees

Completed	Title		Status	Notes	Solution
	Invert Binary Tree	Easy
	Maximum Depth of Binary Tree	Easy
	Diameter of Binary Tree	Easy
	Balanced Binary Tree	Easy
	Same Tree	Easy
	Subtree of Another Tree	Easy
	Lowest Common Ancestor of a Binary Search Tree	Medium
	Validate Binary Search Tree	Medium
	Kth Smallest Element in a BST	Medium
	Binary Tree Level Order Traversal	Medium
	Binary Tree Right Side View	Medium
	Count Good Nodes in Binary Tree	Medium
	Construct Binary Tree from Preorder and Inorder Traversal	Medium
	Binary Tree Maxiumum Path Sum	Hard
	Serialize and Deserialize Binary Tree	Hard

Heaps / Priority Queues

Completed	Title		Status	Notes	Solution
	Kth Largest Element in a Stream	Easy
	Last Stone Weight	Easy
	Kth Largest Element in an Array	Medium
	K Closest Points to Origin	Medium
	Task Scheduler	Medium
	Find Median from Data Stream	Hard

Backtracking

Completed	Title		Status	Notes	Solution
	Subsets	Medium
	Combination Sum	Medium
	Permutations	Medium
	Subsets II	Medium
	Combination Sum II	Medium
	Word Search	Medium
	Palindrome Partitioning	Medium
	Letter Combinations of a Phone Number	Medium
	N-Queens	Hard

Tries

Completed	Title		Status	Notes	Solution
	Implement Trie (Prefix Tree)	Medium
	Design Add and Search Words Data Structure	Medium
	Word Search II	Hard

Graphs

Completed	Title		Status	Notes	Solution
	Number of Islands	Medium
	Max Area of Island	Medium
	Surrounded Regions	Medium
	Pacific Atlantic Water Flow	Medium
	Walls and Gates	Medium
	Rotting Oranges	Medium
	Clone Graph	Medium
	Course Schedule	Medium
	Course Schedule II	Medium
	Redundant Connection	Medium
	Number of Connected Components in an Undirected Graph	Medium
	Graph Valid Tree	Medium
	Longest Increasing Path in a Matrix	Hard
	Word Ladder	Hard

Advanced Graphs

Completed	Title		Status	Notes	Solution
	Min Cost to Connect All Points	Medium
	Network Delay Time	Medium
	Cheapest Flights Within K Stops	Medium
	Reconstruct Itinerary	Hard
	Swim in Rising Water	Hard
	Alien Dictionary	Hard

Dynamic Programming - 1D

Completed	Title		Status	Notes	Solution
	Climbing Stairs	Easy
	Min Cost Climbing Stairs	Easy
	House Robber	Medium
	House Robber II	Medium
	Decode Ways	Medium
	Coin Change	Medium
	Coin Change II	Medium
	Maximum Product Subarray	Medium
	Best Time to Buy and Sell Stock with Cooldown	Medium
	Word Break	Medium
	Longest Increasing Subsequence	Medium
	Target Sum	Medium

Dynamic Programming - Multidimensional

Completed	Title		Status	Notes	Solution
	Unique Paths	Medium
	Longest Common Subsequence	Medium
	Edit Distance	Medium
	Interleaving String	Medium
	Distinct Subsequences	Hard
	Burst Balloons	Hard
	Regular Expression Matching	Hard

Greedy Algorithms

Completed	Title		Status	Notes	Solution
	Best Time to Buy And Sell Stock	Easy
	Maximum Subarray	Medium
	Jump Game	Medium
	Jump Game II	Medium
	Gas Station	Medium
	Hand of Straights	Medium
	Merge Triplets to Form Target Triplet	Medium
	Partition Labels	Medium
	Valid Parenthesis String	Medium

Intervals

Completed	Title		Status	Notes	Solution
	Meeting Rooms	Easy
	Meeting Rooms II	Medium
	Merge Intervals	Medium
	Insert Interval	Medium
	Non-overlapping Intervals	Medium
	Minimum Interval to Include Each Query	Hard

Math

Completed	Title		Status	Notes	Solution
	Happy Number	Easy
	Plus One	Easy
	Rotate Image	Medium
	Spiral Matrix	Medium
	Set Matrix Zeroes	Medium
	Reverse Integer	Medium
	Pow(x, n)	Medium
	Multiply Strings	Medium
	Detect Squares	Medium

Bit Manipulation

Completed	Title		Status	Notes	Solution
	Number of 1 Bits	Easy
	Counting Bits	Easy
	Single Number	Easy
	Reverse Bits	Easy
	Missing Number	Easy
	Partition Equal Subset Sum	Medium
	Sum of Two Integers	Medium