Turing Coding Interview Questions
We track 38 coding questions asked at Turing, tagged with the algorithms and concepts they test. The most common: Array, String, Dynamic Programming, Hash Table, Binary Search.
Browse all 38 Turing questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array26.3%
- String12.1%
- Dynamic Programming11.2%
- Hash Table8.6%
- Binary Search4.2%
- Greedy3.7%
- Sorting3.4%
- Two Pointers3.1%
- Math2.9%
- Enumeration2.6%
- Other (19)22.0%
How many questions involve each concept
Share of all 38 tracked Turing questions that touch each concept. Questions usually involve several, so these overlap.
- Array68.4%
- String28.9%
- Dynamic Programming26.3%
- Hash Table26.3%
- Binary Search10.5%
- Greedy10.5%
- Sorting10.5%
- Counting7.9%
- Divide and Conquer7.9%
- Enumeration7.9%
- Math7.9%
- Two Pointers7.9%
Where Turing differs from the average company
Concept weight at Turing relative to the average across all companies we track. Green means Turing leans on it harder than most.
- Enumeration4.3×
- Divide and Conquer2.9×
- Trie2.6×
- Counting2.4×
- Matrix0.61×
- Math0.52×
Turing specialties
Concepts that show up at Turing but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 38 tracked Turing questions.
- Junior29% (11)
- Mid/Senior58% (22)
- Staff13% (5)
Every concept in Turing interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 26 | 68.4% | 26.3% |
| String | 11 | 28.9% | 12.1% |
| Dynamic Programming | 10 | 26.3% | 11.2% |
| Hash Table | 10 | 26.3% | 8.6% |
| Binary Search | 4 | 10.5% | 4.2% |
| Greedy | 4 | 10.5% | 3.7% |
| Sorting | 4 | 10.5% | 3.4% |
| Counting | 3 | 7.9% | 2.4% |
| Divide and Conquer | 3 | 7.9% | 2.3% |
| Enumeration | 3 | 7.9% | 2.6% |
| Math | 3 | 7.9% | 2.9% |
| Two Pointers | 3 | 7.9% | 3.1% |
| Graph Theory | 2 | 5.3% | 1.5% |
| Matrix | 2 | 5.3% | 1.4% |
| Prefix Sum | 2 | 5.3% | 2.0% |
| Sliding Window | 2 | 5.3% | 1.5% |
| Stack | 2 | 5.3% | 2.2% |
| Trie | 2 | 5.3% | 1.3% |
| Union-Find | 2 | 5.3% | 1.2% |
| Bit Manipulation | 1 | 2.6% | 0.7% |
| Breadth-First Search | 1 | 2.6% | 0.5% |
| Depth-First Search | 1 | 2.6% | 0.5% |
| Hash Function | 1 | 2.6% | 0.4% |
| Heap (Priority Queue) | 1 | 2.6% | 0.5% |
| Quickselect | 1 | 2.6% | 0.5% |
| Recursion | 1 | 2.6% | 0.9% |
| Rolling Hash | 1 | 2.6% | 0.4% |
| Simulation | 1 | 2.6% | 0.9% |
| String Matching | 1 | 2.6% | 0.9% |
Practice a Turing interview
Take a realistic AI-led mock interview with questions Turing actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required