Experience: 1.9 years
College: NSIT, Delhi

Introduction round

• Had an introduction with HR, discussed expected salary and company culture

Round - 1 (DSA Round) (1 hour)

• Had an introduction with the interviewer
• Problem: you are given list of flights (BLR-> DLI, GUR->MUM , MUM->CHN, CHN->DLI). you will be given queries and you need to tell whether you can reach from a station to another (GUR->DLI) ?
• Solution: Intially proposed the solution using Floyd-Warshall precomputation heavy but queries in O(1). (Time: On^3). Interview asked few questions on Dijkstra and Floyd-warshall and told me to give another approach, proposed solution using BFS, no precomputation , each query in O(n) time.
  coded the solution, then asked me to print path also and number of flights also
  Asked to optimize the solution gave him solution where initially we will iterate for all cities and then storing it in 2D array and each query will run in O(1).
• this round went really well (cleared this round got invitation for next round, the next day)

Round 2 (LLD) (1 Hour)

• Had few discussions over the project i made in current company
• Few grindings on scalability of the project
• had discussion for 30 minutes over the resume
• Started with LLD problem: create 4 connect game, 2 users can play the game 1 user will use white coin and other will use black coin. users are given a board 6x7 user cant see the board they can just choose the coloumn in which they can insert the coin. user can't insert the coin in coloumn where all rows got filled. if user wants to insert a coin in an empty column then coin will firstly filled in row 1 then row 2 then row 3 and user is unaware about this, they can only drop coin in a column.
• had 25 minutes to think an write the solution.
• created the design and classes along with sudo code
• cleared the round, received the link for Hiring manager round in next 2 hours

Round 3 (Hiring Manager) (1 hour)

• Discussed projects done in current and previous company for 30 minutes
• solved a DSA problem: given an array of 0 and 1 , you need to convert maximum number of 0 to 1 such that there isn't any adjacent 1(example : [0,1,0,0,0,1] ans: 1 [0,1,0,1,0,1])
• Dicussed expected salary, reason for switching, reason for joining flexport
• This round also went well

Received the rejection after 2 days over mail. Asked for feedback (no response yet)