Learning to pass
the interview
Structured prep covering the data structures and algorithms big-tech interviews expect. Interactive visualizations, a Python playground, AI-powered feedback, and progress tracking.
Google Interview Readiness
Start practicing to build your score
Try it now - no signupTwo Sum · easy
Solve a real Google interview question, right here
Given an array of integers `nums` and an integer `target`, return the indices of the two numbers that add up to `target`. Each input has exactly one solution. You may not use the same element twice.
Real Python, real tests - it all runs in your browser.
Run your code to see output
Not sure where to start?
Follow the skill tree - learn concepts in the right order with prerequisites mapped out.
Arrays & Strings
avg O(n)space O(1)
Linked Lists
avg O(n)space O(1)
Stacks & Queues
avg O(1)space O(n)
Hash Tables
avg O(1)space O(n)
Binary Trees
avg O(log n)space O(h)
Graphs
avg O(V + E)space O(V + E)
Heaps / Priority Queues
avg O(log n)space O(n)
Tries
avg O(m)space O(n * m)
Sorting
avg O(n log n)space O(log n)
Binary Search
avg O(log n)space O(1)
Recursion & Backtracking
avg O(2^n)space O(n)
Dynamic Programming
avg O(n^2)space O(n)
BFS & DFS
avg O(V + E)space O(V)
Greedy Algorithms
avg O(n log n)space O(1)
Big-O Notation
avg N/Aspace N/A
System Design Basics
avg O(1)space O(n)