hike logo
Hike· sde intern+fte

[Offer] Hike | SDE intern+FTE (Remote) | Delhi-NCR | Dec 21 (On-campus)

Result
Offer
Location
delhi-ncr
Posted
17 Dec 2021
264 reads

Summary

I successfully secured an offer for an SDE Intern+FTE position at Hike after an on-campus remote interview process in December 2021. The selection included a coding test and three technical rounds, culminating in an HR discussion and a final offer.

How it went

During my on-campus recruitment drive for Hike in December 2021, I went through a comprehensive selection process for the SDE Intern+FTE role. The process began with an online coding test that spanned 1.5 hours and comprised 6 questions: 3 easy, 2 medium, and 1 hard. This was followed by three technical interview rounds, all conducted on the same day.

In Round 1, which lasted 45 minutes, I was asked to provide a detailed introduction about my projects. Following that, I had to discuss all possible solutions and provide code for the 'Minimum insertion or deletion to make string palindrome' problem.

Round 2, also 45 minutes, focused on problem-solving and system design. I explained the N-Queens problem in detail and performed a dry run. Subsequently, I was tasked with designing a Snake and Ladder game, which involved outlining detailed classes and functions. Finally, I addressed the 'Maximum length contiguous subarray with sum k' problem.

The third technical round, shorter at 30 minutes, covered my internship experience and involved solving some tricky output-based questions.

The HR evaluation was integrated throughout the different rounds. At the end, I was presented with an offer, which I accepted.

Questions asked (4)

  1. 01

    Minimum Insertions/Deletions to Make String Palindrome

    Data Structures & Algorithms

    I was asked to discuss all possible solutions and provide the code for finding the minimum number of insertions or deletions required to make a given string a palindrome.

    Open the problem
  2. 02

    N-Queens Problem

    Data Structures & Algorithms

    I had to explain the N-Queens problem in detail and perform a dry run of the solution.

    Open the problem
  3. 03

    Design Snake and Ladder Game

    System Design

    I was tasked with designing the classic Snake and Ladder game, specifying detailed classes and functions for its implementation.

  4. 04

    Maximum Length Contiguous Subarray with Sum K

    Data Structures & Algorithms

    I was asked to solve the problem of finding the maximum length of a contiguous subarray within a given array whose elements sum up to a specific target value k.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Hike 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!