HashedIn by Deloitte Full Stack Developer Interview Questions and Answers

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.