Accenture coding interview questions

42 DSA problems tagged as asked at Accenture, with statements, examples and constraints — practise free on CampusCode.

7. Move Zeros to End Easy Array
8. Rotate Array by K Steps Easy Array
12. Intersection of Two Arrays Easy Array
15. Single Number (XOR Trick) Easy Array
16. Plus One Easy Array
18. Contains Duplicate Easy Array
19. Best Time to Buy and Sell Stock Easy Array
25. Squares of a Sorted Array Easy Array
45. Count Good Pairs Easy Array
54. Max Consecutive Ones Easy Array
64. Subarray Sum Equals K Medium Array
74. Maximum Subarray (Kadane's Algorithm) Medium Array
93. 4Sum Medium Array
100. Maximum Width Ramp Medium Array
109. Largest Rectangle in Histogram Medium Array
172. Find the Difference (One Extra Character) Easy String
174. String Compression (Run-Length Encoding) Easy String
189. Largest Odd Number in String Easy String
207. Largest Number (Array to String Sort) Easy String
221. Letter Combinations of a Phone Number (Count) Medium String
228. Find All Anagrams in a String (Count) Medium String
238. String Compression (Length) Medium String
239. Remove K Digits Medium String
242. Sort Characters By Frequency Medium String
247. Largest Number Medium String
263. Shortest Palindrome (Prepend Count) Hard String
315. Remove Nth Node from End of List Easy Linked List
387. Middle of the Linked List Medium Linked List
402. Largest Rectangle in Histogram (Stack) Hard Linked List
427. Search Insert Position Easy Binary Search
482. Koko Eating Bananas Medium Binary Search
594. Next Greater Element I Easy Stack
610. Largest Rectangle in Histogram Medium Stack
619. Sum of Subarray Minimums Medium Stack
641. Perfect Squares Medium Stack
654. Largest Rectangle in Histogram (Optimal) Hard Stack
752. Letter Combinations of a Phone Number Medium Recursion
776. Longest Common Subsequence (Recursive + Memoization) Medium Recursion
777. Longest Increasing Subsequence (Recursive + Memoization) Medium Recursion
900. Binary Tree Right Side View Medium Trees
1115. Climbing Stairs Easy Dynamic Programming
1117. Fibonacci Number (Bottom-Up DP) Easy Dynamic Programming