Hashedin Interviews

My interview journey with HashedIn by Deloitte began with an Online Assessment. It was a 90-minute test featuring three questions: one easy and two medium LeetCode-type problems. A unique aspect was the absence of automated test cases; I had to meticulously code, devise my own custom test cases, identify edge cases, and then submit my solutions.

Technical Interview - Round 1

The very next day, I was shortlisted for the first technical interview round. It kicked off with an introduction where they inquired about my passions and extracurricular activities. We then delved into core subjects like OOPS, C++, and DBMS. They specifically questioned me on:

• Diamond inheritance in C++
• Types of Joins in SQL
• The concept of a Virtual Constructor
• A SQL query to find the second largest element in a table

Following this, I tackled coding questions. The panel consisted of two interviewers, though one was more active. I was asked to write code on paper, but a clear logical explanation was also acceptable. My first coding challenge was a variation of the Longest Palindromic Subsequence problem: given a string, I had to reverse it and find the Longest Common Subsequence (LCS), a common approach from the LeetCode Striver Sheet. After finding an optimal solution for that, they posed a trickier follow-up: finding the second largest palindromic subsequence. This took me some time, and I needed hints, but I eventually arrived at a solution, albeit not the most optimal one. I also solved another DP question involving array partition.

Technical Interview - Round 2

The second technical round started with some fundamental coding questions:

• Detecting a Cycle in a Linked List, where I discussed the Hare and Tortoise method.
• Implementing a Stack using a Queue.

Next was a substantial System Design challenge. I was tasked with designing a high-level application similar to Flipkart, incorporating specific features they outlined. I drew out API call flow diagrams and designed a database schema, complete with foreign key references. They then guided me through normalizing the database, and while I made progress, I couldn't entirely complete it to their exact specifications. Finally, they gave me a SQL query based on the tables I had just designed.

HR Round

The HR round was quite relaxed. We discussed projects from my resume, including my motivations for building them and their technical details. They also asked casual questions, such as my preference between CR7 and Messi, my family background, and personal interests. A memorable situational question was, "What would you do if you received ₹10 crore today?" My understanding is that if you reach the HR round at HashedIn, selection is highly probable, as they selected everyone who made it to this stage.

My interview journey at Hashedin started with an Online Assessment, which comprised three medium-difficulty questions. I managed to solve two optimally and one using a brute-force approach, successfully clearing this round.

Next, I moved on to Technical Round 1, where two interviewers greeted me. The discussion began with my introduction, followed by an in-depth conversation about the projects listed on my resume. Following this, I was presented with three DSA questions:

• Remove Duplicates from Sorted List
• Reorganize String
• A problem on converting a decimal number to its octal representation, similar in concept to converting to hexadecimal.

I recently had the opportunity to interview with Hashedin by Deloitte for an SDE Intern position. The interview process was conducted on-campus and consisted of four rounds: an Online Assessment, two Technical Interviews, and a final HR Round.

OA Round

My journey began with the Online Assessment, which featured three coding questions: one easy, and two medium to hard. I successfully solved all of them within the allotted time. Out of 135 students who attempted this round, 22 of us were selected to proceed.

Technical Interview 1 (~50 min)

This round started with a brief introduction, after which the interviewer delved into core computer science fundamentals, asking questions on topics like Inheritance, Polymorphism, and DBMS. Following this, we moved on to Data Structures and Algorithms. I was asked to solve the 'Reverse Linked List' problem, demonstrating both iterative and recursive approaches, and the 'Rotate Array' problem, which included several follow-up questions. Towards the end, I answered some SQL queries focusing on Joins, and the interviewer seemed satisfied with my responses.

Technical Interview 2 (~1 hr 45 min)

Next was the second Technical Interview, which was a comprehensive session. This round primarily focused on System Design. I was tasked with designing a comprehensive database schema for a Movie Ticket Booking Application, and I was encouraged to think of functionalities independently. The interviewer was very helpful throughout this process, guiding me whenever I encountered difficulties. This design discussion took up about an hour. After the system design, we transitioned back to DSA. The interviewer presented a series of 'Jump Game' problems, specifically 'Jump Game', 'Jump Game II', 'Jump Game III', and 'Jump Game IV'.

HR Round

Finally, I proceeded to the HR Round. This was, unfortunately, the least pleasant part of the entire process. I was quite surprised to be questioned and judged somewhat harshly regarding my CGPA, even though it was above the company's stated criteria. Despite this challenging HR experience, I eventually received an offer.

