Accenture Data Engineering Intern Interview Questions and Answers

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
Ans. 
The task is to extract characters at prime indices from a given string and return them in the same order.
• Iterate through the string and check if the index is prime.

• Use a helper function to determine if a number is prime.

• Build the new string by appending characters at prime indices.
Answered by AI
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
Ans. 
Identify equilibrium indices in a sequence by finding positions where sum of elements before and after is equal.
• Iterate through the sequence and calculate prefix sum and suffix sum at each index

• Compare prefix sum and suffix sum to find equilibrium indices

• Handle edge cases where no equilibrium index exists

• Return the list of equilibrium indices
Answered by AI
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
Ans. 
Find the Lowest Common Ancestor (LCA) of three nodes in a Binary Tree.
• Traverse the Binary Tree to find the paths from the root to each of the three nodes.

• Compare the paths to find the common ancestor node.

• Return the value of the Lowest Common Ancestor node.
Answered by AI
Add your answer