HashedIn by Deloitte SDE-I Interview Experience | On Campus
Summary
I cleared the online assessment and the first technical interview but was rejected after the second technical interview for a fresher SDE-I position at HashedIn.
Full Experience
Hello Everyone , a final year student from a tier 3 institute here. So Hashed In came on campus for fresher SDE Roles. Every round was an elimination round.
Round 1 Resume Shortlisting : The initial form provided by TnP Cell of the institute had basic requirements and resume.
Round 2: Online Assessment- Around 250 students were shortlisted for the Online Assessment. The shortlisting came exactly after a month from the form filling. There are 3 DSA Questions to be solved within 90 minutes. Here are the problems as far as I remember:
- A question regarding all substrings of a string which can be easily brute forced under O(n^2) as 1 <= n <= 100.
- Given an array of size n consisting integers count pairs of indices (i,j) and i<j such that (arr i) > 3 * (arr j). 1 <= n <= 1e5 , 0 <= arr i <= 1e9. (A classic PBDS application problem).
- Given an integer array and another integer T, find the Largest subarray where frequency of every element >= T. 1 <= n <= 1e5 , 1 <= T <= n. 0 <= arr i <= 1e9.
I was able to solve first two. If you solve 2 out of 3 consider yourself to be qualified for F2F rounds.
Round 3: Face to Face Interviews after 2 weeks from OA. 2 Technical Interviews and 1 HR Fitment Round
Technical Interview 1: A brief introduction of myself and straight onto DSA. Questions:
- Find first non repeating element's index in an integer array or return -1 if impossible. Gave him the solution , he was satisfied then as time was left he threw another question.
- https://leetcode.com/problems/decode-string/description/ I not being very good at recignizing and solving stack problems still somehow figured out that it was a stack problem and tried to explain him the approach but I guess he had to move on. Struggled here a little tbh.
- Given an employees table with salary as one of it's columns print the second and third largest unique salaries. (Felt easy as I had solved and seen similar problems before). Key is using limit and offset wisely.
The interviewer was very friendly and really hinted towards using key algorithms and Data Structure to guide you for the solution. This round lasted around 35-40 minutes.
Verdict: Qualified for Technical Interview 2
Technical Interview 2: A brief introduction about my past Internship Experience and discussion about projects. Then he asked to draw ER diagram and Architecture Diagram of the project and grilling began on LLD and HLD mixed about one of the projects from the resume as the Interviewer was reasonably experienced and also asked OOPs concepts. Struggled here as counter questions happened.
Lasted around 35 minutes and I was really tired by the end of this round.
Verdict: Rejected
Tips: OOPs and DBMS have to be reasonably strong apart from DSA and in DSA get a knack of solving mediums well and also study Design as it's very much real world based and being asked quite often now even for freshers. I was totally inexperienced with design based stuff so I have to take the blame ig.
Anyway all the best to everyone preparing for HashedIn and if you have any queries drop in the comments. Would love to help you out.
Interview Questions (5)
Count Pairs with arr[i] > 3*arr[j]
Given an array arr of size n (1 ≤ n ≤ 10⁵) where each element satisfies 0 ≤ arr[i] ≤ 10⁹, count the number of pairs of indices (i, j) such that i < j and arr[i] > 3 * arr[j].
Largest Subarray with Minimum Frequency T
Given an integer array arr of size n (1 ≤ n ≤ 10⁵) and an integer T (1 ≤ T ≤ n), find the largest (longest) subarray such that the frequency of every element inside that subarray is at least T. Each element satisfies 0 ≤ arr[i] ≤ 10⁹.
First Non-Repeating Element Index
Given an integer array, return the index of the first non‑repeating element. If every element repeats, return -1.
Decode String
Given an encoded string, return its decoded form. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is repeated exactly k times. Nested encodings are possible.
Example: "3[a2[c]]" → "accaccacc".
Second and Third Largest Unique Salaries
Given an employees table that contains a column salary, write a query to retrieve the second and third largest unique salary values.