HashedIn by Deloitte Interview Experience for SDE Intern+FTE | On-Campus 2024

hashedin by deloitte logo
hashedin by deloitte
SDE Intern+FTEOffer
December 1, 20242 reads

Summary

I successfully secured an SDE Intern+FTE position at HashedIn by Deloitte through an on-campus placement drive. The selection process involved an online assessment, two technical interviews covering DSA, DBMS, and system design, followed by a final HR round.

Full Experience

Hey everyone! I recently appeared for the HashedIn by Deloitte placement drive conducted at my college, and I'm thrilled to share that I was SELECTED! I'm writing this post to walk you through my interview rounds and share some tips that might help you in your journey.

### Interview Rounds Overview
Round 1: Online Assessment (90 mins)
This was an online test consisting of three coding questions of varying difficulty levels. While I don't recall the exact problems, I solved all three questions. Consistent practice, especially from platforms like GFG and LeetCode, helped me perform well.

Round 2: Technical Interview 1 (45-50 min)
The interviewer was extremely friendly and supportive. The session began with introductions and a brief discussion about my internship experience. Following this, I was given 3-4 DSA questions to solve, after which the interviewer asked a series of DBMS-related questions, including SQL queries and some resume-specific questions. I solved all four DSA questions, starting with brute force approaches and optimizing them to better solutions. However, I got slightly stuck while optimizing the fourth problem. I was able to answer all the other questions, and the interviewer seemed satisfied with my responses.

Round 3: Technical Interview 2 (1 hr 10min)
This round began with my basic introduction, after which the interviewer asked me to explain one of my projects. I described an e-commerce application I built using Next.js. Since the project utilized a MongoDB database, the interviewer delved into a discussion about SQL vs. NoSQL databases. Following this, I was asked to solve a DSA problem based on the graph data structure. I solved this problem using DFS (Depth First Search). Afterward, I was tasked with designing a database for a restaurant table booking application. With the interviewer's guidance and my preparation in database design, I successfully completed this task.

Round 4: HR/Managerial Interview (20 min)
This was the final round, and it primarily consisted of common HR questions along with a few situation-based questions. I answered all questions confidently.

Finally, the results were declared, and I was thrilled to be among the 7 students offered a position by HashedIn from my campus. I would like to thank my mentors, peers, and seniors who guided me throughout my preparation journey. Their support and advice were invaluable. I am also grateful to the HashedIn by Deloitte team for providing such a wonderful opportunity and conducting the process so smoothly.

Interview Questions (17)

Q1
Max Ones After Flipping Range
Data Structures & AlgorithmsMedium

A Binary String Problem to find the maximum number of ones after flipping all the digits within a continuous range.

Q2
Missing and Repeating Element
Data Structures & Algorithms

Find the missing and repeating element in an array.

Q3
Two Sum
Data Structures & Algorithms

Find pairs in an array whose sum equals a target sum.

Q4
Longest Palindromic Substring
Data Structures & Algorithms

Find the longest palindromic substring in an array (likely meant string).

Q5
Merge K Sorted Lists
Data Structures & Algorithms

Merge K sorted lists.

Q6
Unique vs Primary Key
Other

Explain the difference between Unique and Primary keys in a database.

Q7
WHERE vs HAVING Clause
Other

Explain the difference Between Where and Having Clause in SQL.

Q8
SQL Commands
Other

What are SQL Commands?

Q9
React Hooks
Other

What are React Hooks? (Since I mentioned React in my resume).

Q10
JWT Authentication
Other

How does JWT Authentication work?

Q11
Longest Path in 2D Matrix with Blocks
Data Structures & Algorithms

Given a 2D matrix containing a source node, a target node, and some blocked nodes, find the longest path from the source to the target.

Q12
Restaurant Table Booking Database Design
System Design

Design a database for a restaurant table booking application. This included database design with a proper schema, creating an ERD (Entity-Relationship Diagram), and writing queries for all the requested features.

Q13
Tell Me About Your Background
Behavioral

From which place do I belong?

Q14
Family Introduction
Behavioral

Provide a brief introduction about your family.

Q15
What Can You Bring to HashedIn?
Behavioral

What can you bring to HashedIn by Deloitte?

Q16
Why Should We Hire You?
Behavioral

Why should they hire you?

Q17
What Do You Know About HashedIn?
Behavioral

What do you know about HashedIn by Deloitte?

Preparation Tips

My preparation primarily involved consistent practice on platforms like GeeksforGeeks (GFG) and LeetCode, which helped me perform well in the coding rounds. Additionally, I focused on database design, which was crucial for the system design task in one of the technical interviews. The guidance from my mentors, peers, and seniors was invaluable throughout my journey.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!