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. 
Convert a given integer number into its corresponding word representation.
• Implement a function that converts the given number into words by breaking it down into its individual digits and mapping them to their word representation.

• Handle special cases like numbers less than 20, multiples of 10, and numbers in the hundreds and thousands place.

• Ensure that there is a space between every two consecutive words and all charac
Answered by AI
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. 
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
• Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.

• Maintain two pointers, slow and fast, where slow moves one step at a time and fast moves two steps at a time.

• If there is a cycle, the fast pointer will eventually meet the slow pointer.

• If the fast pointer reaches the end of the list (null),...read more
Answered by AI
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. 
Designing a social media platform with friend requests and posts.
• Implement user profiles with friend request functionality.

• Allow users to create and share posts on their profiles.

• Include news feed to display posts from friends.

• Implement notifications for friend requests and post interactions.

• Include privacy settings for posts and friend requests.

• Consider implementing features like comments, likes, and shares for posts.
Answered by AI
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. 
Find the maximum sum of any contiguous subarray within an array of integers.
• Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

• At each index, decide whether to include the current element in the subarray or start a new subarray.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Answered by AI
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. 
Find the weight of the last stone remaining after smashing stones together.
• Sort the stones in descending order.

• Simulate the smashing process by repeatedly smashing the two heaviest stones until only one stone is left.

• Return the weight of the last stone, or 0 if no stone is left.
Answered by AI
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. 
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
• Use Floyd's Tortoise and Hare algorithm to detect the loop in the linked list.

• Once the loop is detected, find the start of the loop using the same algorithm.

• Adjust the pointers to remove the loop and return the modified linked list.

• Example: For input 5 2 and elements 1 2 3 4 5, output should be 1 2 3 4 5.
Answered by AI
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