Accenture interview experience Real time questions & tips from candidates to crack your interview

Associate Software Engineer

Accenture
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
It is a service-based company with good perks mostly better than other service-based companies, The Average salary is also good and much better than other service-based companies will have better exposure. The interview process was pretty simple first a journal test with the aptitude and 1 coding questions, follows by a technical round then a managerial round, and then you get the final offer.
Application story
Searched through the Accenture site and applied through, got this reference from my friends in college who applied 3 months ago. and once you applied you can't apply within 6 months.
Why selected/rejected for the role?
I was selected as my test and technical went well. I cleared the aptitude test and I almost got feedback that was good, and my managerial round was good asking some basic questions & basic HR questions as well.
Preparation
Duration: 3 Months
Topics: Data Structures, Pointers, OOPS, Aptitude, DBMS.
Tip
Tip

Tip 1 : Data Structure should be clear till hashmaps, graphs & DP are not asked frequently
Tip 2 : Aptitude is important
Tip 3 : Must have 1 Projects

Application process
Where: Other
Eligibility: 7.5 CGPA, 1 development project.
Resume Tip
Resume tip

Tip 1 : 1 Project is necessary
Tip 2 : and should be 1 Pager

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 Minutes
Interview date1 May 2021
Coding problem2

Normal Aptitude questions and 2 Basic Coding Questions.

1. 3Sum

Moderate
15m average time
85% success
0/80
Asked in companies
CiscoMathworksSamsung

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Try solving now

2. Maximum Subarray Sum

Moderate
25m average time
75% success
0/80
Asked in companies
UberTata Consultancy Services (TCS)Dunzo

Given an array of numbers, find the maximum sum of any contiguous subarray of the array.


For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.


Given the array [-5, -1, -8, -9], the maximum sum would be -1.


Follow up: Do this in O(N) time.

Try solving now
02
Round
Easy
Video Call
Duration45 Minutes
Interview date20 May 2021
Coding problem1

Firstly They told me to introduce myself and then asked some DBMS questions and follows by Java questions, & OOPs, and 1 basic data structure question. then some casual talks about my life.

1. Two Stacks

Moderate
15m average time
85% success
0/80
Asked in companies
MicrosoftVisaAccenture

Design a data structure, which represents two stacks using only one array common for both stacks. The data structure should support the following operations:

push1(NUM) - Push ‘NUM’ into stack1.
push2(NUM) - Push ‘NUM’ into stack2.
pop1() - Pop out a top element from stack1 and return popped element, in case of underflow return -1.
pop2() - Pop out a top element from stack2 and return popped element, in case of underflow return -1.

There are 2 types of queries in the input

Type 1 - These queries correspond to Push operation.
Type 2 - These queries correspond to Pop operation.

Note:

1. You are given the size of the array.

2. You need to perform push and pop operations in such a way that we are able to push elements in the stack until there is some empty space available in the array.

3. While performing Push operations, do nothing in the situation of the overflow of the stack.
Try solving now
03
Round
Easy
HR Round
Duration30 Minutes
Interview date4 Jun 2021
Coding problem1

General Discussion and Knowledge are asked as some basic questions about my life

1. Basic HR Questions

Why are you interested in this job?
Would you like to work overtime or odd hours?

why do you want to join Accenture even though you have 3 offers ?

What motivated you to do your job well?

Where do you see yourself in the next 5 years? 

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
company logo
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Accenture
3747 views
1 comments
0 upvotes
company logo
Associate Software Engineer
4 rounds | 10 problems
Interviewed by Accenture
2174 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 11 problems
Interviewed by Accenture
4985 views
1 comments
0 upvotes
company logo
Associate Software Engineer
4 rounds | 3 problems
Interviewed by Accenture
371 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Associate Software Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
5153 views
1 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 5 problems
Interviewed by Tata Consultancy Services (TCS)
3313 views
2 comments
0 upvotes
company logo
Associate Software Engineer
2 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
2362 views
0 comments
0 upvotes