Accenture Interview Questions, Process, and Tips

The questions listed here are of the exact same pattern that I had in my paper: -----/

Q1. This part was exactly the same pattern as this youtube video. The last part of the assessment was difficult as you were given a topic and you were supposed to speak on it: -----
Add your answer

Q1. Like every other interview, it started with “Introduce Yourself”, where I described how I have explored my different interests during my college life. I also spoke about my technical skills in my introduct...read more
Add your answer
Q2. What do your professors say about you?
Add your answer
Q3. What is your Family background?
Add your answer
Q4. What is one problem you faced and turned it into an opportunity?
Add your answer
Q5. When was the time when you felt unsuccessful and what did you learn?
Add your answer
Q6. What challenges did you face while working in a team and how did you resolve it?
Add your answer
Q7. Interpersonal qualities required for team work
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

It was a Aptitude Round with 5 Section viz - 
1. General English 
2. Maths
3. Pseudo Code
4. Operating System 
5. Microsoft Office Tools related questions

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Firstly they ask you questions about your resume. And then they give you one coding problem to solve and explain.
The timing of the interview will specified to you through mail a day before your interview. Mine was on afternoon.
The interviewer was also very calm and nice.

It was really Tough and hard .. subjective based question

Q1. B2B market trade channels
Add your answer
Q2. Project details on marketing done in MBa
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The test was scheduled from 10:30 am to 12:00 pm. It was conducted via Secure Exam Browser. The instructions for the same were given before hand and the test link was sent in the mail. You needed to have webcam and mic on during the entire process. The test was well proctored and there were no lags/ server issues on their side.

Round duration - 45 minutes
Round difficulty - Easy

This was the coding round which happened just after the MCQ round. The people who had cleared the previous round were sent the link for further test. The timing was 12:15pm to 1:00 pm. It was conducted on the same environment SEB.

Q1. 
Extract Characters at Prime Indices
Given a string 'STR' of length 'N', return a new string containing all characters that are located at prime indices in the original string. Ensure that the order of cha...read more
Add your answer
Q2. 
Equilibrium Indices in a Sequence
You are given an array/list named 'SEQUENCE', which consists of 'N' integers. The task is to identify all equilibrium indices in this sequence.
Explanation:
An equilibr...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

We were asked to choose a slot and I chose evening 5:30 pm. The duration was variable but no one had an interview of more than 1 hour. There were two interviewers. Both of them were very nice and polite.

Q1. 
LCA of Three Nodes Problem Statement
You are given a Binary Tree with 'N' nodes where each node contains an integer value. Additionally, you have three integers, 'N1', 'N2', and 'N3'. Your task is to find...read more
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

The test was in the morning from 10:00 to 12:00. It was a two-round test. There was a 45-minute MCQ-based Technical and Cognitive Assessment Round. Only those candidates who cleared this round could sit in the next round, a 45-minute coding test. There was a sectional cutoff that needed to be cleared in order to proceed to the coding round. The CoCubes test platform was fairly easy to understand and user-friendly.
The coding round was fairly simple. It had two very easy array-based questions.

Q1. 
Prime Numbers Identification
Given a positive integer N, your task is to identify all prime numbers less than or equal to N.
Explanation:
A prime number is a natural number greater than 1 that has no po...read more
Ans. 
I used the Sieve of Eratosthenes. Created a sieve array whose size was equal to the maximum number in the array given. Then filled the sieve using the algorithm.
Answered Anonymously
Add your answer
Q2. 
Subarray With Given Sum Problem Statement
Given an array ARR of N integers and an integer S, determine if there exists a contiguous subarray within the array with a sum equal to S. If such a subarray exis...read more
Ans. 
I wrote a simple O(n) solution
Answered Anonymously
Add your answer

Round duration - 25 Minutes
Round difficulty - Easy

This was a Technical + HR interview. It was in the afternoon around 12 pm. As the role was Data Engineer intern, the interviewer wanted to know whether or not I had built some projects related to this field. Most of the interview went by him asking questions based on my projects. First I was asked to explain about a project then a lot of follow-up questions were asked.

Round duration - 120 Minutes
Round difficulty - Easy

Aptitude+Coding
Both the rounds were easy only student should have confidence in himself.
Coding Round 3 question-:
1.Array related
2.Level order traversal
3. Graph

Q1. 
Sum At Kth Level
Given the root of a binary tree, calculate the sum of all nodes located at the Kth level from the top. Consider the root node as level 1, and each level beneath it sequentially increases ...read more
Ans. Inorder Traversal.
The idea is to do an inorder traversal of the tree, and at each level, we go down, reduce K by 1, and all the states where K = 1, add that node's value in our answer, and recursively do this for all the nodes at Kth level.
 
The steps are as follows: 
• If the ‘root’ is NULL return 0, since that node does not exist.
• If K is equal to 1, then return current nodes data because the given node is at th...read more
Answered Anonymously
Add your answer
Q2. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. Brute Force Approach
1. Create a nested loop. The outer loop will go from i = 0 to i = n - k. This will cover the starting indices of all k-subarrays
2. The inner loop will go from j = i to j = i + k - 1. This will cover all the elements of the k-subarray starting from index i
3. Keep track of the maximum element in the inner loop and print it.
Space Complexity: O(1)Explanation:
O(1) because the extra space being used (looping vari...read more
Answered Anonymously
Add your answer
Q3. 
Number of Triangles in an Undirected Graph
Determine how many triangles exist in an undirected graph. A triangle is defined as a cyclic path of length three that begins and ends at the same vertex.
Input...read more
Ans. Brute Force
We call a cycle triangle if its length is 3. So all we need to do is find three vertices such that they all share an edge with each other. In order to find that cycle, we can fix three-pointer ‘i’ , ‘j’ , ‘k’.
If there is an Edge between (i, j), (j, k), and (k, i) then we will add this cycle to our answer.
Algorithm : 
• Initialize first pointer ‘i’ with 0 value, it will loop till ‘V’ where V is the number o...read more
Answered Anonymously
Add your answer