Hashedin | SE | G.L. Bajaj, Greater Noida | 8 Sept 2019 [Reject]

Result
Rejected
Location
g.l. bajaj, greater noida
Posted
10 Sept 2019
327 reads

Summary

I interviewed for a Software Engineer position at Hashedin as a fresher, applying directly from campus at G.L. Bajaj, Greater Noida. My interview process on September 8, 2019, involved a comprehensive written test and two subsequent technical rounds, which unfortunately concluded with a rejection.

How it went

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.

Questions asked (11)

  1. 01

    Maximum Palindrome Length

    Data Structures & Algorithms · Easy

    Given a string, I can delete characters as many as I want and displace characters wherever I want. I had to return the maximum length of a palindrome that can be formed.

  2. 02

    Path in Maze Matrix

    Data Structures & Algorithms · Easy-Medium

    Given a maze-matrix where every cell can have two values: 0 (blocked) or 1 (free). One cell has value 2 (starting point) and one cell has value 3 (destination point). I had to find if it's possible to find a way from 2 to 3.

  3. 03

    Maximize K by Removing Array Elements

    Data Structures & Algorithms · Medium

    Given an array of positive numbers, e.g., arr = [1,2,3,4,5]. I had to select the i-th element, multiply it with its (i-1)-th and (i+1)-th elements, and add this value to K. Then, remove this i-th element from the array. This process repeats until all elements are removed. For corner elements, 1 is considered as their side element. I needed to return the maximum K possible. For example, for arr = [1,2,3,4,5], the maximum K possible is 60+30+10+5+5.

  4. 04

    Database Schema for Restaurant Food Ordering System

    System Design

    I was asked to design a database schema for a fully automated system for ordering food at a restaurant, along with different questions related to the design process.

  5. 05

    URL Shortener Design

    System Design

    What is a URL shortener? They wanted to assess my problem-solving skills with this question.

  6. 06

    Operating System - Deadlocks

    Other

    I was asked some OS questions, specifically about Deadlocks.

  7. 07

    Range Update and Max Query on Array

    Data Structures & Algorithms

    Given an array of integers, I needed to add a given value to a range of [l,r] of the array many times. Finally, I had to return the maximum value in the array after all changes.

  8. 08

    Flight Routes to Visit All

    Data Structures & Algorithms

    Given flight routes, for example, [[A,B],[A,C],[B,C],[B,D],[D,E]]. I had to tell if there was any route possible to visit all flights. If possible, I needed to give all routes in lexicographical order.

  9. 09

    Check if Sentences are Same (Word Order Irrelevant)

    Data Structures & Algorithms

    Given two sentences of space-separated words. Words in one sentence may or may not be exactly present in the second sentence. I had to tell whether these were the same sentence or not, where the order of words was not needed to be the same.

  10. 10

    Four Sum Problem

    Data Structures & Algorithms

    Given an array, find 4 elements whose sum is a given number.

  11. 11

    ACID Properties

    Other

    I was asked what the ACID properties are.

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!