Role:- Backend - Software Engineer(Intern)

Hiring Process:-

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

Coding Questions:-

Selected for Technical Interview - 1

Technical Interview 1 :-

• Started with an introduction about me.

• Coding Question(DSA):-
  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 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?
  Building height = [0,4,12,2,7,3,18,20,3,19]
  bricks = 12, ladders = 2

• Same problem as:- https://leetcode.com/problems/furthest-building-you-can-reach/

Result:- Not Selected
Experience:- Average
Difficulty:- Medium