HashedIn by Deloitte Interview Questions, Process, and Tips

The coding test was of 2 hours, in which there were 3 questions. The topics which were asked were dynamic programming, strings and graphs. The platform on which it was conducted was codility.

Q1. 1. Describe your projects. 2. Group anagrams : Leetcode 3. Next greater element : Leetcode 4. Morris traversal 4. Questions from OS, DBMS and CN Total duration - 1 hr
Add your answer

Q1. 1. Describe your projects in depth. 2. Database schema design of Codechef. 3. SQL queries related to that. 4. Questions on CN
Ans. 
Answering questions on projects, database schema design of Codechef, SQL queries, and CN.
• Projects involved developing a web application for managing employee data and a mobile app for tracking expenses.

• Database schema design of Codechef involved creating tables for users, problems, submissions, and contests.

• SQL queries related to Codechef included retrieving user details, problem submissions, and contest rankings.

• Quest...read more
Answered by AI
Add your answer

Q1. This was basically a fitment round by a product manager. 1. Introduction 2. Your background 3. Your project 4. Any plans for higher education 5. What do you know about Hashedin and why Hashedin? 6. Do you...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

There were 3 coding questions. questions were implemented based on arrays and trees
Question 1 was Easy
Question 2 was Medium
Question 3 was Medium
all 3 questions were necessary to be selected for the next round.

Q1. 
Convert Binary Tree to Mirror Tree Problem Statement
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mir...read more
Ans. 
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
• Traverse the binary tree in a recursive manner.

• Swap the left and right children of each non-leaf node.

• Continue this process until all nodes are visited.

• Example: Input binary tree: 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, Output mirror tree: 1 3 2 6 5 4 -1 -1 -1 -1 -1 7 -1 -1 -1
Answered by AI
Add your answer
Q2. 
Min Jumps Problem Statement
In Ninja town, represented as an N * M grid, people travel by jumping over buildings in the grid's cells. Santa is starting at cell (0, 0) and must deliver gifts to cell (N-1, ...read more
Ans. 
Santa needs to find the quickest path to deliver gifts in Ninja town by jumping over buildings with least travel time.
• Santa starts at (0, 0) and needs to deliver gifts to (N-1, M-1) on Christmas Eve.

• Santa can jump to (x+1, y+1), (x+1, y), or (x, y+1) from any cell (x, y) within grid boundaries.

• Travel time between two buildings equals the absolute difference in their heights.

• Find the quickest path with least travel time...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was DSA based round where there was some discussion on the project followed by 2 coding questions, I had to explain my approach and write the code on Google Docs.

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Check if two strings are anagrams of each other by comparing their sorted characters.
• Sort the characters of both strings and compare them.

• Use a dictionary to count the frequency of characters in each string and compare the dictionaries.

• Ensure both strings have the same length before proceeding with the comparison.

• Example: For input 'str1 = "spar", str2 = "rasp"', the output should be True.
Answered by AI
Add your answer
Q2. 
Longest Mountain Subarray Problem Statement
Given an array of integers denoting the heights of the mountains, find the length of the longest subarray that forms a mountain shape.
A mountain subarray is d...read more
Ans. 
Find the length of the longest mountain subarray in an array of integers.
• Identify peaks in the array where the elements transition from ascending to descending order.

• Calculate the length of the mountain subarray starting from each peak.

• Track the length of the longest mountain subarray found so far.

• Consider edge cases like when there are no mountains in the array.
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Easy

This round mainly revolved around a system design for an e-commerce website, then some DBMS queries followed by interview questions on OS, DBMS, and Computer Networks. Also there was some discussion of project, how it works, why I made the project, etc.

Round duration - 30 Minutes
Round difficulty - Easy

Some HR questions were asked like other offers, Why do you wanna join Hashedin, and strengths and weaknesses.
After that a puzzle was asked which I correctly answered

It was of medium difficulty I don't exactly remember the topics because its been 1.9 years, and it was an on-campus placement for Internship + FTE. But majorly the topics were arrays, linked lists, strings, Binary Search, etc.

Q1. It basically revolved around DSA and CS Fundamentals including topics like arrays, linked lists, binary search, stacks, heaps, hashing, queues, etc.
Add your answer

Q1. It was about system design, I was asked to code for a game basically which had several rules and requirements, and as per those requirements I had to code in my preferred language. It was similar to a tic-...read more
Add your answer

Q1. Generic HR Questions like where do you see yourself after a few years, why did you choose this field, what all things apart from coding you did in college life, etc.
Add your answer

3 Questions included of easy, medium and Difficulties

Q1. Core Subjects, Project Discussion, Questions on DSA
Add your answer

Q1. DSA + system design round
Add your answer

Q1. What is your family background?
Add your answer
Q2. Why should we hire you?
Add your answer
Q3. What are your strengths and weaknesses?
Add your answer
Q4. Tell me about yourself.
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing - 11:45 am
It was zoom meeting call. Was asked to share the screen.
Interviewer was good and friendly. Helped me when I was stuck.

Q1. 
Find Duplicate in Array Problem Statement
You are provided with an array of integers 'ARR' consisting of 'N' elements. Each integer is within the range [1, N-1], and the array contains exactly one duplica...read more
Ans. 
Find the duplicate element in an array of integers.
• Iterate through the array and keep track of the frequency of each element using a hashmap.

• Return the element with a frequency greater than 1 as the duplicate.

• Time complexity should be O(n) and space complexity should be O(n).
Answered by AI
Add your answer
Q2. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Given an array and a target sum, find pairs of elements that add up to the target sum.
• Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

• If the complement exists, add the pair to the result list.

• Sort the result list based on the first element of each pair, with tiebreakers based on the second element.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Timing - 4pm on zoom video call.
This was basically system design round.
The interviewer was friendly and helpful.

Q1. How would you design an app similar to Practo?
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing - 4 pm
It was zoom video call.
This was fitment round. Taken by senior management.

Leetcode wasy and medium question of array

Q1. Design uber lld and hld
Ans. 
Designing the architecture for Uber's software system
• Use microservices architecture for scalability and flexibility

• Implement a robust backend system for handling user requests and driver matching

• Utilize real-time data processing for tracking driver locations and ride requests

• Incorporate a payment gateway for seamless transactions

• Include a rating system for feedback and quality control
Answered by AI
Add your answer

Q1. Based on previous project
Add your answer