Round 1: Online Coding Test

• 2 questions, 120 minutes
• Explanation with time complexity and space complexity:
  • Array Manipulation question (not remembered)
  • Rotting Oranges (LeetCode: medium)

Round 2: Technical Interview

No discussion on projects; direct coding questions were given.

You are riding a bus, moving in the East direction (the bus direction will not change). Given the capacity of the bus 'c' and an array such that [numberOfPassengers, PickUpLocation, DropLocation], check if you can drop all the passengers at their destinations. Return true or false.

Example:

• Bus capacity, c=4
• [[3,1,5],[2,2,6]] -> Returns false

Round 1: Online Coding Test

• 2 questions, 120 minutes

• Explanation with Time Complexity and Space Complexity:

  • Array Manipulation question (details not remembered)
  • Rotting Oranges (LeetCode: Medium)

Round 2: Technical Interview

• No discussion on projects; direct coding questions were given.

• You are riding a bus, suppose in the East direction (bus direction will not change). Given the capacity of the bus 'c' and an array such that [numberOfPassengers, PickUpLocation, DropLocation]. Check if you can drop all the passengers at their destinations. Return true or false.

  Example:

  Bus capacity, c = 4 [[3,1,5],[2,2,6]] -> Return false