WorkspaceProblems
THE PROBLEM LIBRARY

Find your next breakthrough.

51 interactive problems across five levels. Every pointer, every decision, every step.

51 problemsLEARN · VISUALIZE · PRACTICE
01
Longest Substring Without Repeating Charactersstrings · sliding window
Medium Visualize
02
Two Sumarrays · hashmap
Easy Visualize
03
Binary Searcharrays · binary search
Easy Visualize
04
Valid Parenthesesstrings · stack
Easy Visualize
05
Reverse Linked Listlinked list
Easy Visualize
06
Maximum Depth of Binary Treetrees · recursion
Easy Visualize
07
Number of Islandsgraphs · dfs
Medium Visualize
08
Coin Changedynamic programming
Medium Visualize
09
Valid Palindrometwo pointers · strings
Easy Visualize
10
Move Zeroesarrays · two pointers
Easy Visualize
11
Range Sum Queriesprefix sum · arrays
Easy Visualize
12
Daily Temperaturesstack · arrays
Medium Visualize
13
Generate Parenthesesbacktracking · recursion
Medium Visualize
14
Subsetsbacktracking · recursion
Medium Visualize
15
Binary Tree Inorder Traversaltrees · stack
Easy Visualize
16
Validate Binary Search Treebinary search tree · trees
Medium Visualize
17
Kth Largest Elementheap priority queue · arrays
Medium Visualize
18
Find if Path Existsdfs · graphs
Easy Visualize
19
Course Scheduletopological sort · graphs
Medium Visualize
20
Shortest Path in a Gridbfs · shortest path
Medium Visualize
21
Climbing Stairsdynamic programming
Easy Visualize
22
House Robberdynamic programming · arrays
Medium Visualize
23
Merge Intervalsintervals · sorting
Medium Visualize
24
Single Numberbit manipulation · arrays
Easy Visualize
25
Contains Duplicatehashset · arrays
Easy Visualize
26
Valid Anagramhashmap · strings
Easy Visualize
27
Container With Most Watertwo pointers · arrays
Medium Visualize
28
Maximum Sum of Size Ksliding window · arrays
Easy Visualize
29
Find Pivot Indexprefix sum · arrays
Easy Visualize
30
Search Insert Positionbinary search · arrays
Easy Visualize
31
Next Greater Elementstack · arrays
Medium Visualize
32
Permutationsbacktracking · arrays
Medium Visualize
33
Counting Bitsbit manipulation · arrays
Easy Visualize
34
Jump Gamegreedy · arrays
Medium Visualize
35
Longest Increasing Subsequencedynamic programming · arrays
Medium Visualize
36
Insertion Sortsorting · arrays
Easy Visualize
37
Squares of a Sorted Arraytwo pointers · arrays
Easy Visualize
38
Minimum Size Subarray Sumsliding window · arrays
Medium Visualize
39
Subarray Sum Equals Kprefix sum · hashmap
Medium Visualize
40
Longest Consecutive Sequencehashset · arrays
Medium Visualize
41
Search in Rotated Sorted Arraybinary search · arrays
Medium Visualize
42
Simplify Unix Pathstack · strings
Medium Visualize
43
Combination Sumbacktracking · arrays
Medium Visualize
44
Unique Grid Pathsdynamic programming · arrays
Medium Visualize
45
Non-overlapping Intervalsintervals · greedy
Medium Visualize
46
Happy Numberfast slow pointers
Easy Visualize
47
Count Connected Componentsunion find · graphs
Medium Visualize
48
Prefix Word Countstrie · strings
Medium Visualize
49
Network Delay Timedijkstra · graphs
Medium Visualize
50
Sliding Window Maximumdeque · arrays
Medium Visualize
51
Unweighted Graph Distancesbfs · graphs
Medium Visualize