Accenture coding interview questions
Ranked by how often candidates report them. Each opens in the editor with hidden tests, an animated walkthrough and solutions in four languages; a question you solve once counts for every company that asks it.
| Progress | Title | Difficulty | Next step |
|---|---|---|---|
| Two SumTwo Sum | Easy | Solve | |
| Best Time to Buy and Sell StockState Machine DP - Stock Problems | Easy | Solve | |
| Subarray Sum Equals KPrefix Sum Strategy | Medium | Solve | |
| Palindrome NumberMath / Number Theory | Easy | Solve | |
| Longest Substring Without Repeating CharactersSliding Window · Variable | Medium | Solve | |
| Majority ElementMoore's Voting Algorithm | Easy | Solve | |
| Reverse IntegerMath / Number Theory | Medium | Solve | |
| Kadane's Algorithm - SimpleKadane's Algorithm | Medium | Solve | |
| Climbing Stairs1D DP | Easy | Solve | |
| Move ZeroesTwo Pointer | Easy | Solve | |
| Container With Most WaterTwo Pointer | Medium | Solve | |
| Rotate ArrayDouble Reversal Trick | Medium | Solve | |
| Koko Eating BananasBinary Search on Answer Space | Medium | Solve | |
| 3SumTwo Sum | Medium | Solve | |
| Remove Duplicates from Sorted ArrayTwo Pointer | Easy | Solve | |
| Letter Combinations of a Phone NumberChoice per Position | Medium | Solve | |
| Number of IslandsConnected Components | Medium | Solve | |
| Intersection of Two ArraysTwo Pointer | Easy | Solve | |
| Median of Two Sorted ArraysBinary Search on Partition | Hard | Solve | |
| Merge IntervalsBasics | Medium | Solve | |
| Max Consecutive OnesSliding Window · Variable | Easy | Solve | |
| Contains Duplicate IISliding Window · Fixed | Easy | Solve | |
| Remove Nth Node From End of ListFront Back Pointer | Medium | Solve | |
| 4SumTwo Pointer | Medium | Solve | |
| Next PermutationRight to Left Traversal | Medium | Solve | |
| Longest Palindromic SubstringStrings | Medium | Solve | |
| Merge Sorted ArrayTwo Pointer | Easy | Solve | |
| Pascal's Triangle1D DP | Easy | Solve | |
| Find Peak ElementUnique 1-D Binary Search | Medium | Solve | |
| Happy NumberSlow Fast Pointers | Easy | Solve | |
| Count PrimesMath / Number Theory | Medium | Solve | |
| Contains DuplicateHash Set Lookup | Easy | Solve | |
| Valid AnagramHashing | Easy | Solve | |
| Fibonacci Number1D DP | Easy | Solve | |
| Kth Largest Element in an ArrayTop K / Kth Largest / Smallest | Medium | Solve | |
| Middle of the Linked ListSlow Fast Pointers | Easy | Solve | |
| Search Insert PositionBisect | Easy | Solve | |
| Sort Characters By FrequencyTop K / Kth Largest / Smallest | Medium | Solve | |
| Trapping Rain WaterTwo Pointer | Hard | Solve | |
| String CompressionTwo Pointer | Medium | Solve | |
| LRU CacheLinked Lists | Medium | Solve | |
| Roman to IntegerRight to Left Traversal | Easy | Solve | |
| Longest Common PrefixString Basics | Easy | Solve | |
| Reverse Words in a StringDouble Reversal Trick | Medium | Solve | |
| Single NumberMissing / Repeated Numbers | Easy | Solve | |
| Add Two NumbersDummy Node Pattern | Medium | Solve | |
| Valid ParenthesesStack Basics | Easy | Solve | |
| Product of Array Except SelfRight to Left Traversal | Medium | Solve |
No questions match these filters.
Questions people ask
What coding questions does Accenture ask most?
Two Sum, Best Time to Buy and Sell Stock, Subarray Sum Equals K, Palindrome Number, Longest Substring Without Repeating Characters, Majority Element, Reverse Integer, Kadane's Algorithm - Simple.
Which topics come up in Accenture coding rounds?
arrays, strings, math, two pointers, hashing, dynamic programming.
How hard are Accenture coding questions?
Of the reported questions, 22 are easy, 24 medium and 2 hard. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.