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

Technology Analyst

Deloitte
upvote
share-icon
3 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Data Structures, Algorithms, DBMS, SQL, Computer Networks, Aptitude
Tip
Tip

Tip 1 : Have a good practice of aptitude and English paragraph questions
Tip 2 : Be thorough with the projects you mention in your resume. Right from tech stack used to how you used and its impact
Tip 3 : Express your thought process while solving any problem clearly

Application process
Where: Campus
Eligibility: Above 7 CGPA, No backlogs
Resume Tip
Resume tip

Tip 1 : Mention projects that are done by you(at least two)
Tip 2 : Not more than 1-page long resume

Interview rounds

01
Round
Medium
Online Coding Interview
Duration75 minutes
Interview date24 Jul 2019
Coding problem0

It was an approximately 75-minute long online assessment round on the Amcat platform. The entire round was MCQ based. 

 

There were 4 sections- Aptitude, English paragraphs, Reasoning, Computer Science fundamentals on Software Engineering, HTML/ CSS etc.

 

  • The aptitude section included most of the questions from profit-loss, compound interest and percentage.
     
  • In the English paragraph section, there were around 3 paragraphs given and then a few questions needed to be answered based on the paragraph.  
     
  • The Computer Science section was very simple and just fundamentals were asked like output of applying given CSS to an HTML div. Some straightforward Software Engineering questions like coupling v/s cohesion.
     
  • The reasoning section was also not very tricky. Traditional reasoning problems like find the missing number in the pattern or identify the missing pattern from a given set of images.
02
Round
Medium
Group Discussion
Duration45 minutes
Interview date29 Jul 2019
Coding problem0

It was a group discussion round but with a slight variation. All 10 of us were given 1 common topic and then were sub-divided into small groups of 2-3. Then we discussed points within our sub-group for 10 minutes. After that each one of us was given 5 minutes to note down in bullet points about our view on the topic and submit it. Then each one of us went in front of everyone and explained our points as written in our note submitted earlier to everyone in the room. We were allowed to speak only for 2 minutes.
After everyone was done, the interviewer of the discussion master explained his thought process and explained how he would have approached the topic. He was quite motivating and explained us about the role in general. 3 folks out of this 10 people group were selected for the next round. It was quite a good experience and a healthy discussion on the topic.

03
Round
Easy
Face to Face
Duration45 minutes
Interview date29 Jul 2019
Coding problem2

This was the last round and first face to face, 2 on 1(meaning 2 interviewers and 1 interviewee) technical interview. They started with a basic intro and straightforward deep-dived into projects. They asked about the tech stack used and questions around those tech stacks. In my case, I was asked to write SQL queries on various scenarios. I was also asked DBMS problems like 2-NF and 3-NF. One simple data structure question on arrays was also asked to me. However, they did focus on optimizing my code.

1. Given an array, print all pairs that exist with a given sum, if any.

Easy
15m average time
90% success
0/40
Asked in companies
Media.netExpedia GroupQuikr

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.

Note:

Each pair should be sorted i.e the first value should be less than or equals to the second value. 

Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Problem approach

Method 1 : Use STL map to keep a track of elements in the array, and to check if a pair exists.
Method 2 : Sort the array, and use two pointer approach i.e. two pointers one from both the ends.

Try solving now

2. DBMS Question

What is BCNF?

Problem approach

Be thorough with the DBMS normalization and ACID properties.

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
Technology Analyst
2 rounds | 2 problems
Interviewed by Deloitte
0 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 2 problems
Interviewed by Deloitte
1415 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Deloitte
1408 views
0 comments
0 upvotes
company logo
Product Engineering Intern
2 rounds | 5 problems
Interviewed by Deloitte
855 views
0 comments
0 upvotes