I applied online. The process took 2 weeks.

Online assessment consisting of 3 data structures and algorithms questions:

• First question was an easy array question.
• Second was a hard heap question.
• Third was a medium 2D dynamic programming question.

DP problem: You are given several service options. For each option $i$, bandwidth[i] is the amount of bandwidth required, and request[i] is the number of requests that can be handled using that bandwidth.

Given a maximum bandwidth limit totalBandwidth, choose a subset of the options so that the total bandwidth used does not exceed totalBandwidth, while the total number of handled requests is as large as possible. Return the maximum number of requests that can be handled.