Deloitte

4.0
i
Deloitte overall rating is based on 6.4k company reviews, including all divisions and wholly owned subsidiaries.

Deloitte drives progress. Our firms around the world help clients become leaders wherever they choose to compete. Deloitte invests in outstanding people of diverse talents and backgrounds and empowers them... read more

Is this your company?

Claim Account
Filter interviews by
Designation

Select Designation

Clear

744 results found

Interview Rounds

Coding Test

Assignment

Face to Face

HR

I was interviewed in Nov, 2020.

Interview Questions

  • Q1. Find K’th Character of Decrypted String

    You have been given an Encrypted String where repetitions of substrings are represented as substring followed by the count of substrings.

    Example: String "aabbbcdcdcd" will be encrypted as "a2b3cd3".
    

    You need to find the 'K'th character of Decrypted String. Decrypted String would have 1-based indexing.

    Note :

    Input string will always be lowercase characters without any spaces.
    
    If the count of a substring is 1 then also it will be followed by Integer '1'.
    Example: "aabcdee" will be Encrypted as "a2bcd1e2"
    This means it's guaranteed that each substring is followed by some Integer.
    
    Also, the frequency of encrypted substring can be of more than one digit. For example, in "ab12c3", ab is repeated 12 times. No leading 0 is present in the frequency of substring.
    
    The frequency of a repeated substring can also be in parts.
    Example: "aaaabbbb" can also have "a2a2b3b1" as Encrypted String.
    

    Input format :

    The first line of each test case contains an Encrypted String 'S'. 
    
    The second line contains the integer value 'K'.
    

    Output format :

    For each test case print, the 'K'th character of Decrypted String obtained from Encrypted String 'S'.
    

    Note :

    You are not required to print the output explicitly, it has already been taken care of. Just implement the function.
    

    Constraints :

    2 <= N <= 10^5
    1 <= K <= M
    1 <= M <= 10^18
    
    Where 'N' is the length of String 'S' and 'M' is the length of the Decrypted String of 'S'. 
    All the characters of String 'S' are lowercase English letters.
    
    Time Limit: 1sec
    
  • Q2. Cycle Detection In Undirected Graph

    You have been given an undirected graph with 'N' vertices and 'M' edges. The vertices are labelled from 1 to 'N'.

    Your task is to find if the graph contains a cycle or not.

    A path that starts from a given vertex and ends at the same vertex traversing the edges only once is called a cycle.

    Example :

    In the below graph, there exists a cycle between vertex 1, 2 and 3. 
    

    Example

    Note:

    1. There are no parallel edges between two vertices.
    
    2. There are no self-loops(an edge connecting the vertex to itself) in the graph.
    
    3. The graph can be disconnected.
    

    For Example :

    Input: N = 3 , Edges =  [[1, 2], [2, 3], [1, 3]].
    Output: Yes
    
    Explanation : There are a total of 3 vertices in the graph. There is an edge between vertex 1 and 2, vertex 2 and 3 and vertex 1 and 3. So, there exists a cycle in the graph. 
    
    Input Format:
    The first line of input contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.
    
    The first line of each test case contains two single space-separated integers ‘N’ and ‘M’ representing the total number of vertices and edges, respectively.
    
    The next ‘M’ lines contain two single space-separated integers representing an edge of the graph.
    
    Output Format:
    For each test case, the only line of output will return “Yes” if there exists a cycle in the graph. Else print “No”.
    
    Note:
    You are not required to print the expected output, it has already been taken care of. Just implement the function.
    
    Constraints:
    1 <= T <= 10
    1 <= N <= 5000
    0 <= M <= min(5000, (N * (N - 1)) / 2)
    1 <= edges[i][0] <= N 
    1 <= edges[i][1] <= N 
    
    Time Limit: 1 sec 
    
  • Q3. Pair Sum

    You are given an array/list ‘ARR’ consisting of ‘N’ distinct integers arranged in ascending order. You are also given an integer ‘TARGET’. Your task is to count all the distinct pairs in ‘ARR’ such that their sum is equal to ‘TARGET’.

    Note:

    1. Pair (x,y) and Pair(y,x) are considered as the same pair. 
    
    2. If there exists no such pair with sum equals to 'TARGET', then return -1.
    

    Example:

    Let ‘ARR’ = [1 2 3] and ‘TARGET’ = 4. Then, there exists only one pair in ‘ARR’ with a sum of 4 which is (1, 3). (1, 3) and (3, 1) are counted as only one pair.
    
    Input Format:
    The first line of input contains an integer ‘T’ which denotes the number of test cases. 
    
    The first line of each test case contains two single space-separated integers ‘N’ and ‘TARGET’ representing the number of elements in the array/list ‘ARR’ and the required pair-sum respectively.
    
    The next line of each test case contains ‘N’ single space-separated integers denoting the elements of  ‘ARR’.
    
    Output Format :
    For each test case, return the numbers of pairs in  ‘ARR’ whose sum is equal to ‘TARGET’.
    
    Note:
    You don't need to print anything, it has already been taken care of. Just implement the given function.
    
    Constraints:
    1 <= ‘T’ <= 100
    2 <= ‘N’ <= 5000
    1 <= ‘ARR[i]’, ‘TARGET’ <= 10^5
    
    Where ARR[i]’ represents the elements of array/list ‘ARR’. 
    
    Time Limit: 1 sec
    
  • Q4. Next smaller Palindrome

    You are given a number 'N' in the form of a string 'S', which is a palindrome. You need to find the greatest number strictly less than 'N' which is also a palindrome.

    Note:
    1. A palindrome is a word, number, phrase, or another sequence of characters that reads the same backward as forward, such as madam, racecar, 1234321, etc.
    2. The numerical value of the given string S will be greater than 0.
    3. A single-digit number is also considered a palindrome.
    4. The answer number should not contain any leading zeros, except for the case when the answer is 0.
    5. Note that the length of the string is nothing but the number of digits in N.
    
    Input Format:
    The first line of the input contains an integer T denoting the number of test cases.
    
    The first and the only line of each test case contains a string 'S', denoting the number whose next smaller palindrome is to be found.
    
    Output Format:
    The only line of output of each test case should contain a string, denoting the next smaller palindrome of 'S'.
    
    Output for each test case will be printed in a separate line.
    
    Note:
    You do not need to print anything, it has already been taken care of. Just implement the given function.
    
    Constraints:
    1 <= T <= 100
    1 <= |S| <= 10^4
    
    Where |S| donates the size of string 'S'.
    
    Time Limit: 1sec
    
  • Q5. Longest Common Subsequence

    You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

    A String ‘a’ is a subsequence of a String ‘b’ if ‘a’ can be obtained from ‘b’ by deletion of several (possibly, zero or all) characters. A common subsequence of two Strings is a subsequence that is common to both Strings.

    Input Format :
    The first line contains an integer ‘T’ denoting the number of test cases. Then each test case follows. 
    
    The first input line of each test case contains two space-separated Strings “STR1” and “STR2” representing two Strings. 
    
    Output Format :
    For each test case, print the length of the longest common subsequence. 
    
    Print the output of each test case in a separate line. 
    
    Note:
    You are not required to print the expected output; it has already been taken care of. Just implement the function. 
    
    Constraints :
    1 <= T <= 50 
    1 <= |STR1| <= 10^2
    1 <= |STR2| <= 10^2
    
    Where |STR1| and |STR2| denote the length of “STR1” and “STR2” respectively. 
    
    Time Limit: 1 sec 
    
  • Q6. Boundary Traversal

    You have been given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in an Anti-Clockwise direction starting from the root node.

    NOTE: The boundary nodes of a binary tree include nodes from the left boundary, right boundary and the leaf nodes without duplicate nodes. However, the values from the nodes may contain duplicates.

    For Example:

    alt text

    Input Format:
    The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.
    
    The only line of each test case contains elements in the level order form. The line consists of values of nodes separated by a single space. In case a node is null, we take -1 on its place.
    
    For example, the input for the tree depicted in the below image will be:
    

    alt text

    1
    2 3
    4 -1 5 6
    -1 7 -1 -1 -1 -1
    -1 -1
    

    Explanation :

    Level 1 :
    The root node of the tree is 1
    
    Level 2 :
    Left child of 1 = 2
    Right child of 1 = 3
    
    Level 3 :
    Left child of 2 = 4
    Right child of 2 = null (-1)
    Left child of 3 = 5
    Right child of 3 = 6
    
    Level 4 :
    Left child of 4 = null (-1)
    Right child of 4 = 7
    Left child of 5 = null (-1)
    Right child of 5 = null (-1)
    Left child of 6 = null (-1)
    Right child of 6 = null (-1)
    
    Level 5 :
    Left child of 7 = null (-1)
    Right child of 7 = null (-1)
    
    The first not-null node(of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
    The input ends when all nodes at the last level are null(-1).
    
    Note :
    The above format was just to provide clarity on how the input is formed for a given tree. 
    The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:
    
    1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
    
    Output Format:
    For each test case, print the boundary nodes of the given binary tree separated by single spaces.
    
    Print the output of each test case in a separate line.
    
    Note: 
    You are not required to print the expected output, it has already been taken care of. Just implement the function.
    
    Constraints:
    1 <= T <= 100
    0 <= N <= 5000
    1 <= val <= 10^5 and val != -1
    
    Where ‘T’ is the number of test cases, and ‘N’ is the total number of nodes in the binary tree, and “val” is the value of the binary tree node
    
    Time Limit: 1 sec
    
  • Q7. Sort 0 1 2

    You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

    Note :
    Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
    
    Input format :
    The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.
    
    The first line of each test case contains an Integer 'N' denoting the size of the array/list.
    
    The second line of each test case contains 'N' space-separated Integers denoting the array/list.
    
    Output format :
    For each test case/query, print the sorted array/list(ARR) as space-separated Integers.
    
    Output for every test case will be printed in a separate line.
    
    Note:
    You need to change in the given array/list itself. Hence, no need to return or print anything.
    
    Constraints :
    1 <= T <= 10
    1 <= N <= (5 * (10 ^ 5))
    0 <= ARR[i] <= 2
    
    Where 'N' is the size of the given array/list.
    And, ARR[i] denotes the i-th element in the array/list.
    
    Time Limit: 1sec 
    
  • Q8. Basic HR Questions

    Where do you see yourself in 5 years?

    What are your weaknesses?

Interview details

Proposed: Eligibility criteriaabove 7.5 CGPA
Deloitte interview Rounds:Round 1
Round type - Online Coding Test
Round duration - 135 minutes
Round difficulty - Easy
Round description -

Coding questions was easy if you know the basic of coding in any language. I submitted optimized solution for every questions that's why i got selected in this round.


Round 2
Round type - Assignment
Round duration - 150 minutes
Round difficulty - Medium

Round 3
Round type - Face to Face
Round duration - 30 minutes
Round difficulty - Easy
Round description -

Interview went well.The interviewer asked me how the previous interviews were.


Round 4
Round type - HR Round
Round duration - 20 minutes
Round difficulty - Easy
Round description -

This round is very easy, In this round they basically need confidence and truthful person.

Deloitte interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, Networking, DevOps, Operating System, Database Management System, Object-Oriented Programming System , basic aptitudeTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. 
Tip 2 : Do lot of hard work and practice of Data Structures and Algorithms based questions
Tip 3 : See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers.
Tip 4 : I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : do mention all your skills which you are confident of in your resume.
Tip 3 : Always make resume company specific

Final outcome of the interviewSelected
View More
track
2
Accountant  interview
track

Interview Rounds

HR

I was interviewed in Jan, 2021.

Interview Questions

  • Q1. Search an Element in an Array

    You have given a sorted array 'A' of 'N' integers.

    Now, you are given 'Q' queries, and each query consists of a single integer 'X'. Your task is to check whether 'X' is present in array 'A' or not for each query. If 'X' exists in array 'A', you need to print 1 else print 0.

    Note :

    The given array is sorted in non-decreasing order. 
    
    Input format:
    The first line of the input contains an integer 'T' representing the number of test cases or queries to be processed. Then the 'T' test case follows. 
    
    The first line of each test case contains a single integer 'N' denoting the size of the array 'A'.
    
    The second line of each test case contains 'N' space-separated integers denoting the elements of the array 'A'.
    
    The third line of each test contains a single integer 'Q', denoting the number of queries. 
    
    Then each of the 'Q' lines from the fourth line of each test case contains a single integer 'X', denoting the desired element to be searched.
    
    Output Format:
    For each test case, print 'Q' space-separated integers that denote the answer to the given 'Q' queries, i.e., print 1 if the desired value 'X' exists in the array 'A', otherwise print 0.
    
    Print the answer for each test case in a new line.
    
    Note:
    You are not required to print anything, it has already been taken care of. Just implement the function.
    
    Constraints:
    1 <= T <= 10 
    1 <= N <= 10^5    
    -10^9 <= A[i] <= 10^9 
    1 <= Q <= 10^4
    -10^9 <= X <= 10^9
    
    Where 'T' represents the number of test cases, 'N' represents the size of the array, 'A[i]' represents the elements of the array, 'Q' represents the number of queries and, 'X' denotes the number to be searched.
    Time limit: 1 sec
    

Interview details

Proposed: Eligibility criteriaNo criteria
Deloitte interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 95 Minutes
Round difficulty - Medium
Round description -

An aptitude test, scheduled on AMCAT platform was taken comprising of 74 Questions for 95 Minutes. There were three segments namely English Comprehension (25 Questions, 25 Minutes), Logical Ability (24 Questions, 35 Minutes), Quantitative Ability Advanced (25 Questions, 35 Minutes). One would find this round easy if he/she is well versed in solving aptitude. 100+ appeared for this test of which shortlisted number was around 50.


Round 2
Round type - Video Call
Round duration - 60 Minutes
Round difficulty - Medium
Round description -

Right after seven days of Round 1, Round 2 was scheduled. Deloitte calls this round a JAM (Just A Minute) round. Students were asked to pick a number from 1 to 40. The moderator would give the topic against that number. The number must be unique i.e. not previously spoken on. One can change the topic but only once if he/she has not much idea on the topic. One has to speak for a minimum of 1 minute on that topic. Luckily, we had a very kind panelist . He allowed switching back to the previous topic and gave hints about the ideas if stuck. I can remember some students from my group went off track from the topic. After listening to all the topics in the session, I could draw that all topics were necessarily based upon trending technologies. Listing a few below:
Use of data for product advertisement,
Using AI to combat fake news,
Using bots on social media,
Usage of AR in e-commerce,
Pattern Detection in Healthcare,
Usage of AR in the retail industry,
Introducing AI in the healthcare sector,
Video calls replacing Voice calls,
Use of technology in sports,
Recommendation on the e-commerce platform to help customers in decision making,
Using VR for medical purposes in borders.
Of the total, around 30 went for the interviews. I cleared, Bingo!


Round 3
Round type - HR Round
Round duration - 90 Minutes
Round difficulty - Medium
Round description -

This round happened on the same day as JAM in the afternoon time. A slot of 20 minutes with respective timing was already sent to the selected students. Interview can’t be generalize as anything can happen over there and hence this was exclusively my experience. 
To have a quick judgement about the person, I believe nothing is better than throwing before him/her some puzzles (mathematical/ analytical/ programming problems) and see the approach. I received back-to-back 4 problems after a quick and brief introduction. The coding problems I got were way too easy (just basics: searching & mathematical). The harder part of this round was the puzzles (tricky, mathematical, related to probability). At last, I was asked a question on DBMS and the interviewer asked if I know JAVA.

Deloitte interview preparation:Topics to prepare for the interview - Data Structures, C++, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

Tip 1 : Mention some good projects on your resume.
Tip 2 : Practice competitive and aptitude questions.
Tip 3 : Work on your communication skills.

Application resume tips for other job seekers

Tip 1 : Mention some good projects on your resume.
Tip 2 : Don't put false things on your resume.

Final outcome of the interviewSelected
View More
track
Technology Consultant interview
track

Interview Rounds

Video Call

I was interviewed before Dec, 2020.

Interview Questions

  • Q1. Technical Questions

    Write query for selecting top 10 rows of an employee table?

    Then he asked which topics I am comfortable with.I answered Dbms and Os.So he asked me few questions from Dbms 
    1. What are different types of Dbms ?
    2. What is the difference between Dbms and Rdbms
    3. What is denormalization in dbms
    4. What is stored procedure along with syntax?
    Then he got into OOPS as the company is mainly focused on Java
    1.explain concepts of OoPs with real life examples
    2.what is abstract class , explain with a program?
    3.What is constructor destructor? 

    Add Answer Collapse
  • Q2. Basic HR Questions

    1.why should we hire you?
    2. what additional you came to know about the company through pre placement talk?
    3. What are your hobbies?

    Add Answer Collapse
  • Q3. Bursting Balloons

    You are given an array 'ARR' of N integers. Each integer represents the height of a balloon. So, there are N balloons lined up.

    Your aim is to destroy all these balloons. Now, a balloon can only be destroyed if the player shoots its head. So, to do the needful, he/ she shoots an arrow from the left to the right side of the platform, from an arbitrary height he/she chooses. The arrow moves from left to right, at a chosen height ARR[i] until it finds a balloon. The moment when an arrow touches a balloon, the balloon gets destroyed and disappears and the arrow continues its way from left to right at a height decreased by 1. Therefore, if the arrow was moving at height ARR[i], after destroying the balloon it travels at height ARR[i]-1. The player wins this game if he destroys all the balloons in minimum arrows.

    You have to return the minimum arrows required to complete the task.

    Input Format:
    The first line of input contains an integer N representing the size of the array.
    
    The second line of input contains N space-separated integers representing the height of the balloons.
    
    Output Format:
    Return a single integer i.e. the count of the minimum number of arrows required to complete the task.
    

    Note:

    You are not required to print the output, it has already been taken care of. Just implement the function. 
    
    Constraints:
    1 <= N <= 5*10^5
    1 <= ARR[i] <= 10^9
    
    Time Limit: 1sec
    

Interview details

Professional and academic backgroundI applied for the job as Business Technology Analyst in HyderabadProposed: Eligibility criteriaAbove 6.5 CGPA
Deloitte interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 129 minutes
Round difficulty - Medium
Round description -

This round consist of 3 sections - aptitude, reasoning and verbal 
It was scheduled in evening.


Round 2
Round type - Group Discussion
Round duration - 30 minutes
Round difficulty - Easy
Round description -

So it was more like a jam session where each of us had to choose from a list of 40 chits each chit containing different topics and we were given around 2 minute to think and speak upon the topic chosen


Round 3
Round type - Video Call
Round duration - 25 minutes
Round difficulty - Medium
Round description -

In this round,the interviewer started with asking about myself . It was basically a combination of technical as well as HR round.
Interviewer was very friendly and motivated me throughout the process.

Deloitte interview preparation:Topics to prepare for the interview - Database management system, OOPS, Pointers, Sql, JavaTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Focus more on Object Oriented programming language preferably Java 
Tip 2 : Practice Sql queries and Dbms

Application resume tips for other job seekers

Tip 1 : Have some good projects in resume
Tip 2 : Mention productive extracurricular activities that you have done.

Final outcome of the interviewRejected
View More
track

Jobs at Deloitte

Business Technology Analyst interview
track

Interview Rounds

Video Call

I was interviewed in Aug, 2021.

Interview Questions

  • Q1. Technical Questions

    OOPS concepts.

    What is SQL and NO SQL database?

    What is difference between Stored procedures and functions?

    Add Answer Collapse
  • Q2. Reverse of a number

    Write a program to generate the reverse of a given number N. Print the corresponding reverse number.

    Note : If a number has trailing zeros, then its reverse will not include them. For e.g., reverse of 10400 will be 401 instead of 00401.


    Input format :
    Integer N
    
    Output format :
    Corresponding reverse number
    
    Constraints:
    0 <= N < 10^8
    

Interview details

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. Proposed: Eligibility criteriaAbove 6.5 CGPA
Deloitte interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 70 Minutes
Round difficulty - Medium
Round description -

The online assessment round was conducted on the 25th of August 2021, in 3 different batches on a single day itself. I was allotted the 2nd batch, and my exam started at around 5 PM. So there were 3 different sections in this assessment - Logical, Verbal and Aptitude. Each section had approximately 20 questions each with 20 mins of time for each section.
The main thing in this exam to be remembered is that one cannot navigate between the questions. So either you answer a question or leave it, you can come back to it in the future to change or answer or reattempt it. So one should be confident while marking the answer cautiously along with keeping a check on the time left for each section. 
I personally feel that this online assessment was not so difficult if you have the ability to think logically and put your thinking caps to solve those aptitude questions.


Round 2
Round type - Video Call
Round duration - 40 Minutes
Round difficulty - Easy
Round description -

The interviews started from 11 AM and were conducted till 5 PM (with 30 mins lunch break from 1 PM). My interview was conducted at 2 PM. In my interview, I was first asked to introduce myself. Then the interviewer directly came to my resume. He was quite excited to go through the work experiences that I had mentioned, so he asked me to give a brief overview of what was the internship about and what were your learnings from it. 

Deloitte interview preparation:Topics to prepare for the interview - OOPS, Logical Reasoning, Verbal and Aptitude, DBMS, SQLTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Revise OOPS very thoroughly (even the most basic questions that can be asked in the interview) 
Tip 2 : Practice at least 5 questions from different categories for logical reasoning and aptitude preparation.

Application resume tips for other job seekers

Tip 1 : Be thorough with each and everything mentioned by you in your resume (from the projects to work experiences to skills to awards/recognitions mentioned in it)
Tip 2 : Don't just fake anything which you don't know in your resume!!

Final outcome of the interviewSelected
View More
track
Technical Analyst | Mechanical Engineer interview
track

Interview Rounds

Amcat Test

Group discussion round

Personal Interview

I applied via Campus Placement and was interviewed in Sep, 2021.

Interview Questions

  • Q1. What are your hobbies?
    Add Answer Collapse
  • Q2. What extracurricular activities have you participated in?
    Add Answer Collapse

Interview details

Professional and academic backgroundAt the time of the interview, I had 0 Years (fresher) of experience.Deloitte interview Rounds:Round 1
Round type - Amcat Test
Round duration - 75 minutes
Round description -
on AMCAT platform,held on 14th Aug 2021.
The test window was open from 9 am to 9 pm. It had 3 sections namely- English, logical reasoning and quantitative .
The total test duration was 75 mins, and the timer was sectional.
English had synonyms, antonyms and paragraph-based questions.
Logical section had the alphabet, complete the number series, relation and direction-based questions.
The Quant section had questions on time distance, ratio,percentage, profit and loss, etc.
Overall the test was easy as our college had taken practice on Amcat aptitude papers from the first year.
Since the level of the paper was easy, one should try to do almost all questions correctly. Out of around 350 registered students from CS, IT, Electronics and E&Tc branches, 75 were selected for the next round.
We got the result of the first round within a week, and the next rounds were scheduled immediately the next day.

Round 2
Round type - Group discussion round
Round duration - 45 minutes
Round description -
Round 2 was an online group discussion round, held on 19th aug. The groups of 8-10 people were formed and we were asked to join the respective Microsoft teams link. The round was completed in 45 mins. We were given a case study and 3 problem statements, the interviewer read and also displayed the case study on the screen. The discussion went for 25 mins in which everyone spoke on the 3 problem statements and in the end, everyone was asked to give their conclusions. Out of 75, around 40 people were selected for the next round.

Round 3
Round type - Personal Interview
Round description -
Round 3 took place on the same day, it was a personal interview round. The interview made sure I am comfortable and asked basic questions about family and my area of interest.Question based on my resume were asked followed by situation-based questions like an argument with a co-worker or work exceeding the deadline. He also asked about my extracurricular activities and the position I held in college clubs. It was not a technical round, our communication skills were tested in this round. 15 were selected for the last round
Deloitte interview preparation:Resources to prepare for this interview - I used PrepInsta’s website for preparing aptitude and also read their Interview Experiences.Tips for other job seekers - Deloitte Interviewers were focusing a lot on the communication skills.Final outcome of the interviewSelected
View More
track
Analyst interview
track

Contribute to the growing community

Don’t worry. You can choose to be anonymous.

Report Interview Advice

What’s wrong with this interview advice?