HashedIn by Deloitte Interview Questions, Process, and Tips

Round duration - 30 minutes
Round difficulty - Easy

Interviewer had good knowledge

Q1. 
Pair Sum Problem Statement
You are provided with an array ARR consisting of N distinct integers in ascending order and an integer TARGET. Your objective is to count all the distinct pairs in ARR whose sum...read more
Ans. 
Count distinct pairs in an array whose sum equals a given target.
• Use two pointers approach to find pairs efficiently.

• Keep track of visited elements to avoid duplicates.

• Return -1 if no such pair exists with the sum equal to 'TARGET'.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

LLD

Q1. Can you describe the database design for a ticket booking system like BookMyShow?
Ans. 
Database design for a ticket booking system like BookMyShow involves tables for users, events, bookings, and venues.
• Create a table for users with columns like user_id, name, email, phone_number, etc.

• Create a table for events with columns like event_id, name, date, time, venue_id, etc.

• Create a table for bookings with columns like booking_id, user_id, event_id, booking_date, status, etc.

• Create a table for venues with col...read more
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Medium

Interview experience 
Salary negotiation

We were given notepad to write pseudo code, there were 3 questions, 1 easy, 1 medium and 1 hard. We had to write time and space complexity for each question.

Q1. 4 questions were asked , 3 easy and 1 medium level , some questions of programming language and OOPS.
Add your answer

Q1. 1 coding question of hard level, was somewhat similar to no. Of island , I gave dfs approach but he asked me to code using bfs. 2nd question was designing snake and ladder with N number of player and N cel...read more
Add your answer

Q1. Basic HR questions , project discussion and some scenario based problems.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It consists of 3 questions:

The first question was related to DP (Hard)
Second was related to math(Easy)

Third was related to string (Medium)

Q1. 
Chocolate Pickup Problem
Ninja has a 'GRID' of size 'R' x 'C'. Each cell of the grid contains some chocolates. Ninja has two friends, Alice and Bob, and he wants to collect as many chocolates as possible ...read more
Ans. 
Find the maximum number of chocolates that can be collected by two friends moving in a grid.
• Start from the top-left and top-right corners, move diagonally down to collect chocolates

• Calculate the total chocolates collected by each friend and sum them up for the final result

• Consider all possible paths for both friends to maximize the total chocolates collected
Answered by AI
Add your answer
Q2. 
Trailing Zeros in Factorial Problem
Find the number of trailing zeroes in the factorial of a given number N.
Input:
The first line contains an integer T representing the number of test cases.
Each of the...read more
Ans. 
Count the number of trailing zeros in the factorial of a given number.
• Trailing zeros are created by pairs of 2 and 5 in the factorial.

• Count the number of 5s in the prime factorization of N to find the trailing zeros.

• For example, for N=10, there are 2 trailing zeros as there are two 5s in the prime factorization of 10.
Answered by AI
Add your answer
Q3. 
Find K'th Character of Decrypted String
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...read more
Ans. 
Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.
• Parse the encrypted string to extract substrings and their counts

• Iterate through the substrings and counts to build the decrypted string

• Track the position in the decrypted string to find the K'th character
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Standard DS/Algo round. It was at around 12 PM

Q1. 
Leaders in an Array Problem Statement
Given a sequence of numbers, the task is to identify all the leaders within this sequence. An element is considered a leader if it is strictly greater than all the el...read more
Ans. 
Identify all the leaders in a sequence of numbers, where a leader is greater than all elements to its right.
• Iterate through the sequence from right to left, keeping track of the maximum element encountered so far.

• If an element is greater than the maximum element encountered so far, it is a leader.

• Add the leaders to a result sequence while maintaining the original order.

• The rightmost element is always a leader.
Answered by AI
Add your answer
Q2. 
Find Two Missing Numbers Problem Statement
Given an array of unique integers where each element is in the range [1, N], and the size of the array is (N - 2), there are two numbers missing from this array....read more
Ans. 
Given an array of unique integers with two missing numbers, find and return the missing numbers.
• Iterate through the array and mark the presence of each number in a separate boolean array.

• Iterate through the boolean array to find the missing numbers.

• Return the missing numbers in increasing order.
Answered by AI
Add your answer
Q3. 
Reverse the Linked List
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
Input:
The first line of input contains an integer 'T' representing the numbe...read more
Ans. 
Reverse a singly linked list of integers in O(N) time and O(1) space complexity.
• Iterate through the linked list, reversing the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the list.

• Update the head of the reversed linked list as the last node encountered during the reversal process.

• Example: Given 1 -> 2 -> ...read more
Answered by AI
Add your answer

Round duration - 35 minutes
Round difficulty - Easy

First, he asked me to introduce myself.
Then, he told me that as you know this is a design round so design a music player like Spotify. 
First, I have designed the database using tables and Primary and Foreign Keys.
Then, he told me to write the code for it and told me that before I write the code tell me that which data structure will you use and why?
Then, he discussed with me for around 10 to 15 min that why am I using particular DS and why not someone else and what will be the problem in a particular data structure, and how will certain DS perform in case of various operations like searching, adding, deleting the songs in the music player.
Then, he told me to write the code for a playlist of this music player with all possible operations.

Q1. Design a music player similar to Spotify.
Ans. 
Design a music player similar to Spotify.
• Implement user authentication for personalized playlists and recommendations

• Create a user-friendly interface with features like search, shuffle, repeat, and create playlists

• Integrate a recommendation system based on user listening history and preferences
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Interviewer was very friendly
And, timing was around 12.30 PM

Q1. Why should we hire you?
Add your answer
Q2. What do you know about the company?
Add your answer

Topics - There were three question, 1- easy, 2-medium
Medium level questions were from dynamic programming

Q1. Basic question were asked from the topics of OS, OOP, Database and Networking. 1 DSA question was asked.
Add your answer

Q1. Low level system design question was given. Design a database for a online cab booking company.
Add your answer

Q1. Basic HR questions.
Add your answer