Hashedin SDE 2022 || March 2022 || Bangalore || Selected
- Result
- Offer
- Location
- Bangalore
- Posted
- 12 Jun 2022
Summary
I successfully cleared multiple technical rounds and an HR discussion at Hashedin by Deloitte in Bangalore for an SDE-1 position, ultimately receiving an offer.
How it went
I recently interviewed with Hashedin by Deloitte for an SDE-1 position in Bangalore. My interview process consisted of four rounds, starting with an Online Assessment, followed by two Technical Interviews, and finally an HR discussion. I'm pleased to share that I successfully cleared all rounds and received an offer.
My journey began with an Online Assessment conducted on the Codility Platform. This round comprised three LeetCode medium-level questions, and candidates scoring above the 75th percentile were advanced to the next stage.
The first Technical Interview was an hour-long session held on Microsoft Teams. After a brief introduction, I was asked to share my screen and work on an IDE. The interviewer presented two coding questions sequentially, both of which I managed to solve ahead of time. With some time remaining, the interviewer delved into questions on OOPs, Networks, and some basic SQL queries.
Following this, I proceeded to the second Technical Interview. This round was structured into two parts. The initial 35 minutes were dedicated to a low-level design problem, where I was tasked with designing a Sudoku game. The subsequent 25 minutes involved rapid-fire questions covering core subjects such as DBMS, OS, Computer Networks, and Data Structures and Algorithms.
After successfully navigating these technical challenges, I received an invitation for the final HR Round. This was a brief, 10-minute discussion focusing on my interest in joining the company and addressing any relocation-related queries.
Ultimately, my efforts paid off, and I was offered the SDE-1 role at Hashedin.
Questions asked (3)
- 01
Kth Element in Merged Sorted Arrays
Data Structures & Algorithms
Given two sorted arrays of sizes m and n, find the element at the kth position when the two arrays are merged and sorted. The solution should use O(1) space.
- 02
Triplet Sum
Data Structures & Algorithms · Medium
Find three numbers in an array that sum up to a given target k.
- 03
Design Sudoku Game
System Design
Design a low-level system for a Sudoku game.
How they prepared
My preparation primarily focused on practicing LeetCode problems, particularly those of medium difficulty, to hone my data structures and algorithms skills. Additionally, I reviewed core computer science subjects including OOPs, Networks, DBMS, and Operating Systems, as well as practicing basic SQL queries, which proved beneficial during the technical rounds.