Accenture coding interview
questions, leaked.
111 problems reported across recent Accenture interviews. Top patterns: array, math, string. The list below is what most candidates actually saw, plus the honest play if you can't grind all of it.
Accenture's assessment is heavy on arrays and light on trees. You're looking at 111 total problems, with 56 easy and 50 medium scattered across a narrow skill set. Arrays dominate at 55% of the list, so your prep time should follow that ratio. Math problems (28 reported) trend medium-to-hard and often hide as brainsteasers like Bulb Switcher. If you blank on a pattern during the live assessment, StealthCoder runs invisibly and surfaces a working solution in seconds, no proctor visibility.
Top problems at Accenture
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Bulb Switcher | MEDIUM | 100.0 | 54% | Math · Brainteaser |
| 02 | Happy Number | EASY | 99.0 | 58% | Hash Table · Math · Two Pointers |
| 03 | Two Sum | EASY | 95.7 | 56% | Array · Hash Table |
| 04 | Best Time to Buy and Sell Stock | EASY | 92.0 | 55% | Array · Dynamic Programming |
| 05 | Climbing Stairs | EASY | 92.0 | 54% | Math · Dynamic Programming · Memoization |
| 06 | Palindrome Number | EASY | 85.8 | 59% | Math |
| 07 | Rotate Array | MEDIUM | 84.0 | 43% | Array · Math · Two Pointers |
| 08 | Maximum Subarray | MEDIUM | 79.9 | 52% | Array · Divide and Conquer · Dynamic Programming |
| 09 | Delete and Earn | MEDIUM | 79.9 | 57% | Array · Hash Table · Dynamic Programming |
| 10 | Roman to Integer | EASY | 79.9 | 65% | Hash Table · Math · String |
| 11 | Sum of Values at Indices With K Set Bits | EASY | 77.6 | 86% | Array · Bit Manipulation |
| 12 | Find Subsequence of Length K With the Largest Sum | EASY | 77.6 | 46% | Array · Hash Table · Sorting |
| 13 | Permutation Difference between Two Strings | EASY | 77.6 | 87% | Hash Table · String |
| 14 | Minimum Right Shifts to Sort the Array | EASY | 77.6 | 57% | Array |
| 15 | Ant on the Boundary | EASY | 77.6 | 74% | Array · Simulation · Prefix Sum |
| 16 | Maximum Area of Longest Diagonal Rectangle | EASY | 77.6 | 37% | Array |
| 17 | Count Tested Devices After Test Operations | EASY | 77.6 | 78% | Array · Simulation · Counting |
| 18 | Longest Common Prefix | EASY | 75.0 | 45% | String · Trie |
| 19 | Longest Palindromic Substring | MEDIUM | 75.0 | 36% | Two Pointers · String · Dynamic Programming |
| 20 | Reverse Integer | MEDIUM | 75.0 | 30% | Math |
| 21 | Largest Number | MEDIUM | 75.0 | 41% | Array · String · Greedy |
| 22 | Merge Sorted Array | EASY | 75.0 | 53% | Array · Two Pointers · Sorting |
| 23 | Spiral Matrix | MEDIUM | 72.1 | 54% | Array · Matrix · Simulation |
| 24 | Majority Element | EASY | 68.9 | 66% | Array · Hash Table · Divide and Conquer |
| 25 | Sort Integers by The Number of 1 Bits | EASY | 68.9 | 79% | Array · Bit Manipulation · Sorting |
| 26 | Perfect Squares | MEDIUM | 68.9 | 56% | Math · Dynamic Programming · Breadth-First Search |
| 27 | Find Peak Element | MEDIUM | 68.9 | 47% | Array · Binary Search |
| 28 | Reverse Words in a String | MEDIUM | 68.9 | 52% | Two Pointers · String |
| 29 | 3Sum | MEDIUM | 68.9 | 37% | Array · Two Pointers · Sorting |
| 30 | Longest Substring Without Repeating Characters | MEDIUM | 68.9 | 37% | Hash Table · String · Sliding Window |
| 31 | Shortest Palindrome | HARD | 68.9 | 41% | String · Rolling Hash · String Matching |
| 32 | Integer Break | MEDIUM | 65.1 | 61% | Math · Dynamic Programming |
| 33 | Valid Parentheses | EASY | 65.1 | 42% | String · Stack |
| 34 | Valid Anagram | EASY | 65.1 | 67% | Hash Table · String · Sorting |
| 35 | Fibonacci Number | EASY | 60.7 | 73% | Math · Dynamic Programming · Recursion |
| 36 | Product of Array Except Self | MEDIUM | 60.7 | 68% | Array · Prefix Sum |
| 37 | Add Two Numbers | MEDIUM | 60.7 | 46% | Linked List · Math · Recursion |
| 38 | Container With Most Water | MEDIUM | 60.7 | 58% | Array · Two Pointers · Greedy |
| 39 | Plus One | EASY | 60.7 | 48% | Array · Math |
| 40 | Remove Duplicates from Sorted Array | EASY | 60.7 | 60% | Array · Two Pointers |
| 41 | Koko Eating Bananas | MEDIUM | 55.3 | 49% | Array · Binary Search |
| 42 | Pascal's Triangle | EASY | 55.3 | 77% | Array · Dynamic Programming |
| 43 | Reverse Vowels of a String | EASY | 55.3 | 58% | Two Pointers · String |
| 44 | Assign Cookies | EASY | 55.3 | 54% | Array · Two Pointers · Greedy |
| 45 | Nth Digit | MEDIUM | 55.3 | 36% | Math · Binary Search |
| 46 | House Robber | MEDIUM | 55.3 | 52% | Array · Dynamic Programming |
| 47 | Coin Change | MEDIUM | 55.3 | 46% | Array · Dynamic Programming · Breadth-First Search |
| 48 | Count Primes | MEDIUM | 55.3 | 35% | Array · Math · Enumeration |
| 49 | Find First and Last Position of Element in Sorted Array | MEDIUM | 55.3 | 47% | Array · Binary Search |
| 50 | Merge Intervals | MEDIUM | 55.3 | 49% | Array · Sorting |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Accenture OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array61 · 55%
- math28 · 25%
- string27 · 24%
- hash table23 · 21%
- dynamic programming22 · 20%
- two pointers21 · 19%
- sorting18 · 16%
- binary search12 · 11%
- breadth first search6 · 5%
- matrix5 · 5%
The distribution is deceptive. Easy problems outnumber medium by a small margin, but don't let that false comfort fool you. Arrays, math, and strings make up 72% of what they ask. Two Sum, Best Time to Buy and Sell Stock, and Climbing Stairs appear frequently, but the real trap is math-heavy problems disguised as simulations or brainsteasers. Dynamic programming shows up in 22 problems but rarely as a hard problem, so you can solve most of these with iteration and memoization, not recursion. Hash tables and two-pointers are your second line. If you've drilled arrays well but haven't touched a DP problem, StealthCoder is your hedge when an easy problem turns out to need state tracking.
Companies with similar patterns
If you prepped for Accenture, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Accenture.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Accenture interview FAQ
Should I focus on arrays first?+
Yes. 61 of 111 problems involve arrays. Get comfortable with two-pointer traversal, prefix sums, and rotation patterns. Best Time to Buy and Sell Stock and Rotate Array are your baseline. Skip deep tree or graph work unless you have extra time.
Do I need to prepare math problems?+
Yes, but differently. 28 math problems are mostly easy, but Bulb Switcher and similar brainsteasers require pattern spotting, not heavy computation. Practice Palindrome Number and Roman to Integer to build intuition. Don't grind advanced number theory.
Is dynamic programming required?+
It appears in 22 problems, but most are solvable with greedy or iterative approaches first. Climbing Stairs and Maximum Subarray are entry-level DP. You don't need recursion. Focus on recognizing when a problem asks you to track state, not on complex recursion trees.
What's the hardest part of this assessment?+
Only 5 problems are marked hard, so the difficulty cliff is flat. The trap is time pressure on strings and hash tables after you've spent energy on array variants. Practice Permutation Difference between Two Strings and Delete and Earn to stay sharp on less obvious patterns.
How long should I spend prepping?+
Drill arrays and math problems first, then hash tables and two-pointers. That covers 75% of the list. If you have a week, spend 5 days on arrays and math, 2 days on everything else. Don't memorize. Understand rotation, prefix sums, and state tracking.