You can expect two technical rounds focusing on DSA topics ranging from arrays to advanced graph problems, key SQL concepts and queries, and detailed discussions on your projects, including design decisions, architecture, challenges faced, optimizations applied, and complete end-to-end implementation.
I applied through college or university. I interviewed at HashedIn by Deloitte (Jaipur, Rajasthan) in Nov 2025
Interview
The first Process goes with online assessment round which consists of 3 DSA questions, the level of the questions are bit-difficult to crack, and then 2 rounds of PI and then HR round.
Interview questions [1]
Question 1
1. String Manipulation
2. LCS- DP
3. Tree Sub-level max length
I applied through college or university. I interviewed at HashedIn by Deloitte (Ahmedabad) in Nov 2025
Interview
Interview Experience – HashedIn by Deloitte (Campus Hiring – Coding Round)
The online test had 3 coding questions, all focused on DSA (strings, sliding window, prefix sums).
Time: 90 minutes
Platform: HirePro
Only DSA coding questions, no MCQs.
Difficulty: Medium–Hard.
Good knowledge of strings, sliding window, prefix-sum, hashing is required.
HirePro gives no partial score: code must pass test cases.
Language allowed: Java/Python/C++.
Interview questions [3]
Question 1
Q1. Search Most Recent Task Containing Keyword
A company keeps a record of tasks added daily. Each task is a string.
Given a list of tasks (oldest first) and a keyword, return the most recently added task that contains the keyword as a substring.
If none contain the keyword → return "Not Found".
Search must begin from the last task backward.
Example
Input:
5
Finish report
Email team
Schedule meeting
Review code
Fix bug
Review
Output:
Review code
Q2. Smallest Subarray Containing All Unique Events
You are given a list of event IDs. You must find the shortest contiguous subarray that contains at least one occurrence of every unique event present in the entire list.
If multiple smallest segments exist → choose the one with smallest starting index.
Output should be the pair: [startIndex, endIndex].
Example
Input:
events = [1, 2, 2, 3, 1]
Output:
[2, 4]
Q3. Count Subarrays Whose Sum Is Divisible by K
You are given:
N: number of days
transactions[]: array of integers
K: positive divisor
Count the number of contiguous subarrays where the sum is divisible by K.
Example
Input:
N = 5, K = 3
transactions = [1, 2, 3, 4, 1]
Output:
4