My interview journey at HashedIn-by-Deloitte for a Python Developer role in Bangalore began after I applied via a referral. Following an initial discussion about my experience and expectations with a recruiter, I proceeded through an online assessment and three interview rounds.

The Online Assessment consisted of two LeetCode medium-level array-related questions involving hashing and sorting, though I don't recall the exact problems.

The Coding Round involved two specific questions. The first asked me to convert a string of digits into its equivalent integer without using any built-in API (e.g., "123" to 123). The second challenge was to find the longest substring that acts as a prefix, an infix, and a suffix within a given string (e.g., "abczygabcpqrabc" yields "abc"). I approached the second problem using a variation of the KMP algorithm.

Next was the LLD Round, which turned out to be quite different from what I expected for a standard Low-Level Design interview. The interviewer presented a scenario: designing an event management campaign portal where a manager could add, start, and stop campaigns at any time. My task was to first outline the process of adding a campaign, thinking through steps like login and navigating to a home page. Following this, I had to define the exact API specifications for this flow, detailing parameters, response structures, and HTTP response codes. I admit I got confused with response codes and struggled a bit with designing the response format. Despite doing this for the first time, I kept pushing through, taking guidance from the interviewer when needed, and managed to clear the round.

Finally, I had a Culture Fit round with a manager. She asked me about my professional journey, my reasons for switching jobs and considering relocation, and why I was interested in HashedIn and this specific role. I was also given the opportunity to ask questions.

The entire process was incredibly fast, concluding within three days, and I ultimately received an offer. While I appreciated the company's culture and the efficiency, I decided to decline the offer as I had other appealing offers from Tekion and Juspay.

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.

I had previously been rejected by HashedIn, which fueled my determination to secure an offer this time, regardless of whether I accepted it. The interview process consisted of three rounds.

DSA Round

The first was a DSA round, which I found relatively easy. It involved an easy-level problem on linked lists, which I solved using the fast and slow pointer approach, and a second problem on binary tree traversal by depth. The interviewer was very good and polite, and also asked me about my projects and what motivates me.

System Design Round

This round was a classic food delivery system design problem. I was asked to design APIs and database tables, and discuss concepts like single points of failure, database scaling, and sharding. Honestly, I haven't worked on these topics directly, but I was able to answer effectively based on my preparation from videos and blogs. The system design round went well, and the interviewer gave positive feedback, saying I was doing very well for my level.

Managerial / Fitment Round

The final round was with a manager who had about 20 years of experience. He asked me to describe a challenging task where I had saved time and money for the company, what motivates me, and if I was okay with working from the office.

After one week, I received a mail stating I was selected, with an offer that was 70% more than my current compensation. However, I was recently involved in some interesting projects that I couldn't leave at that time, so I decided not to join.

As a fresher from the B.Tech CS 2020 batch, I went through the Hashedin recruitment process which started with a written test.

Round 1: Written Test (90 minutes)

This round was divided into two sections. Section A: This section comprised 8 questions, including 2 programming output questions, 2 time-complexity questions, 2 DBMS query questions, 1 programming MCQ, and 1 Computer Network MCQ related to subnets. The difficulty level ranged from very easy to easy. Section B: This section featured 3 programming questions where I was required to write full code, demonstrating well-defined time and space complexity. Out of approximately 600-700 students who took this test, only 9 of us managed to clear it.

Round 2: Technical Interview-1 (70-90 minutes)

In this round, the interviewers primarily focused on my resume, discussing projects I had worked on, and delving into DBMS concepts. Specific questions included:

• Designing a database schema for a fully automated restaurant food ordering system, accompanied by various related design questions.
• Explaining what a URL shortener is, which seemed to be an assessment of my problem-solving skills.
• Some operating system questions, specifically about Deadlocks.

Round 3: Technical Interview-2 (70-90 minutes)

This final technical round mainly focused on Data Structures & Algorithms and further DBMS theory questions. I encountered problems such as:

• Adding a given value to a range [l,r] of an array multiple times and then returning the maximum value in the array after all updates.
• Given a set of flight routes like [[A,B],[A,C],[B,C],[B,D],[D,E]], determining if a route existed to visit all flights and, if so, listing all such routes in lexicographical order.
• Comparing two sentences with space-separated words to determine if they were the 'same', even if the word order didn't match and words might not be exact.
• Finding four elements in an array that sum up to a given number.
• Explaining the ACID properties in database systems.