Glassdoor users rated their interview experience at HashedIn by Deloitte as 66.7% positive with a difficulty rating score of 2.67 out of 5 (where 5 is the highest level of difficulty). Candidates interviewing for Senior Consultant and Audit Assistant rated their interviews as the hardest, whereas interviews for atencion cliente and Audit Assistant roles were rated as the easiest.
Here are the most commonly searched roles for interview reports -
I applied through college or university. The process took 1 day. I interviewed at HashedIn by Deloitte in Mar 2019
Interview
Four Rounds:
1) Technical Written Paper
2) Technical One on One: DS and Algo
3) Technical One on One: DS, Algo, Networks, CO, Design
4) HR round if you clear the technical
Interview questions [1]
Question 1
DS related to arrays, string manipulation, recursion
The process took 3 weeks. I interviewed at HashedIn by Deloitte (Nueva Delhi)
Interview
I had total 3 rounds
2 technical rounds
1 manger round
Interview process was very smooth and the HR was replying when ever asked for feed back
The interview panel very frndly and made me comfortable
Note: u can ask for hints if u r stuck , that's not a problem at all.
Interview questions [1]
Question 1
Mostly questions were on:
Core java - in depth
Ds and algo
Data base
Rest API's
About current project and roles and responsibilities
System design - I was asked to design the tinyurl
I applied through college or university. The process took 5 days. I interviewed at HashedIn by Deloitte (Bengaluru) in Oct 2020
Interview
There were a total of 5 rounds: -
1. online Test(Duration was 90 minutes)
2. Technical Interview 1-(Duration was 30 minutes)
3. Technical Interview 2-(Duration was 60 minutes)
4. Technical Interview 3-(Duration was 30 minutes)
3. HR round(Duration was 15 minutes)
Interview questions [1]
Question 1
1. Online Test : - duration(90 minutes) - 10 MCQS(dbms,OS,DS,OOPS) and 3 coding questions.
i. Find the elements in an array whose occurrence is more than N/3 times.
ii. A matrix is given having 0 and 1 find that one cell which we can change from 0 to 1 in order to increase our area consists of cells having 1.
iii. A Binary tree is given we have to find the maximum sum of the nodes but it can't be having parent-child relationships.
2. Technical round 1(30 minutes): - 1. tell me about yourself
2. what is object oriented programming
3. encapsulation
4. abstraction
5. can we override method from abstract class
6. ques did in test & optimize it
7. Q1: How many time N occurs N times continuously
a = [1,2,3,4,2,2,4,5,6,6,6,6,6,6,6,8,9,0,1]
N= 6
Output = 2
2. Technical Round 2 (1 hour)- 1 brief intro
2 explain project
3 Coding ques: - I love india. it is my country.
I love my country. It is India.
Output - Return :- True
Check the number of occurrences of words in both the sentence is equal or not.
4. Missing and repeated elements in the array
5. Deadlock
6. TCP/IP
7. BCNF
3. Technical round 3 (30 minutes)- It was the same as previous rounds DBMS, CN, OS, OOPS were asked and one coding ques were asked which was based upon the KMP pattern matching algorithm.
4. HR round: - it was 15 min round more of a formality no elimination was there.