I applied through university. I interviewed at HashedIn by Deloitte
Difficult interview
Application
I applied online. The process took 1+ week. I interviewed at HashedIn by Deloitte in Feb 2021
Interview
The whole recruitment process was very seamless and the recruiter was also very communicative and helpful. Had 3 interviews - 2 technical and 1 managerial.
Got the offer letter And did joined.
Interview questions [1]
Question 1
1st a quick call with the Recruiter just discussion on tech stack, current and expected CTC, and notice period. The recruiter arranged the 1st interview on the mutually decided date.
1st Round | Technical Interview - 1 | 1 hour
1. Introduce yourself. (5 mins)
2. Just a resume walk-through and background details question. (10 mins)
3. Past project discussion. (10 mins)
4. Basic java, java-spring question. (10 mins)
5. Then a detailed discussion on building a movie ticket booking system:- database designing, API designing, architecture, approach, etc. (20 mins)
6. Simple Question on databases. (5 mins)
2nd Round | Technical Interview - 2 | 1.5 hour
1. Introduce yourself. (5 mins)
2. Tech stacks worked on. (5 mins)
3. Showed some code snippets to find time and space complexity. (10 mins)
4. Core Java and Spring-boot, Hibernate question. (10 mins)
5. 4 Coding questions (1 Hour)
String manipulation
Array-based question
Graph question (approach only)
Kth largest element from array ( Write Production-level code )
3nd Round | Managerial Interview | 1 hour
1. Introduce yourself.
2. How you deal with stress.
3. How is covid-19 affecting your personal growth
4. Why are you switching
5. Any plans for further studies.
6. You can ask me any question I am done.
I asked questions related to any project approach, architecture like what they follow how are deadlines decided, and all.
I appeared for the Hased interview, and the process consisted of three rounds:
1️⃣ Round 1 – DSA Round:
This round focused on Data Structures and Algorithms. Two main problems were asked:
Remove All Adjacent Duplicates in String (LeetCode 1047): Remove adjacent duplicates repeatedly until no duplicates remain.
Example: "abbcca" → "", "abbbccabc" → "bc".
Concepts tested: Stack usage, string manipulation, handling edge cases.
Climbing Stairs / Monkey Jump Problem (LeetCode 70): Count the number of ways to reach the top if a monkey can jump k steps at a time.
Concepts tested: Recursion, dynamic programming, combinatorial problem solving.
2️⃣ Round 2 – System Design Round:
This round evaluated my understanding of designing scalable systems, handling trade-offs, and architectural decision-making. Focus was on discussing real-world scenarios and high-level design solutions.
3️⃣ Round 3 – Company Fitment Round:
This round was more behavioral and assessed cultural fit, communication skills, and alignment with Hased’s values. Questions revolved around teamwork, past experiences, and problem-solving approach.
Interview questions [2]
Question 1
Remove All Adjacent Duplicates in String (LeetCode 1047)
Four rounds
First online assessment
3 coding question
Technical interview 1
( data structure, core subjects of computer science)
Technical interview 2
( your resume in detail, database architecture design, your fav framework in detail)
HR round
Basic hr discussion
Interview questions [1]
Question 1
Design the database architecture of library management system
Interview was very decent and normal and interviewer was very polite. They were asking questions from SQL, basic of JAVA and some higher DSA questions . They were mainly looking for people with good problem solving skills.
Interview questions [1]
Question 1
Mainly they ask from strings linked lists and some higher dsa