Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by HashedIn by Deloitte Team. If you also belong to the team, you can get access from here

HashedIn by Deloitte Verified Tick

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

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

Updated 12 Feb 2025

Top HashedIn by Deloitte Software Developer Interview Questions and Answers

  • Q1. Chocolate Pickup Problem Ninja has a 'GRID' of size 'R' x 'C'. Each cell of the grid contains some chocolates. Ninja has two friends, Alice and Bob, and he wants to coll ...read more
  • Q2. Find K'th Character of Decrypted String You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is ...read more
  • Q3. Reverse the Linked List Given a singly linked list of integers, your task is to return the head of the reversed linked list. Input: The first line of input contains an i ...read more
View all 50 questions

HashedIn by Deloitte Software Developer Interview Experiences

17 interviews found

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

It was conducting in the afternoon, With great environment, and challenging questions

  • Q1. 

    Find All Pairs Adding Up to Target

    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.

    Input:

    The first line ...
  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Container With Most Water Problem Statement

    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...

  • Ans. 

    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...

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Coding + Core CS

  • Q1. 

    Group Anagrams Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

System Design + Core CS

  • Q1. Can you describe the design of a banking system?
  • Ans. 

    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...

  • Answered by AI
Round 4 - HR 

Round duration - 60 minutes
Round difficulty - Easy

Simple Basic HR Fitment

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaB.E/B.Tech, MCA, M.E/M.Tech (CSE and Aligned Branches only) with no active backlogs with 60% or 6.0 CGPA throughout and year of passing must be 2022.HashedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Database Management Systems, Object Orientated Programing, Operating Systems, Computer NetworksTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Consistency
Tip 2 : Never Give Up
Tip 3 : Learn from the mistakes

Application resume tips for other job seekers

Tip 1 : Simple and short providing the required information
Tip 2 : Single page resume with showing all the multiple projects which have done.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(2 Questions)

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

  • Q1. 

    Remove Duplicates from String Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Maximum Subarray Sum Problem Statement

    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.

    Explanation...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

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.

  • Q1. 

    String Palindrome Verification

    Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.

    Input:

    The input is a single string without any leading or trailing...
  • Ans. 

    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.

  • Answered by AI
Round 3 - HR 

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

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaMinimum 7 CGPAHashedin By Deloitte interview preparation:Topics to prepare for the interview - Data structures, Algorithms, Operating System, Java, DatabaseTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare Data structures and algorithms well
Tip 2 : Prepare CS core subjects well

Application resume tips for other job seekers

Tip 1 : Mention coding profiles
Tip 2 : Properly mention projects

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

I was interviewed before May 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

3 coding questions were there

  • Q1. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    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).

  • Answered by AI
  • Q2. 

    Longest Increasing Subsequence Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

2 coding were asked

  • Q1. 

    Minimum Number of Platforms Needed Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

2 coding questions

  • Q1. 

    Lowest Common Ancestor (LCA) Problem Statement

    Understanding the concept of Lowest Common Ancestor (LCA) in graph theory and computer science is essential.

    Consider a rooted tree ‘T’ containing ‘N’ nodes...

  • Ans. 

    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

  • Answered by AI
Round 4 - HR 

Round duration - 15 Minutes
Round difficulty - Easy

Basic questions like "tell me about family members and their occupation", "why hashedin" are asked.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from G L Bajaj Institute of Technology & Management. Eligibility criteriaNAHashedin By Deloitte interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, Software Design, Operating SystemTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare Data structures regularly
Tip 2 : Have whole knowledge of your project(not only your role)
Tip 3 : Prepare a strategy

Application resume tips for other job seekers

Tip 1 : Mention good projects
Tip 2 : Mention your achievements.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Four Sum Problem Statement

    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...

  • Ans. 

    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'.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Medium

  • Q1. 

    Detect and Remove Loop in Linked List

    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.

    Expected Complexity:

    A...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Lowest Common Ancestor in a BST Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

  • Q1. 

    Triplets with Given Sum Problem

    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.

    Explanation:

    A t...

  • Ans. 

    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.

  • Answered by AI
  • Q2. Can you describe a situation where you were given a schema and asked to write SQL queries based on it?
  • Ans. 

    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...

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 20 Minutes
Round difficulty - Easy

  • Q1. Can you tell me about yourself and what new things you did during the lockdown?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaAbove 7Hashedin By Deloitte interview preparation:Topics to prepare for the interview - Arrays, Tree, BST, String, DBMS - SQL queriesTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Do prepare for SQL queries
