[Questions were similar to below]

1. Elimination Round: https://leetcode.com/problems/single-element-in-a-sorted-array/description/
2. Round 1: Behavioral Complete
   1. Hard deadline project.
   2. Conflict with manager/peer.
   3. Interesting project (proud of).
   4. Innovative idea.
3. Round 2:
   1. Behavioral → (unknowns in a new project, any work apart from normal job)
   2. Given an array, arr[] of rope lengths, connect all ropes into a single rope with the minimum total cost. The cost to connect two ropes is the sum of their lengths.
   3. Given a linked list sorted in non-decreasing order. Return the list by deleting the duplicate nodes from the list. The returned list should also be in non-decreasing order.
4. Round 3:
   1. Behavioral → (repeat, with questions on my current project)
   2. Design a low level / Machine coding of a package manager (yarn).
5. Round 4:
   1. Behavioral → (calculated risk with minimal data, customer advocation for an idea)
   2. Design a low level of CDN push mechanism to edge nodes any new content in S3.
6. Round 5 (Bar raiser, different team takes this):
   1. Complete Behavioral → (deadline project two examples)