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

SDE - 1

Accenture
upvote
share-icon
3 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 5 Months
Topics: Data Structure, Algorithms, OOPS, Front and back end developing
Tip
Tip

Tip 1 : Soft skills are the key
Tip 2 : Resume should be representable
Tip 3 : Do projects

Application process
Where: Campus
Eligibility: 7.5 CGPa
Resume Tip
Resume tip

Tip 1 : Resume should be representable
Tip 2 : You should be thorough with everything you mention on the resume

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date9 Nov 2021
Coding problem1

It was a 90 minutes MCQ + coding test. There were 15 MCQs and 3 coding questions. I remember only one.

1. Robot Grid

Moderate
35m average time
65% success
0/80
Asked in companies
AmazonMicrosoftAccenture

Consider a grid consisting of ‘N’ rows and ‘M’ columns. Rows are numbered from 0 to ‘N’-1 and columns are numbered from 0 to ‘M’-1. The cell at the intersection of the ith row and the jth column is represented as (i, j).

Initially a robot is standing at (0, 0). The robot can only move in two directions, ‘Right’ and ‘Down’. I.e if the robot is at (r, c), then it can move to (r, c+1) or (r+1, c). Some cells in the grid are blocked i.e robot cannot step on them.

You are given a matrix ‘GRID[][]’ of size N*M, where GRID[i][j] = 1 if cell (i, j) is blocked otherwise cell (i, j) = 0. Your task is to find the lexicographically smallest path for the robot from (0, 0) to (N-1, M-1). A path is represented as a list of cells in the same order in which the robot should visit. See the example for more clarity.

Note

1. In lexicographical order cell (r1, c1) comes before cell (r2, c2) if either r1 < r2 or (r1 = r2 and c1 < c2).

2. If there is no possible path,  then return a list with a single element [-1, -1].

3. It is guaranteed that cell (0, 0) is not blocked.  

Example:

Consider the following  3*4 grid -:
       [ 
         [0 0 0 0]
         [1 1 0 0]
         [0 1 1 0]
       ] 
There are two possible paths to reach cell (2, 3) from (0, 0).
Path-1 ->  [[0, 0], [0, 1], [0, 2], [0, 3], [1, 3], [2, 3]]
Path-2 ->  [[0, 0], [0, 1], [0, 2], [1, 2], [1, 3], [2, 3]]
Clearly, Path-1 is lexicographically smaller than Path-2.
Thus  we should return list  [[0, 0], [0, 1], [0, 2], [0, 3], [1, 3], [2, 3]]
Try solving now
02
Round
Medium
Online Coding Test
Duration90 Minutes
Interview date22 Jun 2022
Coding problem1

It was 90 minutes coding test that consisted of 3 coding questions. I remember only one.

1. Best Time to Buy and Sell Stock

Moderate
20m average time
80% success
0/80
Asked in companies
NoBrokerIntuitOptum

You are given an array/list 'prices' where the elements of the array represent the prices of the stock as they were yesterday and indices of the array represent minutes. Your task is to find and return the maximum profit you can make by buying and selling the stock. You can buy and sell the stock only once.

Note:

You can’t sell without buying first.
For Example:
For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.
Try solving now
03
Round
Easy
HR Round
Duration30 minutes
Interview date22 Jun 2022
Coding problem1

It was held in the afternoon from 2 pm onwards. It was of 30 minutes

1. Basic HR Questions

They majorly asked question from project work.

Why should we hire you?

Problem approach

Tip 1 : Be thorough with your CV
Tip 2 : Be confident about your project work
Tip 3 : Don't lie in the resume

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
SDE - 1
2 rounds | 3 problems
Interviewed by Accenture
1512 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Accenture
1204 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by Accenture
1089 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Accenture
3901 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
6877 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
6240 views
3 comments
0 upvotes