•PRACTICE
DSA Question Tracker & Breakdowns
The problems top tech companies actually ask, each with a full breakdown, diagrams and code. Tick them off as you go, or browse by topic.
433problems
32companies
39topics
3languages each
Companies
Topics
✓ 0ProblemsDifficultyAsked atPractice
Medium


+13
Medium


+2
Hard


+4
Medium


+1
2858.Minimum Edge Reversals So Every Node Is Reachable
HardDynamic ProgrammingDepth-First SearchBreadth-First Search
2035.Partition Array Into Two Arrays to Minimize Sum Difference
HardArrayBinary SearchDynamic Programming
Hard
Medium

Medium
Medium
Medium
Hard

Hard
Easy

1438.Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
MediumArrayQueueSliding Window
Medium

Easy
Medium
Hard

Hard
Medium
Medium
Medium
Medium
Medium

Hard

Medium

Medium


+1
Medium
Medium
Medium
Medium
1434.Number of Ways to Wear Different Hats to Each Other
HardArrayDynamic ProgrammingBit Manipulation
Medium
Medium
Practice with a Mock Interview
Solve these problems under real interview pressure with our AI interviewer.
Start Mock Interview →