Accenture Data Engineering Intern Interview Questions, Process, and Tips

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.

Q1. MCQ's
There were 6 sections in which MCQ was divided.
Section 1- English and Verbal Reasoning (17 Questions)
Section 2 - Quantitative Reasoning (12 Questions)
Section 3 - Numerical Ability (15 Questions)
Sectio...read more
View 2 more answers

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. Print characters at prime indices
You are given a string 'STR' of length 'N'. You need to return a string that will contain all the characters present at the prime indices of the original s...read more
Ans. 
First I tried to solve by creating an isPrime boolean function which would check if each index is prime or not. Then I ran a loop for all indices and calculated the sum. This gave TLE. Then I created a boolean array to keep a track of all the prime elements and applied the Sieve of Eratosthenes method to calculate the prime indices and then compute the result.
Answered by CodingNinjas
View 2 more answers
Q2. Equilibrium indices of a Sequence
You have been given an array/list 'SEQUENCE' denoting the sequence of 'N' integers. Your task is to find the equilibrium indices of the sequence in 'SE...read more
Ans. 
Tried a basic approach to a two-pass solution. First calculated left sum starting from index 0 to index mid. Then calculated the right sum in a similar fashion from the last index to mid+1. Optimized the code using 2 pointer technique.
Answered by CodingNinjas
View 3 more answers

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
You have been given a Binary Tree of 'N' nodes where the nodes have integer values and three integers 'N1', 'N2', and 'N3'. Find the LCA(Lowest Common Anc...read more
Ans. 
They asked me the approach. I did it just as I learned on Coding Ninjas. Create a path from the root to the node. Create a recursive function to find descendant at distance k below from a given node. Use this function for all elements in the path you found out.
Answered by CodingNinjas
View 2 more answers