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

DSA question based on array and trees.

Q1. First one was based on BS and second one based on 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. 
Check if two binary trees are mirrors of each other based on specific criteria.
• Compare the roots of both trees.

• Check if the left subtree of the first tree is the mirror of the right subtree of the second tree.

• Verify if the right subtree of the first tree is the mirror of the left subtree of the second tree.
Answered by AI
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. 
The problem involves finding the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
• Use dynamic programming to solve the problem efficiently.

• The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

• Handle base cases for N=0 and N=1 separately.

• Consider using modulo operation to avoid overflow for large values of N.
Answered by AI
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. 
Convert Excel column title to corresponding column number.
• Iterate through each character in the input string

• Calculate the corresponding value of each character based on its position in the alphabet

• Multiply the value by 26 raised to the power of its position from the right in the input string

• Sum up all the values to get the final column number
Answered by AI
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. 
Given an array representing digits of a number, add 1 to the number.
• Iterate through the array from right to left, starting with the least significant digit.

• Add 1 to the current digit and check if it becomes 10. If so, set it to 0 and carry over to the next digit.

• Handle the case where the most significant digit needs to be incremented by creating a new array with an extra digit.
Answered by AI
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. 
The task is to determine the total number of ways to make change for a specified value using given denominations.
• Create a dynamic programming table to store the number of ways to make change for each value up to the target value.

• Iterate through each denomination and update the table accordingly based on the current denomination.

• The final value in the table will represent the total number of ways to make change for the ...read more
Answered by AI
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. 
Design a 2-player Tic-Tac-Toe game on an N x N grid where players place their marks to win by getting N marks in a row.
• Create a 2D array to represent the game board.

• Implement a function to check for a win after each move.

• Handle player moves and update the board accordingly.

• Return the result of each move (0, 1, or 2) based on the game state.

• Consider horizontal, vertical, and diagonal win conditions.
Answered by AI
Add your answer