Master the MAANG Interview with a
Scientific Approach.
A structured 100-problem Java roadmap built on the academic rigor of Princeton University. From Union-Find to Dynamic Programming, bridge the gap between theory and elite performance.
100
43
55
2
Showing 100 of 100 problems
Reverse String
Palindrome Check
Two Sum
Contains Duplicate
Valid Anagram
Group Anagrams
Top K Frequent Elements
Product of Array Except Self
Valid Sudoku
Longest Consecutive Sequence
Majority Element
Pascal's Triangle
Best Time to Buy/Sell Stock
Single Number
FizzBuzz
Move Zeroes
Plus One
Is Subsequence
Valid Palindrome II
Isomorphic Strings
Subarray Sum Equals K
First Unique Character
Replace Elements Greatest Right
Longest Common Prefix
Can Place Flowers
Valid Palindrome
Two Sum II (Sorted)
3Sum
Container With Most Water
Trapping Rain Water
Longest Substring (No Repeat)
Longest Repeating Char Replacement
Permutation in String
Minimum Size Subarray Sum
Find All Anagrams in String
Reverse String II
Merge Sorted Array
Remove Element
Remove Duplicates from Sorted Array
Rotate Array
Reverse Linked List
Merge Two Sorted Lists
Linked List Cycle
Reorder List
Remove Nth Node From End
Binary Tree Inorder Traversal
Maximum Depth of Binary Tree
Validate BST
Lowest Common Ancestor of BST
Binary Tree Level Order
Climbing Stairs
House Robber
Coin Change
Longest Increasing Subsequence
Edit Distance
Number of 1 Bits
Counting Bits
Subsets
Valid Parentheses
Min Stack
Evaluate Reverse Polish Notation
Kth Largest in Stream
Merge K Sorted Lists
Binary Search
Search Insert Position
Find Minimum in Rotated Sorted
Search in Rotated Sorted Array
Maximum Subarray
Jump Game
Jump Game II
Merge Intervals
Non-overlapping Intervals
Insert Interval
Combination Sum
Subsets II
Permutations
Letter Combinations of Phone
Number of Islands
Clone Graph
Pacific Atlantic Water Flow
Course Schedule
Sqrt(x)
Pow(x, n)
Rotate Image
Set Matrix Zeroes
Spiral Matrix
Longest Palindromic Substring
Palindromic Substrings
Implement Trie
Design Add and Search Words
Word Search
Partition Equal Subset Sum
Word Break
Unique Paths
Maximum Subarray (Kadane's)
Jump Game
Merge Intervals
Non-overlapping Intervals
Insert Interval
Word Search
Still feeling stuck?
Review the academic foundation topics from Princeton University to strengthen your core understanding of algorithms.
View Full Curriculum