Data Engineering Intern
Accenture
4 rounds | 4 Coding problems
1600 views
Interview preparation journey
Preparation
Duration: 1 month
Topics: Networking, Security and Cloud, Aptitude, Prime number questions, Arrays, Logical and verbal reasoning, Pointers and dynamic memory allocation
Tip

Tip 1 : Prepare latest questions on Networking, Security and cloud as it has a separate section.
Tip 2 : Focus on basic array problems and techniques like prime factorization.
Tip 3 : Practice giving output of pseudocode.

Application process
Where: Campus
Eligibility: 7.5 CGPA, 85% in Class 12th
Resume tip

Tip 1 : Show willingness to work on latest technology like ML and Data Science.
Tip 2 : Show a good track record of academics if applicable.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date5 Nov 2020
Problems1
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)
Section 4 - MS Office and Common applications (16 Questions)
Section 5 - Pseudocode (20 Questions)
Section 6 - Networking, Security and Cloud (10 questions)

02
Round
Easy
Online Coding Interview
Duration45 minutes
Interview date5 Nov 2020
Problems2
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...

view more
Problem approach

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.

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 'SEQUENCE'.

view more
Problem approach

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.

03
Round
Easy
HR Round
Duration20 minutes
Interview date7 Nov 2020
Problems0
04
Round
Medium
Video Call
Duration40 minutes
Interview date9 Nov 2020
Problems1
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...

view more
Problem approach

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.

Start a Discussion
Similar interview experiences
Associate Software Engineer
3 rounds | 3 problems
Interviewed by Accenture
48 views
System Engineer
2 rounds | 3 problems
Interviewed by Accenture
21 views
Associate Software Engineer
2 rounds | 8 problems
Interviewed by Accenture
139 views
Software Engineer
2 rounds | 5 problems
Interviewed by Accenture
26 views
Companies with similar interview experiencs
Data Engineering Intern
3 rounds | 4 problems
Interviewed by Dunzo
230 views