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

Associate Software Engineer

Accenture
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
Application Development & Maintenance, Code testing and debugging, Working with global teams, Typical Selection Process, Cognitive & Technical Assessment, Cognitive: English ability, critical thinking, problem-solving, Technical: Basic coding, fundamentals, Coding Round, 2 coding questions (easy–medium), Communication Assessment, Read aloud, sentence construction, fluency, Technical Interview, Programming concepts, OOPs, DBMS, basics of cloud, HR Discussion
Application story
I applied for the Associate Software Engineer role to begin my career in a reputed company with a strong focus on technology and professional growth. I prepared thoroughly—revising my programming fundamentals, practicing SQL, and solving coding problems daily. I also worked on improving my communication skills and took mock assessments. Although I couldn’t clear the final round, it was a valuable learning experience. It helped me identify areas for improvement, particularly in time-bound problem-solving and articulating my thought process more effectively. I am now using this experience to further strengthen my skills so I’ll be better prepared for future opportunities.
Why selected/rejected for the role?
Couldn’t explain core concepts confidently (OOP, DBMS, basic coding). Gave vague answers to project questions and couldn’t justify technical choices.
Preparation
Duration: 1 month
Topics: Data Structures, OOPs, System Design, Algorithms, SQL
Tip
Tip

Tip 1: Master the Basics First.
Tip 2: Practice Mock Assessments.

Application process
Where: Campus
Eligibility: 6.5 CGPA, (Salary Package: 4.5 LPA)
Resume Tip
Resume tip

Tip 1: Keep it One Page.
Tip 2: Use a Simple Format, Avoid Fancy Designs.
Tip 3: Tailor it to the Role.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date7 Sep 2024
Coding problem2

1. Largest Element in the Array

Easy
10m average time
90% success
0/40
Asked in companies
AccentureCognizantMakeMyTrip

Given an array ‘arr’ of size ‘n’ find the largest element in the array.


Example:

Input: 'n' = 5, 'arr' = [1, 2, 3, 4, 5]

Output: 5

Explanation: From the array {1, 2, 3, 4, 5}, the largest element is 5.
Problem approach

Step 1: Initialize the maximum
Assume the first element is the maximum:
max_num = arr[0]

Step 2: Loop through the array
Start from index 1 and compare each element with max_num.

Step 3: Update the maximum if needed
If the current element is greater, update max_num.

Step 4: Return the maximum

Try solving now

2. Even Number Counter

Easy
0/40
Asked in company
Accenture

You are given an array arr of n integers. Your task is to count how many of these integers are even.


Problem approach

Step 1: Initialize a counter
Set count = 0

Step 2: Loop through each element
For each num in arr:

Step 3: Check if the number is even
Use the modulus operator:
if num % 2 == 0:

Step 4: Increment the counter
If even, increment count += 1

Step 5: Return the counter

Try solving now
02
Round
Easy
Video Call
Duration30 minutes
Interview date24 Sep 2024
Coding problem2

1. Remove Duplicates

Easy
15m average time
80% success
0/40
Asked in companies
CIS - Cyber InfrastructureTata Consultancy Services (TCS)PayPal

Ninja is playing with numbers but hates when he gets duplicate numbers. Ninja is provided an array, and he wants to remove all duplicate elements and return the array, but he has to maintain the order in which the elements were supplied to him.

Problem approach

Step 1: Initialize an empty set to store seen elements
seen = set()

Step 2: Initialize an empty list to store unique elements in order
unique = []

Step 3: Loop through the array
For each num in arr:

Step 4: Check if num is already in seen
If not, add num to both seen and unique.

Step 5: Return the list of unique elements

Try solving now

2. FCFS CPU Scheduling

Easy
20m average time
80% success
0/40
Asked in companies
eBayAccenture

You are given the ‘N’ processes with their “burst times”, and the “arrival time” for each process is 0.

Your task is to find the “waiting time” and the “turn-around time” of each process using the ‘FCFS CPU Scheduling’ algorithm.

Note:

The process that comes first will be executed first. 

Assume all the process has arrived at same time and you have to consider the process with low process id to have arrived first.

The next process starts only after the previous gets fully executed.
Try solving now

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)
2363 views
0 comments
0 upvotes