Resource allocation/greedy optimization question: You have a warehouse with N robots. Each robot has a capacity or speed limit (each robot’s speed increases by some factor but has a max cap). You have a target workload W (number of packages). You need to find the minimum number of robots required to finish all work, the fastest way to finish W units.
Rate yourself in SQL, Excel
DFS + design questions
Tell me about your experience, explain your design process
Online Test had 2 Questions of Medium Difficulty.
They mainly asked about experience and knowledge of chemistry
Basic fundamental programming questions, easy to get them through.
DS algo Questions on heaps, arrays, bst. Design round focussed on data modelling, HLDs, choice of tech stack, covering edge cases and fault tolerance.
.NET core, .Net , Jquesy, Webapi, ASP,SQL
Design a fault tolerant payment service with multiple payment gateways
Viewing 2351 - 2360 interview questions