I got a call from a recruiter.

let's keep it simple and straight-forward.

Round-1 : Problem Solving & DSA

i was asked 2 questions -

1. https://leetcode.com/problems/cheapest-flights-within-k-stops/description/

-> I solved it with optimal TC i.e. O(E) using queue. (this took almost 40 minutes as he asked me to write running code and asked me to implement UTs.)

2. Modification of this - https://leetcode.com/problems/non-decreasing-array/description/

-> question was to make it strictly decreasing by changing atmost 1 element (i couldn't solve this one i was thinking loud and discussing and in last 5 minutes i was writing code and time went up and he asked me to stop.)

Even if i got rejected i wanted to post the questions because LC discuss section is where i look forward to for my upcoming interviews and now it's time to give back.

So please upvote this and help others if you find it useful