Accenture Interview Experience for Trainee
Online Coding Test
Process: Shortlisted candidates undergo an online coding test that consists of problems with two different levels of difficulty. The performance in this test determines eligibility for different compensation packages.
Purpose: To evaluate candidates’ coding skills and problem-solving abilities.
Sample Questions:
- Level 1:
- Write a program to check if a given string is a palindrome.
- Implement a function to find the greatest common divisor (GCD) of two numbers.
- Level 2:
- Write a program to find the shortest path in a maze using breadth-first search (BFS).
- Implement a function to sort an array using quicksort and discuss its time complexity.
Technical Interview (First Round – Easy to Medium Difficulty)
Process: Candidates who clear the coding test proceed to the first technical interview with a member of the Accenture engineering team.
Purpose: To assess candidates’ technical proficiency in data structures, algorithms, and basic programming concepts.
Sample Questions:
- Data Structures: Explain the difference between an array and a linked list. Provide examples of when to use each.
- Algorithms: Write a function to merge two sorted linked lists.
- Problem-Solving: Given an array of integers, write a function to move all zeroes to the end while maintaining the relative order of the other elements.
- Basic Programming: Describe the principles of object-oriented programming (OOP) and give an example in Java or Python.
Technical Interview (Second Round – Easy to Medium Difficulty)
Process: Candidates who pass the first technical interview undergo a second technical interview with another member of the Accenture engineering team.
Purpose: To further evaluate candidates’ technical capabilities, understanding of core concepts, and ability to apply knowledge to solve more complex problems.
Sample Questions:
- Advanced Data Structures: Describe how a hash table works and implement basic operations (insert, search, delete) for a hash table.
- Algorithms: Explain the concept of dynamic programming and solve a problem such as the 0/1 knapsack problem.
- Problem-Solving: Write a function to find all permutations of a given string.
- System Design: Design a simple library management system and discuss the data structures and algorithms you would use.