HashedIn by Deloitte Interview Questions, Process, and Tips

DSA question based on array and trees.

Q1. First one was based on BS and second one based on Tree.
Add your answer

Q1. Jenkins, docker, k8 qnd cloud
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.

Basic MCQ on DevOps and 2 coding questions

Q1. Technical interview mainly focused on CS Core
Add your answer

Q1. Just the fitment round
Add your answer

Q1. Case stusy based questions
Add your answer
Q2. Telecom industry based question
Add your answer