Deloitte Coding Interview Questions
We track 41 coding questions asked at Deloitte, tagged with the algorithms and concepts they test. The most common: Array, String, Hash Table, Dynamic Programming, Sorting.
Browse all 41 Deloitte questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array17.9%
- String12.2%
- Database12.2%
- Math7.9%
- Hash Table7.0%
- Dynamic Programming6.2%
- Two Pointers6.1%
- Sorting4.8%
- Stack4.3%
- Divide and Conquer2.7%
- Other (20)18.5%
How many questions involve each concept
Share of all 41 tracked Deloitte questions that touch each concept. Questions usually involve several, so these overlap.
- Array48.8%
- String34.1%
- Hash Table22.0%
- Dynamic Programming17.1%
- Sorting17.1%
- Two Pointers17.1%
- Math14.6%
- Database12.2%
- Divide and Conquer12.2%
- Stack12.2%
- Greedy9.8%
- Binary Search7.3%
Where Deloitte differs from the average company
Concept weight at Deloitte relative to the average across all companies we track. Green means Deloitte leans on it harder than most.
- Merge Sort10.0×
- Database4.5×
- Divide and Conquer3.4×
- Stack1.7×
- Prefix Sum0.81×
- Greedy0.77×
- Heap (Priority Queue)0.73×
- Binary Search0.70×
Deloitte specialties
Concepts that show up at Deloitte but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 41 tracked Deloitte questions.
- Junior41% (17)
- Mid/Senior51% (21)
- Staff7% (3)
Every concept in Deloitte interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 20 | 48.8% | 17.9% |
| String | 14 | 34.1% | 12.2% |
| Hash Table | 9 | 22.0% | 7.0% |
| Dynamic Programming | 7 | 17.1% | 6.2% |
| Sorting | 7 | 17.1% | 4.8% |
| Two Pointers | 7 | 17.1% | 6.1% |
| Math | 6 | 14.6% | 7.9% |
| Database | 5 | 12.2% | 12.2% |
| Divide and Conquer | 5 | 12.2% | 2.7% |
| Stack | 5 | 12.2% | 4.3% |
| Greedy | 4 | 9.8% | 2.3% |
| Binary Search | 3 | 7.3% | 2.1% |
| Counting | 2 | 4.9% | 1.1% |
| Heap (Priority Queue) | 2 | 4.9% | 1.1% |
| Merge Sort | 2 | 4.9% | 1.0% |
| Monotonic Stack | 2 | 4.9% | 1.0% |
| Prefix Sum | 2 | 4.9% | 1.3% |
| Simulation | 2 | 4.9% | 1.4% |
| Binary Indexed Tree | 1 | 2.4% | 0.3% |
| Bit Manipulation | 1 | 2.4% | 0.6% |
| Breadth-First Search | 1 | 2.4% | 0.8% |
| Linked List | 1 | 2.4% | 0.6% |
| Memoization | 1 | 2.4% | 0.8% |
| Ordered Set | 1 | 2.4% | 0.3% |
| Queue | 1 | 2.4% | 0.6% |
| Quickselect | 1 | 2.4% | 0.5% |
| Segment Tree | 1 | 2.4% | 0.3% |
| Sliding Window | 1 | 2.4% | 0.8% |
| Trie | 1 | 2.4% | 0.8% |
| Union-Find | 1 | 2.4% | 0.8% |
Practice a Deloitte interview
Take a realistic AI-led mock interview with questions Deloitte actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required