i
HashedIn by Deloitte
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Midium difficulty level and quant and Logical reasoning questions were there along with verbal
I was interviewed in Feb 2022.
I have experience in designing and implementing scalable systems for various projects.
Designed and implemented a microservices-based architecture for a healthcare platform
Developed a distributed system for real-time data processing using Apache Kafka and Spark
Optimized database schema and queries for a high-traffic e-commerce website
Implemented caching and load balancing strategies for a social media platform
Designed a...
I applied via Naukri.com and was interviewed before Mar 2023. There were 2 interview rounds.
I chose HashedIn for its innovative projects and collaborative work culture.
Innovative projects attracted me to HashedIn
I value the collaborative work culture at HashedIn
I appreciate the opportunities for growth and learning at HashedIn
I was impressed by the team's technical expertise during the interview process
I applied via Campus Placement and was interviewed before Oct 2021. There were 5 interview rounds.
The duration of the Test is about 1h 30m
3 Coding questions were given, and the platform was Codilty.
The questions are shuffled.
In my case,
1st question was related to HashMap and fairly simple needs observation
2nd question was related to Array, a basic Array Manipulation question.
3rd question was related to String, which needs optimization.
I was able to solve all three questions, remember there are hidden test cases make sure to consider them and think of possible edge cases.
HashedIn by Deloitte interview questions for popular designations
I applied via Referral and was interviewed in Mar 2022. There were 5 interview rounds.
The coding test was of 2 hours, in which there were 3 questions. The topics which were asked were dynamic programming, strings and graphs. The platform on which it was conducted was codility.
Answering questions on projects, database schema design of Codechef, SQL queries, and CN.
Projects involved developing a web application for managing employee data and a mobile app for tracking expenses.
Database schema design of Codechef involved creating tables for users, problems, submissions, and contests.
SQL queries related to Codechef included retrieving user details, problem submissions, and contest rankings.
Quest...
Get interview-ready with Top HashedIn by Deloitte Interview Questions
I was interviewed in Nov 2021.
Round duration - 90 minutes
Round difficulty - Medium
There were 3 coding questions. questions were implemented based on arrays and trees
Question 1 was Easy
Question 2 was Medium
Question 3 was Medium
all 3 questions were necessary to be selected for the next round.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mir...
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes are visited.
Example: Input binary tree: 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, Output mirror tree: 1 3 2 6 5 4 -1 -1 -1 -1 -1 7 -1 -1 -1
In Ninja town, represented as an N * M
grid, people travel by jumping over buildings in the grid's cells. Santa is starting at cell (0, 0) and must deliver gifts to cell (N-1, ...
Santa needs to find the quickest path to deliver gifts in Ninja town by jumping over buildings with least travel time.
Santa starts at (0, 0) and needs to deliver gifts to (N-1, M-1) on Christmas Eve.
Santa can jump to (x+1, y+1), (x+1, y), or (x, y+1) from any cell (x, y) within grid boundaries.
Travel time between two buildings equals the absolute difference in their heights.
Find the quickest path with least travel time...
Round duration - 60 minutes
Round difficulty - Medium
It was DSA based round where there was some discussion on the project followed by 2 coding questions, I had to explain my approach and write the code on Google Docs.
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
Check if two strings are anagrams of each other by comparing their sorted characters.
Sort the characters of both strings and compare them.
Use a dictionary to count the frequency of characters in each string and compare the dictionaries.
Ensure both strings have the same length before proceeding with the comparison.
Example: For input 'str1 = "spar", str2 = "rasp"', the output should be True.
Given an array of integers denoting the heights of the mountains, find the length of the longest subarray that forms a mountain shape.
A mountain subarray is d...
Find the length of the longest mountain subarray in an array of integers.
Identify peaks in the array where the elements transition from ascending to descending order.
Calculate the length of the mountain subarray starting from each peak.
Track the length of the longest mountain subarray found so far.
Consider edge cases like when there are no mountains in the array.
Round duration - 75 minutes
Round difficulty - Easy
This round mainly revolved around a system design for an e-commerce website, then some DBMS queries followed by interview questions on OS, DBMS, and Computer Networks. Also there was some discussion of project, how it works, why I made the project, etc.
Round duration - 30 Minutes
Round difficulty - Easy
Some HR questions were asked like other offers, Why do you wanna join Hashedin, and strengths and weaknesses.
After that a puzzle was asked which I correctly answered
Tip 1 : DSA is a must (Around 300+ questions)
Tip 2 : Good knowledge of core subjects like DBMS, OS, CN
Tip 3 : 2 Good projects + SQL and queries
Tip 1 : Good formatting of resume, have the knowledge of what you put into your resume
Tip 2 : should be a 1-page resume with at least 2 projects
I applied via Campus Placement and was interviewed before Oct 2022. There were 5 interview rounds.
It was of medium difficulty I don't exactly remember the topics because its been 1.9 years, and it was an on-campus placement for Internship + FTE. But majorly the topics were arrays, linked lists, strings, Binary Search, etc.
I applied via Campus Placement and was interviewed in Feb 2022. There were 4 interview rounds.
3 Questions included of easy, medium and Difficulties
I was interviewed in Sep 2021.
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.
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...
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).
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'.
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.
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.
Round duration - 60 Minutes
Round difficulty - Medium
Timing - 4 pm
It was zoom video call.
This was fitment round. Taken by senior management.
Tip 1 : Do atleast 2 projects
Tip 2 : Complete competitive programming
Tip 3 : Practice more interview Questions particular to the company applying to
Tip 1 : Don't lie on resume
Tip 2 : Try to wrap resume in one page
I applied via Naukri.com and was interviewed before Mar 2023. There were 3 interview rounds.
Leetcode wasy and medium question of array
Designing the architecture for Uber's software system
Use microservices architecture for scalability and flexibility
Implement a robust backend system for handling user requests and driver matching
Utilize real-time data processing for tracking driver locations and ride requests
Incorporate a payment gateway for seamless transactions
Include a rating system for feedback and quality control
Top trending discussions
The duration of HashedIn by Deloitte interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 83 interviews
Interview experience
based on 411 reviews
Rating in categories
Software Engineer
412
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
376
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
206
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer II
173
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Specialist
165
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech