HashedIn by Deloitte Software Developer Interview Questions, Process, and Tips

Dp and strings questions along with array

Q1. LinkedList and Array medium level questions were asked
Add your answer
Q2. Rotate a array k times
Ans. 
Rotate an array of strings k times
• Create a temporary array to store elements that will be rotated

• Use modulo operator to handle cases where k is greater than array length

• Update the original array with elements from the temporary array
Answered by AI
Add your answer
Q3. 2 sum using linked list
Ans. 
Use a hash table to find two numbers in a linked list that add up to a target sum.
• Traverse the linked list and store each node's value in a hash table along with its index.

• For each node, check if the difference between the target sum and the current node's value exists in the hash table.

• If it does, return the indices of the two nodes.

• Example: Given linked list 2 -> 4 -> 3 -> 5 and target sum 7, return indices 1 and 2.
Answered by AI
Add your answer

Q1. Dynamic programming and oops concept, dbms concepts were asked
Add your answer

Q1. Tell me about yourself , why hashedin
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

There was three questions in the test. I was able to solve 2.5 questions. 2 Questions was of medium difficulty and one was easy.

Q1. 
Convert a Number to Words
Given an integer number num, your task is to convert 'num' into its corresponding word representation.
Input:
The first line of input contains an integer ‘T’ denoting the number o...read more
Ans. 
I created two array, 1st one is for tens places and 2nd is for ones places and then divide the number by 10 and use tense place in the first array and ones place for 2nd array
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Interviewer asked me 2 DSA question and 10 short answer type questions. 
Timing around 1 hour.
Interview was on zoom and we can use our own editor, for eg I used Vs Code.
Interviewer was very helpful. He helps me finding the edge cases.

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
I use slow and fast pointer approach to solve this problem. Fast pointer move in the double speed as compare to slow pointer and if they meet while traversing the linkedlist then there is a loop otherwise no loop
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Total duration of the round is 60 minutes.
Interview was on zoom. we can use any editor.
It was Design round.

Q1. How would you design a social media platform with features such as friend requests and posts?
Ans. 
Tip 1 : Ask as many question as you can to get familiar with the statement.
Tip 2 : Tell him the approach first before start coding. 
Tip 3 : Use efficient data structure for storing and time complexity wise
Answered Anonymously
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

Duration of this round is 20 minutes.
Interview was on zoom.
Interviewer was very friendly.

Round duration - 90 minutes
Round difficulty - Medium

My test was scheduled at 2 pm and I received the test link at exactly 2 pm in my mail. The platform was quite user-friendly. The test consists of 3 coding question and I have solved all 3 of them.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. 
I have applied the kadanes algo and solved this question.
Answered Anonymously
Add your answer
Q2. 
Last Stone Weight Problem Statement
We have a set collection of N stones, and each stone has a given positive integer weight. On each turn, select the two stones with the maximum weight and smash them toge...read more
Ans. Removing From List
We will store the stones in a vector/list and run a while loop until the size of the vector/list is greater than 1
 
• Find the index and weight of the two heaviest stones
• Remove those stones from the vector/list using their index
• Add their absolute difference to the vector/list if the absolute difference is greater than 0
Space Complexity: O(1)Explanation:
O(1).
Since we are using constant extra space.&...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round consists of questions based on DSA and CS fundamentals. The interviewer was very nice she helped me whenever I was shucked in the question. Apart from dsa questions were based on DAMS, CN, OOPS, OS, Github.

Q1. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. 
I first found the loop using the concept of slow and fast pointer in link list and I removed the loop from the link list. Then I also told the interviewer that this question can also be solved using hash map.
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was the HR Interview and consists of basic HR interview questions.

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. 
I was able to pass only 1 test case out of 5
Answered Anonymously
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. 
I was able to pass only 3 test case out of 5
Answered Anonymously
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. 
I was able to pass all test cases
Answered Anonymously
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. 
Start the iteration from the right side and keep the track of the maximum array till that particular element of the array.
Answered Anonymously
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. 
First I solved this question in O(n) space and O(n) time then they asked me to optimize it and solve it without extra space.
Answered Anonymously
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. Brute Force
The brute force approach is to use recursion. First, we reach the end of the Linked List recursively and at last node, we return the last node, which becomes the new head of the partially reversed Linked List. While coming back from each recursion call we add the current node in the current recursion call to the last node of the partially reversed Linked List and assign the current node to null.
 
Steps:
&...read more
Answered Anonymously
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. 
Tip 1 : First design the database and show them the database schema
Tip 2 : Then share your approach and data structures which you'll use
 
Answered Anonymously
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?
Ans. 
Tip 1 : The cross-questioning can go intense sometimes, think before you speak.

Tip 2 : Be open-minded and answer whatever you are thinking, in these rounds, I feel it is important to have an opinion.
 
Tip 3 : Context of questions can be switched, pay attention to the details. It is okay to ask questions in these rounds, like what are the projects currently the company is investing in, which team you are mentoring, ...read more
Answered Anonymously
Add your answer
Q2. What do you know about the company?
Ans. 
General Tip : Before an interview for any company, have a brief insight about the company, what it does, when was it founded and so on. All these info can be easily acquired from the Company Website itself.
Answered Anonymously
Add your answer

Q1. Leetcode easy - medum questions
Add your answer
Q2. DSA questions - linkedlist, tree etc
Add your answer

Q1. Design a database for instagram
Ans. 
Database design for Instagram platform
• Create tables for users, posts, comments, likes, followers, and hashtags

• Use primary and foreign keys to establish relationships between tables

• Include fields such as user_id, post_id, comment_id, like_id, follower_id, and hashtag_id

• Implement indexes for faster data retrieval

• Consider scalability and performance optimization techniques
Answered by AI
Add your answer

Q1. Explain how would you react under a condition where your colleague does not agree your ideas
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