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

Three Questions were there of dsa and one was sql

Q1. There was question from dsa and sql
Add your answer
Q2. What are assymptotic notation
Ans. 
Asymptotic notation is a way to describe the performance of an algorithm in terms of its input size.
• Asymptotic notation is used to analyze the efficiency of algorithms by focusing on how they behave as the input size approaches infinity.

• Common notations include O (Big O), Ω (Big Omega), and Θ (Big Theta), which represent the worst-case, best-case, and average-case time complexity respectively.

• For example, if an algorit...read more
Answered by AI
Add your answer
Q3. Some questions were from Tree
Add your answer

Topics - There were three question, 1- easy, 2-medium
Medium level questions were from dynamic programming

Q1. Basic question were asked from the topics of OS, OOP, Database and Networking. 1 DSA question was asked.
Add your answer

Q1. Low level system design question was given. Design a database for a online cab booking company.
Add your answer

Q1. Basic HR questions.
Add your answer

1 hour of coding round. Questions mainly from DSA.

Q1. Technical questions based on your resume.
Add your answer

Q1. Genral questions as to why Hashedin.
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

17 candidates were shortlisted for the interview.
There were 2 coding questions asked of easy level. I had to explain my approach and write the code in google doc.

Q1. 
Check if Two Trees are Mirror
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Explanation:
Two trees are considered mirror of each other if...read more
Ans. Recursive Approach
Traverse the tree T in preorder fashion and treat every node of the given tree T as the root, treat it as a subtree and compare the corresponding subtree with the given subtree S for equality. For checking the equality, we can compare all the nodes of the two subtrees.
 
For two trees ‘S’ and ‘T’ to be mirror images, the following three conditions must be true:
1. Their root node’s data must be the sam...read more
Answered Anonymously
Add your answer
Q2. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. Brute Force
One basic approach is to explore all possible steps which can be climbed with either taking one step or two steps. So at every step, we have two options to climb the stairs either we can climb with one step, or we can climb with two steps. So the number of ways  can be recursively defined as :
countDistinctWayToClimbStair ( currStep, N ) = countDistinctWayToClimbStair ( currStep+1, N ) + countDistinctWay...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

The round was held in evening. There were 4 questions asked and the interviewer was more interested in the running code with several test cases rather than my explaination.

Q1. 
Excel Column Number Conversion
Given a column title as it appears in an Excel sheet, your task is to return its corresponding column number.
Example:
Input:
S = "AB"
Output:
28
Explanation:
The seq...read more
Ans. Base 26 Conversion
The process is very much similar to binary to decimal conversion. In this case, the base of the given system is to be taken as 26. Also, in this system 1 is represented as ‘A’, 2 is represented as ‘B’ and so on till 26 is represented as ‘Z’


For example- 
 
CDA can be converted as 3*26*26 + 4*26 + 1
                            ...read more
Answered Anonymously
Add your answer
Q2. 
Increase Number By 1 Problem Statement
Given an array of integers NUM that consists of N elements, where the array represents the digits of a number, your task is to add 1 to this number. The number is po...read more
Ans. Recursive Approach
We can update values by making a recursive algorithm.
 
1. We will make a helper function say SOLVE() which will receive two parameters vector of digits and index and it will return an integer which represents CARRY(a carry is a digit that is transferred from one column of digits to another column of more significant digits).
2. So our base condition is when an index is equal to the size of the vector the...read more
Answered Anonymously
Add your answer
Q3. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered Anonymously
Add your answer
Q4. 
Tic-Tac-Toe Design Problem
Design a 2-player Tic-Tac-Toe game played on an N * N grid where Player 1 uses ‘X’ and Player 2 uses ‘O’. A move is always valid and occupies an empty spot.
If a player places ...read more
Ans. Brute Force
In this approach first, we make a move or place an ‘X’ or ‘O’ with respect to the player on the ‘TIC_TAC_TOE’ grid and then check if the current player wins or not.
 
The steps are as follows:
 
1. We declare an array/list ‘TIC_TAC_TOE’ of size ‘N’ * ‘N’ in which we store ‘X’ or ‘O’.
2. We make a move:
   • Fill ‘X’ or ‘O’ in the ‘TIC_TAC_TOE’ grid with respect to the player.
3. Then we check if the current player has ...read more
Answered Anonymously
Add your answer