HASHEDIN _INTERVIEW EXPERIENCE
Summary
I successfully navigated through multiple technical and behavioral rounds at Hashedin, culminating in an offer for both an Internship and a Full-Time Software Engineer position with an 8LPA compensation package.
Full Experience
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.
Technical Round 2 also featured two interviewers. I introduced myself once again, and then they presented a system design scenario: designing a schema or E-R diagram for a vehicle vendor who rents 2-wheelers across six different locations. After discussing the design, I was given another DSA question: Minimum Number of Steps to Make Two Strings Anagram. I cleared this round as well.
Finally, I proceeded to the Fitment Round, which had three interviewers. This round focused on situational questions related to work-life scenarios. I successfully navigated this round too.
In the end, I cleared all rounds and received both an Internship and a Full-Time Employee (FTE) offer with an 8 LPA package.
Interview Questions (5)
I was asked to design a schema or Entity-Relationship (E-R) diagram for a vehicle rental system. The scenario involved a vendor renting 2-wheelers across 6 different locations.
Given two strings s and t of the same length, you want to change s into t. In one step you can choose any character of s and change it to another character. Return the minimum number of steps to make t an anagram of s. An Anagram of a string is a string that contains the same characters with a different (or same) ordering.