Accenture interview experience Real time questions & tips from candidates to crack your interview
Associate Software Engineer
Accenture
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 Months
Topics: Data Structures, Pointers, OOPS, Algorithms, Dynamic Programming, My SQL, Database, Operating System
Tip 1 : Practice Atleast 250 Questions on GFG/Leetcode
Tip 2 : For DSA questions in interviews, start explaining from the brute force approach and then move to the optimal one. Convey your thought process to the interviewers, so that they can help you out if you get stuck.
Tip 3 : Do not write anything that you are not confident of in resume
Tip 4 : Do atleast 2 projects
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1 : Try to include at least one development project in your resume.
Tip 2 : Interviewer will ask anything from your resume so be prepared for it.
Tip 3 : Don't mention some random projects which you are not sure about or copied from Google or somewhere else.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 Minutes
Interview date5 Oct 2021
Coding problem2
MCQs- Aptitude + Quantitative ( if we clear this round then only we can go for coding round).
2 questions were asked in the coding round.
1. Add Two Numbers As Linked Lists
Moderate
20m average time
80% success
0/80
Asked in companies
You are given two non-negative numbers 'num1' and 'num2' represented in the form of linked lists.
The digits in the linked lists are stored in reverse order, i.e. starting from least significant digit (LSD) to the most significant digit (MSD), and each of their nodes contains a single digit.
Calculate the sum of the two numbers and return the head of the sum list.
Example :
Input:
'num1' : 1 -> 2 -> 3 -> NULL
'num2' : 4 -> 5 -> 6 -> NULL
Output: 5 -> 7 -> 9 -> NULL
Explanation: 'num1' represents the number 321 and 'num2' represents 654. Their sum is 975.
Problem approach
Approach: Traverse both lists to the end and add preceding zeros in the list with lesser digits. Then call a recursive function on the start nodes of both lists which calls itself for the next nodes of both lists till it gets to the end. This function creates a node for the sum of the current digits and returns the carry.
The steps are:
1. Traverse the two linked lists in order to add preceding zeros in case a list is having lesser digits than the other one.
2. Start from the head node of both lists and call a recursive function for the next nodes.
3. Continue it till the end of the lists.
4. Creates a node for current digits sum and returns the carry.
2. Maximum Subarray Sum
Moderate
35m average time
81% success
0/80
Asked in companies
You are given an array 'arr' of length 'n', consisting of integers.
A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.
Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.
The sum of an empty subarray is 0.
Example :
Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]
Output: 11
Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Problem approach
I did it using Kadane’s Algorithm
The simple idea of Kadane’s algorithm is to look for all positive contiguous segments of the array (max_ending_here is used for this). And keep track of maximum sum contiguous segment among all positive segments (max_so_far is used for this). Each time we get a positive sum compare it with max_so_far and update max_so_far if it is greater than max_so_far
02
Round
Easy
HR Round
Duration25 Minutes
Interview date5 Nov 2021
Coding problem1
Basic Hr questions were asked and Interviewer asked me about my projects.
1. Basic HR questions
What are your future goals?
Tell me about your short term and long-term goals.
Why do you want to join accenture?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
To make an AI less repetitive in a long paragraph, you should increase:
Choose another skill to practice
Similar interview experiences
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Accenture
Selected 
3747 views
1 comments
0 upvotes
Associate Software Engineer
4 rounds | 10 problems
Interviewed by Accenture
Selected 2174 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 11 problems
Interviewed by Accenture
Rejected
4985 views
1 comments
0 upvotes
Associate Software Engineer
4 rounds | 3 problems
Interviewed by Accenture
Rejected
371 views
0 comments
0 upvotes
Companies with similar interview experiences
Associate Software Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 5154 views
1 comments
0 upvotes
Associate Software Engineer
3 rounds | 5 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 3313 views
2 comments
0 upvotes
Associate Software Engineer
2 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 2363 views
0 comments
0 upvotes