Accenture Coding Interview Questions
We track 139 coding questions asked at Accenture, tagged with the algorithms and concepts they test. The most common: Array, String, Math, Hash Table, Dynamic Programming.
Browse all 139 Accenture questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array19.3%
- String10.2%
- Math9.7%
- Dynamic Programming7.2%
- Hash Table6.6%
- Two Pointers6.3%
- Database5.8%
- Sorting3.4%
- Binary Search3.4%
- Greedy2.6%
- Other (35)25.3%
How many questions involve each concept
Share of all 139 tracked Accenture questions that touch each concept. Questions usually involve several, so these overlap.
- Array50.4%
- String26.6%
- Math21.6%
- Hash Table20.1%
- Dynamic Programming19.4%
- Two Pointers16.5%
- Sorting12.2%
- Binary Search7.9%
- Greedy7.9%
- Breadth-First Search5.8%
- Database5.8%
- Divide and Conquer5.8%
Where Accenture differs from the average company
Concept weight at Accenture relative to the average across all companies we track. Green means Accenture leans on it harder than most.
- Merge Sort3.0×
- Database2.1×
- Bucket Sort2.0×
- Divide and Conquer1.9×
- Heap (Priority Queue)0.47×
- Tree0.47×
- Union-Find0.43×
- Depth-First Search0.35×
Accenture specialties
Concepts that show up at Accenture but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 139 tracked Accenture questions.
- Junior45% (62)
- Mid/Senior47% (66)
- Staff8% (11)
Every concept in Accenture interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 70 | 50.4% | 19.3% |
| String | 37 | 26.6% | 10.2% |
| Math | 30 | 21.6% | 9.7% |
| Hash Table | 28 | 20.1% | 6.6% |
| Dynamic Programming | 27 | 19.4% | 7.2% |
| Two Pointers | 23 | 16.5% | 6.3% |
| Sorting | 17 | 12.2% | 3.4% |
| Binary Search | 11 | 7.9% | 3.4% |
| Greedy | 11 | 7.9% | 2.6% |
| Breadth-First Search | 8 | 5.8% | 1.6% |
| Database | 8 | 5.8% | 5.8% |
| Divide and Conquer | 8 | 5.8% | 1.5% |
| Stack | 8 | 5.8% | 1.7% |
| Matrix | 7 | 5.0% | 1.4% |
| Counting | 6 | 4.3% | 1.1% |
| Linked List | 6 | 4.3% | 1.7% |
| Monotonic Stack | 6 | 4.3% | 1.1% |
| Prefix Sum | 6 | 4.3% | 1.7% |
| Recursion | 6 | 4.3% | 1.5% |
| Simulation | 6 | 4.3% | 1.5% |
| Backtracking | 5 | 3.6% | 1.0% |
| Depth-First Search | 5 | 3.6% | 0.8% |
| Heap (Priority Queue) | 5 | 3.6% | 0.7% |
| Binary Tree | 4 | 2.9% | 0.7% |
| Bit Manipulation | 4 | 2.9% | 1.3% |
| Tree | 4 | 2.9% | 0.7% |
| Sliding Window | 3 | 2.2% | 0.7% |
| Bucket Sort | 2 | 1.4% | 0.2% |
| Enumeration | 2 | 1.4% | 0.5% |
| Memoization | 2 | 1.4% | 0.4% |
| Merge Sort | 2 | 1.4% | 0.3% |
| Number Theory | 2 | 1.4% | 0.3% |
| Queue | 2 | 1.4% | 0.3% |
| String Matching | 2 | 1.4% | 0.5% |
| Union-Find | 2 | 1.4% | 0.3% |
| Binary Search Tree | 1 | 0.7% | 0.1% |
| Brainteaser | 1 | 0.7% | 0.4% |
| Combinatorics | 1 | 0.7% | 0.2% |
| Counting Sort | 1 | 0.7% | 0.1% |
| Graph Theory | 1 | 0.7% | 0.2% |
| Hash Function | 1 | 0.7% | 0.2% |
| Quickselect | 1 | 0.7% | 0.1% |
| Radix Sort | 1 | 0.7% | 0.1% |
| Rolling Hash | 1 | 0.7% | 0.2% |
| Trie | 1 | 0.7% | 0.2% |
Practice a Accenture interview
Take a realistic AI-led mock interview with questions Accenture actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required