bitbns logo
Bitbns· Backend - Software Engineer (Intern)

Bitbns Interview - Buyhatke Internet Pvt. Ltd.

Result
Rejected
Posted
24 Jun 2023
265 reads

Summary

I interviewed for a Backend Software Engineer (Intern) role at Bitbns. After clearing an online assessment, I proceeded to Technical Interview 1 where I was asked a specific DSA question. Unfortunately, my journey ended there as I was not selected.

How it went

I went through a multi-stage hiring process for the Backend Software Engineer (Intern) position at Bitbns (Buyhatke Internet Pvt. Ltd.).

Hiring Process:

  1. Online Assessment
  2. Technical Interview 1
  3. Technical Interview 2

I successfully cleared the Online Assessment and was selected for Technical Interview 1.

Technical Interview 1:

  • The interview began with an introduction where I talked about myself.
  • Coding Question (DSA): I was presented with the following problem: Given an integer array heights representing the heights of buildings, some number of bricks, and some numbers ladders. If you start your journey from the first building and move to the next building by possibly using bricks or ladders. While moving from building i to i+1:
    • If h[i+1] <= h[i]: you don’t need any ladder or bricks
    • Need h[i+1] - h[i] bricks or 1 ladder
    What’s the farthest we can go if we make the optimal choices?
    Example: Building height = [0,4,12,2,7,3,18,20,3,19], bricks = 12, ladders = 2.
    This is the same problem as Furthest Building You Can Reach on LeetCode.

Result:

I was not selected for the subsequent rounds. Overall, my experience with the interview process was average, and I found the difficulty to be medium.

Questions asked (1)

  1. 01

    Furthest Building You Can Reach

    Data Structures & Algorithms · Medium

    Given an integer array heights representing the heights of buildings, some number of bricks, and some numbers ladders. If you start your journey from the first building and move to the next building by possibly using bricks or ladders. While moving from building i to i+1:

    • If h[i+1] <= h[i]: you don’t need any ladder or bricks
    • Need h[i+1] - h[i] bricks or 1 ladder
    What’s the farthest we can go if we make the optimal choices?
    Example: Building height = [0,4,12,2,7,3,18,20,3,19], bricks = 12, ladders = 2.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

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