i
HashedIn by Deloitte
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I was interviewed in Aug 2021.
Round duration - 120 minutes
Round difficulty - Medium
It was conducting in the afternoon, With great environment, and challenging questions
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the target - element exists in a hash set.
If it exists, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice to form a pair.
Return (-1, -1) if no pair is found.
Given a sequence of ‘N’ non-negative integers, A[1], A[2], ..., A[i], ..., A[N]
, where each number represents the height of a vertical line drawn at position 'i...
Find two lines to form a container with maximum water holding capacity.
Use two pointers approach to find the maximum area by calculating the area between the lines and moving the pointers based on the height of the lines.
Keep track of the maximum area found so far.
The area is calculated as the minimum of the two line heights multiplied by the distance between the lines.
Example: For input A = [1,8,6,2,5,4,8,3,7], the ma...
Round duration - 60 minutes
Round difficulty - Medium
Coding + Core CS
Given an array or list of strings called inputStr
, your task is to return the strings grouped as anagrams. Each group should contain strings that are anagrams of one anoth...
Group anagrams in an array of strings based on character frequency.
Iterate through each string in the input array
For each string, sort the characters and use the sorted string as a key in a hashmap to group anagrams
Return the grouped anagrams as output
Round duration - 60 minutes
Round difficulty - Medium
System Design + Core CS
A banking system is a software application that allows customers to perform financial transactions, manage accounts, and access banking services.
The system should have user authentication and authorization mechanisms to ensure security.
It should support various types of accounts such as savings, checking, and loans.
The system should allow customers to deposit, withdraw, transfer funds, and view transaction history.
It s...
Round duration - 60 minutes
Round difficulty - Easy
Simple Basic HR Fitment
Tip 1 : Consistency
Tip 2 : Never Give Up
Tip 3 : Learn from the mistakes
Tip 1 : Simple and short providing the required information
Tip 2 : Single page resume with showing all the multiple projects which have done.
I was interviewed before May 2021.
Round duration - 60 Minutes
Round difficulty - Medium
DSA based along with CS core subject questions.
2 DSA question, one on String manipulation and another was on Array
Basic questions on Operating Systems
You are provided a string STR
of length N
, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters i...
Remove duplicates from a string of lowercase English letters.
Use a set to keep track of unique characters seen so far.
Iterate through the string and add each character to the set if it hasn't been seen before.
Construct a new string by appending characters that are not in the set.
Given an array arr
of length N
consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
Iterate through the array and keep track of the maximum sum subarray seen so far.
At each index, decide whether to include the current element in the subarray or start a new subarray.
Update the maximum sum subarray if the current sum is greater than the previous maximum sum.
Round duration - 50 minutes
Round difficulty - Easy
It was DSA based + Java based + Designing round. You can expect any question related to these topics depending upon Interviewer's choice and how you handle the round.
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
The input is a single string without any leading or trailing...
Determine if a given string is a palindrome considering only alphanumeric characters.
Remove non-alphanumeric characters from the input string.
Compare characters from start and end of the string to check for palindrome.
Handle edge cases like empty string or single character input.
Round duration - 20 Minutes
Round difficulty - Easy
The round here is called Fitment round i.e. to check how much you'll fit into HashedIn culture
Tip 1 : Prepare Data structures and algorithms well
Tip 2 : Prepare CS core subjects well
Tip 1 : Mention coding profiles
Tip 2 : Properly mention projects
I was interviewed before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
3 coding questions were there
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while iterating through the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
Round duration - 60 Minutes
Round difficulty - Medium
2 coding were asked
You are given the arrival and departure times of N trains at a railway station for a particular day. Your task is to determine the minimum number of pl...
Determine the minimum number of platforms needed at a railway station based on arrival and departure times of trains.
Sort the arrival and departure times in ascending order.
Use two pointers to keep track of overlapping schedules.
Increment the platform count when a new train arrives before the previous one departs.
Return the maximum platform count needed.
Round duration - 60 Minutes
Round difficulty - Medium
2 coding questions
Understanding the concept of Lowest Common Ancestor (LCA) in graph theory and computer science is essential.
Consider a rooted tree ‘T’ containing ‘N’ nodes...
The Lowest Common Ancestor (LCA) problem involves finding the lowest node in a tree that is an ancestor of two given nodes.
LCA is the lowest node in a tree that is an ancestor of both given nodes.
The tree is rooted at node 1 for each test case.
Paths from each node to the root are considered to find the LCA.
Constraints include the number of test cases, nodes, queries, and node values.
Time limit for the solution is 1 sec
Round duration - 15 Minutes
Round difficulty - Easy
Basic questions like "tell me about family members and their occupation", "why hashedin" are asked.
Tip 1 : Prepare Data structures regularly
Tip 2 : Have whole knowledge of your project(not only your role)
Tip 3 : Prepare a strategy
Tip 1 : Mention good projects
Tip 2 : Mention your achievements.
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Medium
You are provided with an array/list 'ARR' consisting of 'N' integers and an integer 'TARGET'. The task is to determine if there exist four distinct numbers in 'ARR' such that th...
The task is to determine if there exist four distinct numbers in an array that sum up to a given target value.
Iterate through all possible combinations of four distinct numbers in the array.
Use a nested loop to check all combinations efficiently.
Keep track of the sum of each combination and compare it with the target value.
Return 'Yes' if a valid combination is found, otherwise return 'No'.
Round duration - 50 minutes
Round difficulty - Medium
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.
A...
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.
You're provided with a Binary Search Tree (BST) containing 'N' nodes with integer values and two specific nodes, 'P' and 'Q'.
Your task is to identify th...
Find the lowest common ancestor of two nodes in a Binary Search Tree.
Traverse the BST from the root to find the LCA of the given nodes.
Compare the values of the nodes with the values of P and Q to determine the LCA.
Handle cases where one node is the ancestor of the other or when one of the nodes is the root.
Use recursion to efficiently find the LCA in the BST.
Consider edge cases such as when the nodes are not present i
Round duration - 120 Minutes
Round difficulty - Medium
Given an array or list ARR
consisting of N
integers, your task is to identify all distinct triplets within the array that sum up to a specified number K
.
A t...
The task is to find all distinct triplets in an array that sum up to a specified number.
Iterate through all possible triplets using three nested loops.
Check if the sum of the triplet equals the target sum.
Print the triplet if found, else print -1.
Yes, I was given a schema and asked to write SQL queries based on it.
I was given a schema for a database that included tables, columns, and relationships between them.
I had to write SQL queries to retrieve specific data from the database based on the schema provided.
For example, I was asked to write a query to retrieve all customers who made a purchase in the last month.
I had to understand the schema to correctly write...
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Do prepare for SQL queries
Tip 2 : Try to practice DSA questions
Tip 3 : Go through the projects that you did
Tip 1 : Try to explain your project in 2-3 lines
Tip 2 : Put only those thing that you are confident about
HashedIn by Deloitte interview questions for designations
I was interviewed before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.
Merge K sorted arrays into a single sorted array.
Create a min-heap to store the first element of each array along with the array index.
Pop the smallest element from the heap and add it to the result array.
If the array from which the element was popped has more elements, add the next element to the heap.
Repeat until all elements are merged into a single sorted array.
Round duration - 60 Minutes
Round difficulty - Easy
Tip 1 : Solve basic data structures question
Tip 2 : master in front end or backend
Tip 3 : practice some basic SQL queries
Tip 1 : Keep it short and simple
Tip 2 : Update according to the JD
Get interview-ready with Top HashedIn by Deloitte Interview Questions
I applied via Referral and was interviewed in Oct 2020. There were 3 interview rounds.
Code to find max length subarray matching the given sum
Use a sliding window approach to iterate through the array
Keep track of the current sum and the maximum length subarray
If the current sum exceeds the given sum, move the window's left pointer
If the current sum matches the given sum, update the maximum length subarray
Return the maximum length subarray
CLI snake and ladders game code
Create a board with 100 cells using a 10x10 array
Define snakes and ladders positions as an array of tuples
Use a loop to alternate player turns and move them based on dice roll
Check for snakes and ladders and update player position accordingly
Print the board after each turn and declare winner when a player reaches cell 100
SQL query to retrieve output from given tables
Identify the tables and their relationships
Determine the columns to be selected
Use appropriate join and filter conditions
Group and aggregate data if required
Method overloading is having multiple methods with the same name but different parameters. Method overriding is having a subclass method with the same name and parameters as a superclass method.
Method overloading is used to provide different ways of calling the same method with different parameters.
Method overriding is used to provide a specific implementation of a method in a subclass that is already defined in a supe...
I applied via Approached by Company and was interviewed before Mar 2021. There were 3 interview rounds.
Sort an array of 0s, 1s, 2s in linear time.
Use three pointers to keep track of the positions of 0s, 1s, and 2s.
Traverse the array once and swap elements based on their values.
The final array will have 0s, 1s, and 2s grouped together in that order.
Finding the Kth smallest element in an array.
Sort the array and return the Kth element.
Use a min heap to find the Kth smallest element.
Use quickselect algorithm to find the Kth smallest element.
Divide and conquer approach using binary search.
Use selection algorithm to find the Kth smallest element.
Designing APIs and finding second largest value in SQL query.
For API design, consider RESTful principles and use clear and concise naming conventions.
For finding second largest value in SQL, use ORDER BY and LIMIT clauses.
Consider edge cases such as duplicates and null values.
Test thoroughly to ensure correct functionality.
Check if there exists a pair of numbers in the array that add up to a given sum.
Iterate through the array and for each element, check if the difference between the sum and the element exists in the array using a hash table.
Alternatively, sort the array and use two pointers to traverse from both ends towards the middle, adjusting the pointers based on the sum of the current pair.
Top trending discussions
based on 8 interviews
4 Interview rounds
based on 20 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