Accenture logo

Accenture DSA Interview Questions

Appearing for Accenture's mass-hiring drive — coding assessment, technical interview, or off-campus placement — in 2026? This DSA sheet is built specifically around Accenture's standardized coding rounds, where the focus stays on solid fundamentals in arrays, strings, and basic logic-building rather than hard-level algorithmic tricks. Accenture's technical rounds typically pair a coding round with questions on OOP concepts, basic DBMS, and simple pattern-based problems, since thousands of freshers move through the same assessment pipeline every hiring cycle. This sheet compiles 54 of the most frequently asked Accenture interview and coding-round questions from LeetCode and GeeksforGeeks, tagged by topic, difficulty, and candidate-reported popularity — a fast, focused way to prep for Accenture's high-volume campus and off-campus hiring process.

54 Problems
0%

Overall Progress

0/54

1. Two Sum
LeetCode•
•
Very Hot
2. Palindrome Number
LeetCode•
•
Hot
3. Roman to Integer
LeetCode•
•
Warm
4. Valid Parentheses
LeetCode•
•
Hot
5. Remove Duplicates from Sorted Array
LeetCode•
•
Warm
6. Search Insert Position
LeetCode•
•
Warm
7. Maximum Subarray
LeetCode•
•
Hot
8. Plus One
LeetCode•
•
Warm
9. Climbing Stairs
LeetCode•
•
Hot
10. Merge Sorted Array
LeetCode•
•
Warm
11. Pascal's Triangle
LeetCode•
•
Warm
12. Best Time to Buy and Sell Stock
LeetCode•
•
Hot
13. Single Number
LeetCode•
•
Warm
14. Majority Element
LeetCode•
•
Hot
15. Contains Duplicate
LeetCode•
•
Warm
16. Move Zeroes
LeetCode•
•
Warm
17. Valid Anagram
LeetCode•
•
Warm
18. Reverse String
LeetCode•
•
Warm
19. First Unique Character in a String
LeetCode•
•
Warm
20. Longest Common Prefix
LeetCode•
•
Warm
21. Fizz Buzz
LeetCode•
•
Hot
22. Power of Two
LeetCode•
•
Warm
23. Missing Number
LeetCode•
•
Hot
24. Reverse Linked List
LeetCode•
•
Hot
25. Merge Two Sorted Lists
LeetCode•
•
Warm
26. Linked List Cycle
LeetCode•
•
Warm
27. Middle of the Linked List
LeetCode•
•
Warm
28. Binary Tree Inorder Traversal
LeetCode•
•
Warm
29. Maximum Depth of Binary Tree
LeetCode•
•
Warm
30. Symmetric Tree
LeetCode•
•
Warm
31. Binary Tree Level Order Traversal
LeetCode•
•
Warm
32. Flood Fill
LeetCode•
•
Warm
33. Number of Islands
LeetCode•
•
Warm
34. Fibonacci Number
LeetCode•
•
Hot
35. House Robber
LeetCode•
•
Warm
36. Coin Change
LeetCode•
•
Warm
37. Implement Queue using Stacks
LeetCode•
•
Warm
38. Merge Intervals
LeetCode•
•
Warm
39. Rotate Array
LeetCode•
•
Warm
40. Check for Balanced Parentheses in an Expression
GeeksforGeeks•
•
Hot
41. Print Pattern - Pyramid of Numbers
GeeksforGeeks•
•
Very Hot
42. Check Whether a Number is Palindrome or Not
GeeksforGeeks•
•
Hot
43. Program to Check Armstrong Number
GeeksforGeeks•
•
Hot
44. Check for Prime Number
GeeksforGeeks•
•
Hot
45. Factorial of a Number
GeeksforGeeks•
•
Hot
46. GCD and LCM of Two Numbers
GeeksforGeeks•
•
Warm
47. Sorting Algorithms - Bubble, Selection, Insertion Sort
GeeksforGeeks•
•
Very Hot
48. OOP Concepts - Inheritance and Polymorphism
GeeksforGeeks•
•
Hot
49. Count Number of Vowels and Consonants in a String
GeeksforGeeks•
•
Warm
50. Check if Two Strings are Anagrams
GeeksforGeeks•
•
Warm
51. Find the Kth Smallest Element in an Unsorted Array
GeeksforGeeks•
•
Warm
52. Longest Common Subsequence
GeeksforGeeks•
•
Warm
53. Detect Cycle in a Directed Graph
GeeksforGeeks•
•
Warm
54. Basic SQL Query Concepts - Joins and Normalization
GeeksforGeeks•
•
Warm