ASAPUtils Logo ASAPUtils

DSA Problems

Interview problems worked from brute force to optimal, each with the pattern signal that identifies it, C++ and JavaScript solutions, complexity analysis, and a step-by-step visualizer.

Problem Difficulty
3Sum medium
Container With Most Water medium
Contains Duplicate easy
Encode and Decode Strings medium
Group Anagrams medium
Longest Consecutive Sequence medium
Product of Array Except Self medium
Top K Frequent Elements medium
Trapping Rain Water hard
Two Sum easy
Two Sum II — Input Array Is Sorted medium
Valid Anagram easy
Valid Palindrome easy
Valid Sudoku medium
Best Time to Buy and Sell Stock easy
Longest Repeating Character Replacement medium
Longest Substring Without Repeating Characters medium
Maximum Average Subarray I easy
Minimum Window Substring hard
Permutation in String medium
Sliding Window Maximum hard
Subarray Sum Equals K medium
Car Fleet medium
Daily Temperatures medium
Evaluate Reverse Polish Notation medium
Largest Rectangle in Histogram hard
Min Stack medium
Valid Parentheses easy
Binary Search easy
Find Minimum in Rotated Sorted Array medium
Koko Eating Bananas medium
Median of Two Sorted Arrays hard
Search a 2D Matrix medium
Search in Rotated Sorted Array medium
Time Based Key-Value Store medium
Add Two Numbers medium
Copy List with Random Pointer medium
Find the Duplicate Number medium
Linked List Cycle easy
LRU Cache medium
Merge K Sorted Lists hard
Merge Two Sorted Lists easy
Remove Nth Node From End medium
Reorder List medium
Reverse Linked List easy
Reverse Nodes in k-Group hard