Hashedin By Deloitte | SDE Intern | Interview Experience | Offer

hashedin logo
hashedin
sde internOffer
March 1, 20242 reads

Summary

I recently interviewed for the SDE Intern position at Hashedin by Deloitte, which involved an Online Assessment, two technical interviews, and an HR round, ultimately leading to an offer.

Full Experience

I recently had the opportunity to interview with Hashedin by Deloitte for an SDE Intern position. The interview process was conducted on-campus and consisted of four rounds: an Online Assessment, two Technical Interviews, and a final HR Round.

OA Round

My journey began with the Online Assessment, which featured three coding questions: one easy, and two medium to hard. I successfully solved all of them within the allotted time. Out of 135 students who attempted this round, 22 of us were selected to proceed.

Technical Interview 1 (~50 min)

This round started with a brief introduction, after which the interviewer delved into core computer science fundamentals, asking questions on topics like Inheritance, Polymorphism, and DBMS. Following this, we moved on to Data Structures and Algorithms. I was asked to solve the 'Reverse Linked List' problem, demonstrating both iterative and recursive approaches, and the 'Rotate Array' problem, which included several follow-up questions. Towards the end, I answered some SQL queries focusing on Joins, and the interviewer seemed satisfied with my responses.

Technical Interview 2 (~1 hr 45 min)

Next was the second Technical Interview, which was a comprehensive session. This round primarily focused on System Design. I was tasked with designing a comprehensive database schema for a Movie Ticket Booking Application, and I was encouraged to think of functionalities independently. The interviewer was very helpful throughout this process, guiding me whenever I encountered difficulties. This design discussion took up about an hour. After the system design, we transitioned back to DSA. The interviewer presented a series of 'Jump Game' problems, specifically 'Jump Game', 'Jump Game II', 'Jump Game III', and 'Jump Game IV'.

HR Round

Finally, I proceeded to the HR Round. This was, unfortunately, the least pleasant part of the entire process. I was quite surprised to be questioned and judged somewhat harshly regarding my CGPA, even though it was above the company's stated criteria. Despite this challenging HR experience, I eventually received an offer.

Interview Questions (8)

Q1
Reverse Linked List
Data Structures & AlgorithmsEasy

Given the head of a singly linked list, reverse the list, and return the reversed list. I was asked to implement both iterative and recursive solutions.

Q2
Rotate Array
Data Structures & AlgorithmsMedium

Given an array, rotate the array to the right by k steps, where k is non-negative. There were multiple follow-up questions related to this, likely exploring in-place solutions, optimal time/space complexity, and handling edge cases.

Q3
SQL Queries on Joins
Other

I was asked several SQL queries specifically focusing on different types of JOIN operations, such as INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN. The interviewer wanted to understand my grasp of how these joins work and their practical use cases for combining data from multiple tables.

Q4
Design Database Schema for Movie Ticket Booking Application
System Design

I was tasked with designing a comprehensive database schema for a Movie Ticket Booking Application. This required me to identify key entities such as Movies, Theaters, Shows, Bookings, Users, and Payments, and then define their attributes, relationships, and appropriate data types. I also had to consider various functionalities like user registration, browsing movies, selecting seats, making bookings, and processing payments.

Q5
Jump Game
Data Structures & AlgorithmsMedium

Given an array of non-negative integers nums, you are initially positioned at the first index, and each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index.

Q6
Jump Game II
Data Structures & AlgorithmsMedium

Given an array of non-negative integers nums, you are initially positioned at the first index, and each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps.

Q7
Jump Game III
Data Structures & AlgorithmsMedium

Given an array of non-negative integers arr, you are initially positioned at start index. When you are at index i, you can jump to i + arr[i] or i - arr[i]. You want to reach any index j where arr[j] == 0. Return true if you can reach such an index, otherwise return false.

Q8
Jump Game IV
Data Structures & AlgorithmsHard

Given an array of integers arr, you are initially positioned at the first index. In one step, you can jump from index i to:

  1. i + 1 if i + 1 < arr.length
  2. i - 1 if i - 1 >= 0
  3. j where arr[i] == arr[j] and i != j
Return the minimum number of steps to reach the last index of the array.

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!