The interview process began with a technical screening focusing on algorithmic problem-solving. I was presented with two coding challenges: one involving array traversal to count ball collisions based on speed, and another requiring the optimisation of a weighted sum through strategic array sorting. The questions tested fundamental logic and greedy algorithm concepts, with a difficulty level ranging from easy to medium.

Problem 1: Ball Collisions Goal: Count how many times a specific ball at position x collides with others. Logic: A collision happens if a faster ball is behind a slower one.

• Check balls behind x: If any ball to the left of x is faster than x, it will hit x.
• Check balls ahead of x: If x is faster than any ball to its right, x will hit them.