hashedin logo
Hashedin· Software Engineer Intern

HASHEDIN _INTERVIEW EXPERIENCE

Result
Offer
Posted
8 Apr 2024
341 reads

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.

How it went

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:

I successfully solved all three problems and advanced to the next round.

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.

Questions asked (5)

  1. 01

    Remove Duplicates from Sorted List

    Data Structures & Algorithms · Easy

    Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.

    Open the problem
  2. 02

    Reorganize String

    Data Structures & Algorithms · Medium

    Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same. If possible, output any possible result. If not possible, return the empty string.

    Open the problem
  3. 03

    Convert Decimal to Octal Number

    Data Structures & Algorithms · Easy

    The problem was to convert a decimal number to its octal representation, similar in concept to converting a number to hexadecimal.

    Open the problem
  4. 04

    Vehicle Rental System Schema Design

    System Design

    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.

  5. 05

    Minimum Number of Steps to Make Two Strings Anagram

    Data Structures & Algorithms · Medium

    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.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Hashedin recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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