Interview Experience in Hashedin by Deloitte

hashedin logo
hashedin
Offer
February 9, 20252 reads

Summary

I recently interviewed with HashedIn by Deloitte for a software role. The process included an Online Assessment, two rigorous technical rounds covering Data Structures & Algorithms, Core CS concepts, System Design, and a final HR discussion. I successfully advanced through all stages, ultimately receiving an offer.

Full Experience

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.

Interview Questions (9)

Q1
Diamond Inheritance in C++
Other

Explain the concept of diamond inheritance in C++ and how it can lead to ambiguity and the 'deadly diamond of death' problem. Discuss solutions like virtual inheritance.

Q2
Types of Joins in SQL
Other

Describe the different types of joins available in SQL (INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL OUTER JOIN) and provide scenarios where each would be used.

Q3
Virtual Constructor Concept
Other

Discuss the concept of a virtual constructor. Explain why C++ does not directly support virtual constructors and alternative design patterns or techniques to achieve similar polymorphic object creation behavior.

Q4
SQL Query: Find Second Largest Element
Other

Write a SQL query to find the second largest element in a given table.

Q5
Longest Palindromic Subsequence (LCS Variation)
Data Structures & AlgorithmsMedium

Given a string, reverse it and find the Longest Common Subsequence (LCS) between the original string and its reverse. This is effectively finding the Longest Palindromic Subsequence.

Q6
Second Largest Palindromic Subsequence
Data Structures & AlgorithmsHard

After finding the Longest Palindromic Subsequence, identify the second largest palindromic subsequence in the given string.

Q7
Detect Cycle in Linked List
Data Structures & AlgorithmsEasy

Detect if a cycle exists in a singly linked list. The Hare and Tortoise (Floyd's Cycle-Finding) method was discussed.

Q8
Implement Stack using Queue
Data Structures & AlgorithmsMedium

Implement a stack's basic operations (push, pop, top, empty) using only queues.

Q9
Design a Flipkart-type E-commerce App
System DesignHard

Design a high-level e-commerce application similar to Flipkart, including features like product listings, user management, and order processing. I was asked to create API call flow diagrams and a database schema with foreign key references. Additionally, I had to normalize the database and respond to SQL queries based on the created tables.

Preparation Tips

Based on my experience, I'd recommend the following for preparation:

  • Practice LeetCode (Striver Sheet), focusing particularly on Dynamic Programming, Strings, and Array problems.
  • Thoroughly revise core computer science subjects like OOPS, DBMS, and practice common SQL queries.
  • Gain a foundational understanding of System Design, including API design principles and database normalization.
  • Ensure your resume only lists technologies you are genuinely confident in discussing in detail.

Overall, the interview process was well-structured, comprehensively assessing DSA, Core CS, and System Design skills.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!