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

Analyst Trainee

Deloitte
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 month
Topics: Data Structures & Algorithm, OOPs, Projects mentioned in resume, Cloud Computing, SQL
Tip
Tip

Tip 1 : Practice a variety of questions based on Data Structures & Algorithms so that you feel confident on the day of interview.
Tip 2 : Update your CV/Resume in accordance to job desciption .
Tip 3 : Make sure you go through your projects that you mentioned on your CV/Resume prior to interview.

Application process
Where: Referral
Eligibility: No backlogs , CGPA above 7.5
Resume Tip
Resume tip

Tip 1 : Mention some good development projects that you are confident upon fully and make sure you mention some github link to that project.
Tip 2 : Update your CV as per job description

Interview rounds

01
Round
Hard
Online Coding Interview
Duration150 minutes
Interview date5 Apr 2022
Coding problem2

This round consisted of 90 mcq questions from a variety of topics including aptitude, programming logic, cloud computing, computer networking and the time alloted was 60 minutes. Then we moved to coding part were 2 medium-hard level questions were asked. In order to clear the exam you have to pass all the test cases.

1. Maximum sum rectangle

Easy
15m average time
85% success
0/40
Asked in companies
OptumGojekAdobe

You are given a matrix ‘ARR’ with ‘N’ rows and ‘M’ columns. Your task is to find the maximum sum rectangle in the matrix.

Maximum sum rectangle is a rectangle with the maximum value for the sum of integers present within its boundary, considering all the rectangles that can be formed from the elements of that matrix.

For Example
Consider following matrix:

The rectangle (1,1) to (3,3) is the rectangle with the maximum sum, i.e. 29.

Problem approach

The given problem can be solved using recursion by diving the probelm in to various ssub-problems, but their may be cases of solving the same sub problem again. This indicates the problem to be a DP ( Dynamic Programming ) problem using memoization. 

Step1: Intialize a dp matrix of size m x n and intialize it to -1 and a count variable to 0.
Step 2: If memo[i][j] != -1, return the result.
Step 3: Since dp[i][j] tells how many paths are there until cordinates i,j that may be one position before our boundary(let say at x-1), the ways of reaching the boundary(say x) is the path from all the four directions i.e. i-1,j i+1,j, i,j-1,i,j+1 and decrement no.of moves.
Step 4: Store the updated result in a temporary lets call it temp and store the result till x position in that.
Step 5: Increment the count variable if no.of moves becomes 0.
Step 6: At Last, return the count of path and store it in memo array.

Try solving now

2. Sort An Array According To The Count Of Set Bits

Moderate
25m average time
80% success
0/80
Asked in companies
AdobeAmazonSamsung

You are given an array consisting of N positive integers, and your task is to sort the array in decreasing order of count of set bits in the binary representation of the integers present in the array.

In other words, you have to modify the array such that an integer with more number of set bits should appear before the integer which has lesser number of set bits in its binary representation.

The number of set bits is nothing but the number of 1s present in the binary representation of the integer. For example, the number of set bits in 5(0101) is equal to 2.

Note :

1. If any two numbers have the same count of set bits, then in the sorted array they will appear in the order in which they appear in the original array. For example, let the array be { 2, 4, 3}, in this case, both 2 and 4 have the same number of set bits so the answer will be {3, 2, 4} and not {3, 4, 2}, because in the original array 2 appears before 4.

2. The array may contain duplicate elements.
Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date16 May 2022
Coding problem1

The interviewer started with my introduction and asked in which language was i comfortable with. Then he directly jumped to the coding part were he asked me to share my screen and code some coding questions based on DS and Algorithm. The platform had a build in compiler. The interviewer asked me to optimize my code. When he was satisfied, he moved to the projects that i mentioned in my resume and the minor project i did in college. The Interview was around 45mins to 1 hr .

1. Split String

Easy
0/40
Asked in companies
QuikrAmazonUnacademy

You are given a string ‘str’ of even length. Your task is to find out if we divide the ‘str’ from the middle, will both the substrings contain an equal number of vowels or not.

For Example:
You are given, ‘str’= ‘codingninjas’, when we split this string we get, ‘coding’ and ‘ninjas’ which both contain 2 vowels each. Hence the answer is ‘True’.
Problem approach

1. First I split the array using the split function wherever there was a comma.
2. Converted it into Integer(Type Casting).
3. Made a helper function and build the logic for perfect square.
4. Stored into an array and then returned it.

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

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
Product Engineering Intern
2 rounds | 5 problems
Interviewed by Deloitte
855 views
0 comments
0 upvotes
company logo
Analyst Trainee
2 rounds | 3 problems
Interviewed by Deloitte
954 views
0 comments
0 upvotes
company logo
Analyst Trainee
2 rounds | 2 problems
Interviewed by Deloitte
345 views
0 comments
0 upvotes
company logo
Analyst Trainee
2 rounds | 4 problems
Interviewed by Deloitte
382 views
0 comments
0 upvotes