Loading page...
accenture
https://accenture.comSponsored
Problems
01 MatrixMedium
4mo ago
Array
Dynamic Programming
Breadth-First Search
Matrix
3SumMedium
3mo ago
Array
Two Pointers
Sorting
Add Two NumbersMedium
3mo ago
Linked List
Math
Recursion
4mo ago
Array
Simulation
Prefix Sum
Assign CookiesEasy
5mo ago
Array
Two Pointers
Greedy
Sorting
Array
Math
3mo ago
Array
Dynamic Programming
Binary SearchEasy
3mo ago
Array
Binary Search
Bulb SwitcherMedium
5mo ago
Math
Brainteaser
CandyHard
3mo ago
Array
Greedy
Climbing StairsEasy
4mo ago
Math
Dynamic Programming
Memoization
Coin ChangeMedium
4mo ago
Array
Dynamic Programming
Breadth-First Search
4mo ago
Array
Two Pointers
Greedy
5mo ago
Array
Hash Table
Sorting
3mo ago
Array
Hash Table
Sliding Window
4mo ago
Math
Simulation
3mo ago
Array
Two Pointers
Binary Search
Sorting
Count PrimesMedium
3mo ago
Array
Math
Enumeration
Number Theory
5mo ago
Array
Simulation
Counting
5mo ago
Sponsored
Daily TemperaturesMedium
3mo ago
Array
Stack
Monotonic Stack
Delete and EarnMedium
5mo ago
Array
Hash Table
Dynamic Programming
3mo ago
Database
Depth-First Search
Breadth-First Search
Union Find
Graph
Edit DistanceMedium
5mo ago
String
Dynamic Programming
4mo ago
Math
String
Fibonacci NumberEasy
4mo ago
Math
Dynamic Programming
Recursion
Memoization
Array
Stack
Monotonic Stack
4mo ago
Hash Table
String
Sliding Window
Array
Binary Search
5mo ago
Array
Hash Table
Greedy
Sorting
Find Peak ElementMedium
5mo ago
Array
Binary Search
Array
Hash Table
Sorting
Heap (Priority Queue)
4mo ago
Hash Table
String
Bit Manipulation
Sorting
Two Pointers
String
String Matching
5mo ago
Array
Math
Recursion
Queue
Simulation
4mo ago
Array
Hash Table
String
Backtracking
5mo ago
Hash Table
String
Queue
Counting
Generate ParenthesesMedium
4mo ago
String
Dynamic Programming
Backtracking
Group AnagramsMedium
3mo ago
Array
Hash Table
String
Sorting
Sponsored
Happy NumberEasy
3mo ago
Hash Table
Math
Two Pointers
Accenture Interview Process
The interview process at Accenture typically follows a standard structure designed to assess your technical skills, problem-solving abilities, and cultural fit. While specific rounds may vary by role and level, here is what you can generally expect:
1. Recruiter Screen
A 30-minute call to discuss your background, interests, and the role. Be prepared to talk about your resume and why you want to join Accenture.
2. Technical Screen
One or two coding interviews (45-60 mins) focusing on data structures and algorithms. Often conducted via video call with a shared code editor.
3. Onsite Loop
A series of 3-5 interviews covering coding, system design, and behavioral questions. This is the final and most comprehensive stage.
How to Prepare for Accenture
- Master the Basics:Focus on core data structures (Arrays, Linked Lists, Trees, Graphs) and algorithms (Sorting, Searching, BFS/DFS, Dynamic Programming).
- Practice Problems:Solve the most frequently asked questions for Accenture listed above. Aim to understand the underlying patterns rather than just memorizing solutions.
- System Design:For senior roles, practice designing scalable systems. Understand concepts like load balancing, caching, database sharding, and API design.