Tip 2 : Try to practice DSA questions
Tip 3 : Go through the projects that you did

Application resume tips for other job seekers

Tip 1 : Try to explain your project in 2-3 lines
Tip 2 : Put only those thing that you are confident about

Final outcome of the interviewSelected

Skills evaluated in this interview

HashedIn by Deloitte interview questions for designations

 Software Developer Intern

 (1)

 Software Developer Trainee

 (1)

 Software Developer 1

 (1)

 Software Engineer

 (14)

 Software Engineer2

 (7)

 Software Trainee

 (1)

 Backend Developer

 (1)

 Java Developer

 (1)

I was interviewed before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Merge K Sorted Arrays Problem Statement

    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.

    Inpu...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 60 Minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaHashedIn interview preparation:Topics to prepare for the interview - Problem solving, Java, SQL, HIbernate and System designTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Solve basic data structures question
Tip 2 : master in front end or backend 
Tip 3 : practice some basic SQL queries

Application resume tips for other job seekers

Tip 1 : Keep it short and simple
Tip 2 : Update according to the JD

Final outcome of the interviewSelected

Skills evaluated in this interview

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.

Interview Questionnaire 

5 Questions

  • Q1. Write code to find max length subarray matching the given sum
  • Ans. 

    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

  • Answered by AI
  • Q2. Write CLI snake and ladders game code
  • Ans. 

    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

  • Answered by AI
  • Q3. Write an SQL query to given an output from given tables
  • Ans. 

    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

  • Answered by AI
  • Q4. Basic oops concepts
  • Q5. Method overloading vs Method overriding
  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Know basic concepts of oops, data structures, algorithms.
Have an understanding of sdlc, agile methodologies.

Skills evaluated in this interview

I applied via Approached by Company and was interviewed before Mar 2021. There were 3 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Sort an array of 0s,1s,2s in O(n) time.
  • Ans. 

    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.

  • Answered by AI
  • Q2. Kth smallest element in array
  • Ans. 

    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.

  • Answered by AI
Round 2 - One-on-one 

(3 Questions)

  • Q1. Project related questions
  • Q2. Designing of APIs, SQL query to find second largest value
  • Ans. 

    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.

  • Answered by AI
  • Q3. Find if pair sum exists in array
  • Ans. 

    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.

  • Answered by AI
Round 3 - One-on-one 

(1 Question)

  • Q1. Design a data structure to store and search strings like in a dictionary.(basically trie) . And some follow ups for modification according to use cases.

Interview Preparation Tips

Topics to prepare for HashedIn by Deloitte Software Developer interview:
  • Data Structures
  • RDBMS
Interview preparation tips for other job seekers - Practice easy to medium searching, sorting , strings and sliding window questions. Basics of all kinds of data structures and their implementation.

Skills evaluated in this interview

HashedIn by Deloitte Interview FAQs

How many rounds are there in HashedIn by Deloitte Software Developer interview?
HashedIn by Deloitte interview process usually has 3-4 rounds. The most common rounds in the HashedIn by Deloitte interview process are Technical, Coding Test and HR.
How to prepare for HashedIn by Deloitte Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at HashedIn by Deloitte. The most common topics and skills that interviewers at HashedIn by Deloitte expect are AS2, Docker, Github, JIRA and JSON.
What are the top questions asked in HashedIn by Deloitte Software Developer interview?

Some of the top questions asked at the HashedIn by Deloitte Software Developer interview -

  1. Write code to find max length subarray matching the given ...read more
  2. Write an SQL query to given an output from given tab...read more
  3. Designing of APIs, SQL query to find second largest va...read more

Tell us how to improve this page.

HashedIn by Deloitte Software Developer Interview Process

based on 8 interviews

4 Interview rounds

  • Coding Test Round
  • Video Call Round - 1
  • Video Call Round - 2
  • HR Round
View more
HashedIn by Deloitte Software Developer Salary
based on 163 salaries
₹5.2 L/yr - ₹17 L/yr
24% more than the average Software Developer Salary in India
View more details

HashedIn by Deloitte Software Developer Reviews and Ratings

based on 20 reviews

3.9/5

Rating in categories

4.2

Skill development

4.2

Work-life balance

3.8

Salary

3.9

Job security

4.4

Company culture

3.9

Promotions

4.3

Work satisfaction

Explore 20 Reviews and Ratings
Software Engineer
412 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer2
376 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
206 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer II
173 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Product Specialist
165 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare HashedIn by Deloitte with

TCS

3.7
Compare

Infosys

3.6
Compare

Wipro

3.7
Compare

HCLTech

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview