Two Sigma Coding Interview Questions
We track 20 coding questions asked at Two Sigma, tagged with the algorithms and concepts they test. The most common: Array, Dynamic Programming, String, Binary Search, Depth-First Search.
Browse all 20 Two Sigma questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array15.3%
- Dynamic Programming9.0%
- String8.1%
- Simulation5.1%
- Math4.8%
- Matrix4.1%
- Depth-First Search3.9%
- Binary Search3.6%
- Hash Table3.4%
- Sorting3.4%
- Other (22)39.4%
How many questions involve each concept
Share of all 20 tracked Two Sigma questions that touch each concept. Questions usually involve several, so these overlap.
- Array55.0%
- Dynamic Programming30.0%
- String25.0%
- Binary Search15.0%
- Depth-First Search15.0%
- Hash Table15.0%
- Math15.0%
- Matrix15.0%
- Simulation15.0%
- Sorting15.0%
- Breadth-First Search10.0%
- Divide and Conquer10.0%
Where Two Sigma differs from the average company
Concept weight at Two Sigma relative to the average across all companies we track. Green means Two Sigma leans on it harder than most.
- Union-Find3.6×
- Divide and Conquer3.1×
- Simulation3.0×
- Recursion2.9×
- Array0.79×
- Two Pointers0.56×
- Hash Table0.51×
Two Sigma specialties
Concepts that show up at Two Sigma but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 20 tracked Two Sigma questions.
- Junior15% (3)
- Mid/Senior55% (11)
- Staff30% (6)
Every concept in Two Sigma interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 11 | 55.0% | 15.3% |
| Dynamic Programming | 6 | 30.0% | 9.0% |
| String | 5 | 25.0% | 8.1% |
| Binary Search | 3 | 15.0% | 3.6% |
| Depth-First Search | 3 | 15.0% | 3.9% |
| Hash Table | 3 | 15.0% | 3.4% |
| Math | 3 | 15.0% | 4.8% |
| Matrix | 3 | 15.0% | 4.1% |
| Simulation | 3 | 15.0% | 5.1% |
| Sorting | 3 | 15.0% | 3.4% |
| Breadth-First Search | 2 | 10.0% | 2.5% |
| Divide and Conquer | 2 | 10.0% | 2.5% |
| Graph Theory | 2 | 10.0% | 2.8% |
| Prefix Sum | 2 | 10.0% | 2.5% |
| Recursion | 2 | 10.0% | 3.2% |
| Two Pointers | 2 | 10.0% | 2.0% |
| Union-Find | 2 | 10.0% | 2.5% |
| Backtracking | 1 | 5.0% | 1.1% |
| Binary Tree | 1 | 5.0% | 1.4% |
| Bit Manipulation | 1 | 5.0% | 1.9% |
| Design | 1 | 5.0% | 1.4% |
| Greedy | 1 | 5.0% | 1.4% |
| Heap (Priority Queue) | 1 | 5.0% | 1.4% |
| Linked List | 1 | 5.0% | 1.4% |
| Merge Sort | 1 | 5.0% | 1.4% |
| Monotonic Queue | 1 | 5.0% | 1.1% |
| Queue | 1 | 5.0% | 1.1% |
| Randomized | 1 | 5.0% | 1.1% |
| Stack | 1 | 5.0% | 2.8% |
| Topological Sort | 1 | 5.0% | 1.4% |
| Tree | 1 | 5.0% | 1.4% |
| Trie | 1 | 5.0% | 1.1% |
Practice a Two Sigma interview
Take a realistic AI-led mock interview with questions Two Sigma actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required