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.