Built for the round that actually screens you outCoding interview practice,
Coding interview practice,
with a copilot that explains.
Run real test cases, reveal solutions brute-force → optimal, and get AI feedback on your own code.
Activity
Last 18 weeks
LessMore
Easy0/20
Medium0/46
Hard0/3
0 / 69
Problems solved
Start your streak today
Study plans
Problems0 solved
- Two SumArrayHash Table41.2k52%Easy
- Valid ParenthesesStringStack23.8k41%Easy
- Contains DuplicateArrayHash Table11.4k61%Easy
- Best Time to Buy and Sell StockArrayDynamic Programming31.9k54%Easy
- Valid AnagramStringHash TableSorting9.8k64%Easy
- Maximum SubarrayArrayDynamic Programming33.1k50%Medium
- Binary SearchArrayBinary Search12.7k58%Easy
- Climbing StairsDynamic ProgrammingMath19.5k52%Easy
- Merge IntervalsArrayIntervalsSorting21.3k47%Medium
- Group AnagramsStringHash TableSorting18.2k67%Medium
- Number of IslandsGraphDepth-First SearchArray27.6k58%Medium
- Invert Binary TreeTreeDepth-First Search14.1k76%Easy
- Product of Array Except SelfArrayPrefix Sum24.8k65%Medium
- Maximum Product SubarrayArrayDynamic Programming19.1k35%Medium
- Find Minimum in Rotated Sorted ArrayArrayBinary Search14.2k49%Medium
- Search in Rotated Sorted ArrayArrayBinary Search26.3k40%Medium
- 3SumArrayTwo PointersSorting31.2k35%Medium
- Container With Most WaterArrayTwo PointersGreedy29.4k56%Medium
- Longest Consecutive SequenceArrayHash TableUnion Find20.1k47%Medium
- Sum of Two IntegersMathBit Manipulation5.4k51%Medium
- Number of 1 BitsBit ManipulationDivide and Conquer6.1k70%Easy
- Counting BitsDynamic ProgrammingBit Manipulation9.7k76%Easy
- Missing NumberArrayMathBit Manipulation10.2k64%Easy
- Reverse BitsBit ManipulationDivide and Conquer4.3k60%Easy
- Single NumberArrayBit Manipulation13.8k71%Easy
- Insert IntervalArrayIntervals14.6k42%Medium
- Non-overlapping IntervalsArrayIntervalsGreedy9.4k51%Medium
- Meeting RoomsArrayIntervalsSorting4.3k56%Easy
- Meeting Rooms IIArrayIntervalsHeap8.7k50%Medium
- Spiral MatrixArrayMatrixSimulation13.8k49%Medium
- Rotate ImageArrayMatrixMath17.2k73%Medium
- Set Matrix ZeroesArrayMatrixHash Table13.1k55%Medium
- Word SearchArrayMatrixBacktracking15.4k44%Medium
- Course ScheduleGraphDepth-First SearchBreadth-First Search16.2k47%Medium
- Number of Connected Components in an Undirected GraphGraphUnion FindDepth-First Search5.4k62%Medium
- Graph Valid TreeGraphUnion FindDepth-First Search4.1k48%Medium
- Pacific Atlantic Water FlowGraphDepth-First SearchBreadth-First Search8.7k56%Medium
- Top K Frequent ElementsArrayHash TableHeap16.8k63%Medium
- Kth Largest Element in an ArrayArrayHeapDivide and Conquer16.4k67%Medium
- Coin ChangeArrayDynamic ProgrammingBreadth-First Search18.9k45%Medium
- Longest Increasing SubsequenceArrayDynamic ProgrammingBinary Search20.4k52%Medium
- Longest Common SubsequenceStringDynamic Programming11.2k58%Medium
- Word BreakHash TableStringDynamic Programming16.1k46%Medium
- House RobberArrayDynamic Programming21.5k50%Medium
- House Robber IIArrayDynamic Programming9.1k42%Medium
- Decode WaysStringDynamic Programming12.3k35%Medium
- Unique PathsMathDynamic ProgrammingCombinatorics16.8k64%Medium
- Jump GameArrayDynamic ProgrammingGreedy17.6k38%Medium
- Combination SumArrayBacktracking18.2k69%Medium
- Longest Substring Without Repeating CharactersHash TableStringSliding Window41.8k35%Medium
- Longest Repeating Character ReplacementHash TableStringSliding Window9.6k53%Medium
- Minimum Window SubstringHash TableStringSliding Window18.2k41%Hard
- Valid PalindromeTwo PointersString9.1k47%Easy
- Longest Palindromic SubstringTwo PointersStringDynamic Programming30.2k34%Medium
- Palindromic SubstringsTwo PointersStringDynamic Programming9.4k68%Medium
- Reverse Linked ListLinked ListRecursion22.1k76%Easy
- Maximum Depth of Binary TreeTreeDepth-First SearchBinary Tree11.8k75%Easy
- Merge Two Sorted ListsLinked ListRecursion21.3k65%Easy
- Remove Nth Node From End of ListLinked ListTwo Pointers16.8k47%Medium
- Reorder ListLinked ListTwo PointersStack12.4k56%Medium
- Merge k Sorted ListsLinked ListDivide and ConquerHeap (Priority Queue)19.5k51%Hard
- Same TreeTreeDepth-First SearchBinary Tree9.2k62%Easy
- Binary Tree Level Order TraversalTreeBreadth-First SearchBinary Tree12.1k65%Medium
- Validate Binary Search TreeTreeDepth-First SearchBinary Search Tree14.8k33%Medium
- Subtree of Another TreeTreeDepth-First SearchBinary Tree7.3k46%Easy
- Kth Smallest Element in a BSTTreeDepth-First SearchBinary Search Tree9.6k71%Medium
- Lowest Common Ancestor of a Binary Search TreeTreeDepth-First SearchBinary Search Tree8.7k64%Medium
- Binary Tree Maximum Path SumTreeDepth-First SearchDynamic Programming16.2k40%Hard
- Construct Binary Tree from Preorder and Inorder TraversalArrayHash TableDivide and Conquer13.4k64%Medium