Accenture coding questions (2026)

By Aayush Kumar Gupta · Last updated 3 Nov 2026 · 100 questions tracked

Short answer: Accenture mostly asks Easy and Medium questions on arrays, strings and hash maps. Do the 10 questions below first. If you can solve them without peeking at a solution, you have covered the kind of problems that show up most.

Accenture takes in a lot of freshers every year, and the coding round is where most people get filtered out. The good part: this list is not scary. It is mostly arrays and strings, and close to 9 out of 10 questions are Easy or Medium.

The 10 to practise first

Sorted by how recently and how often Accenture asked them. The line under each one is the trick that cracks it.

1.
Isomorphic Strings · EasyAsked recently
Keep two maps, s to t and t to s. One map alone misses cases where two letters point to the same letter.
Hash Table, String
2.
Majority Element · EasyAsked recently
Boyer-Moore voting: keep a candidate and a count, add one for a match, subtract one otherwise. O(1) space.
Array, Hash Table, Divide and Conquer
3.
Subarray Sum Equals K · Medium
Prefix sums in a hash map. At each step, count how many earlier prefix sums equal (current sum - k).
Array, Hash Table, Prefix Sum
4.
3Sum · Medium
Sort first. Fix one number, then run two pointers on the rest. Skip duplicates or you'll print the same triplet twice.
Array, Two Pointers, Sorting
5.
Largest Rectangle in Histogram · Hard
Monotonic stack. When a shorter bar comes in, pop the taller ones and work out the area each of them could cover.
Array, Stack, Monotonic Stack
6.
LRU Cache · Medium
Hash map plus a doubly linked list. The map finds the node, the list keeps the order of use. Practise writing the node moves cleanly.
Hash Table, Linked List, Design
7.
Next Permutation · Medium
From the right, find the first number smaller than the one after it, swap it with the next bigger number on its right, then reverse the tail.
Array, Two Pointers
8.
Smallest Divisible Digit Product II · Hard
Break t into the primes 2, 3, 5 and 7 (anything else means no answer). Then build the number greedily from the right, keeping it at least num.
Math, String, Backtracking
9.
Smallest Divisible Digit Product I · Easy
The limits are small, so just try n, n+1, n+2... and check the digit product each time.
Math, Enumeration
10.
Maximum Area of Longest Diagonal Rectangle · Easy
Compare the squared diagonals (no square roots needed). On a tie, keep the larger area.
Array

Want all 100 Accenture questions?

The full list is on the dashboard. You get 2 free company picks: choose Accenture there and the full list opens free for you.

Pick Accenture free 90 more inside

What Accenture asks most

By topic: Array (51%), String (23%), Hash Table (22%), Two Pointers (18%) and Math (15%). By level, 46% of the list is Easy, 43% Medium and 11% Hard. 2 of the 100 were asked in the last 3 months.

Accenture questions by topic

Array (51 of 100)

1.
Sum of Values at Indices With K Set Bits · Easy
Count the set bits of each index (not the value) and add nums[i] when the count equals k.
Array, Bit Manipulation
2.
Ant on the Boundary · Easy
Keep a running sum of the moves. Every time it hits exactly 0, the ant is back on the boundary.
Array, Simulation, Prefix Sum
3.
Count Tested Devices After Test Operations · Easy
You don't need to change the array. Keep a count of tested devices; a device gets tested if its battery minus that count is still above 0.
Array, Simulation, Counting

String (23 of 100)

1.
Permutation Difference between Two Strings · Easy
Store where each letter sits in s, then add up the absolute index differences for each letter in t.
Hash Table, String
2.
Letter Combinations of a Phone Number · Medium
Backtracking: for each digit, try each of its letters and go one level deeper. Handle the empty input.
Hash Table, String, Backtracking
3.
Shortest Palindrome · Hard
Find the longest palindrome that starts at index 0 (KMP on s + '#' + reverse(s)), then add the reversed leftover in front.
String, Rolling Hash, String Matching

Hash Table (22 of 100)

1.
Find Subsequence of Length K With the Largest Sum · Easy
Pick the k largest values along with their indices, then sort those k by index to keep the original order.
Array, Hash Table, Sorting
2.
Intersection of Two Arrays · Easy
Put one array in a set, walk the other, and collect matches into a second set so each value shows up once.
Array, Hash Table, Two Pointers
3.
Contains Duplicate · Easy
Throw everything into a set. If the set is smaller than the array, there's a duplicate.
Array, Hash Table, Sorting

Two Pointers (18 of 100)

1.
Rotate Array · Medium
Reverse the whole array, then reverse the first k and the rest. Take k % n first.
Array, Math, Two Pointers
2.
Remove Duplicates from Sorted Array · Easy
One slow pointer marks where the next unique value goes; the fast pointer scans. Return the slow pointer's count.
Array, Two Pointers
3.
Remove Nth Node From End of List · Medium
Dummy head, then move the fast pointer n steps ahead. Move both until fast reaches the end; slow is just before the node to delete.
Linked List, Two Pointers

Math (15 of 100)

1.
Reverse Integer · Medium
Pop digits with % 10 and build the result, but check for 32-bit overflow before every multiply.
Math
2.
Climbing Stairs · Easy
It's Fibonacci in disguise: ways(n) = ways(n-1) + ways(n-2). Two variables are enough.
Math, DP, Memoization
3.
Count Partitions with Even Sum Difference · Easy
Left minus right is 2*left - total, so it's even only when the total is even. Then every one of the n-1 cuts works.
Array, Math, Prefix Sum

If you only have a week

Arrays are in about half the list. Get two pointers and prefix sums right before you even open DP.
Hash maps keep coming back: Isomorphic Strings, Majority Element, Subarray Sum Equals K. If you are shaky with them, start there.
Only about 1 in 10 questions is Hard. Don't spend your last week on them.
Questions marked "Asked recently" showed up in the last 3 months. Give them a little extra time.

From students who sat the Accenture test

Sat the Accenture test recently? Tell us which questions you got and we will add them here with your name. Share your experience

Common questions

What coding questions does Accenture ask?

Right now the most common ones are Isomorphic Strings, Majority Element and Subarray Sum Equals K. The top 10 above is sorted by how recently and how often each one was asked.

Is the Accenture coding round hard?

Mostly not. In this list, 46% of the questions are Easy, 43% Medium and 11% Hard.

Which topics should I study for Accenture?

Start with Array (51%), String (23%) and Hash Table (22%). Together they cover most of the Accenture list.

Is this the official Accenture question bank?

No. Nobody outside Accenture has that. This list comes from LeetCode company tags, where candidates report the questions they got. Treat it as the best public signal, not a guarantee.

How do I get the full Accenture list?

How this page is made

The question list comes from the company tags on LeetCode, where candidates report the questions they were asked. We sort it by how recently and how often each question came up, and refresh it from the source regularly (this page: 3 Nov 2026). Every question links to the original problem; we don't copy problem statements. The one-line tricks, the topic breakdown and the tips are written and checked by Aayush Kumar Gupta and the Tauzand team. If you spot a mistake, tell us.