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.
DFS + design questions
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
Topics revolving Android, Kotlin, Networking, Data Structures, Algorithm, Cryptocurrency
Take home assignment: Create a command-line utility written in Go that reads the EXIF data from the images
designing a scalable web application. database indexing to improve query performance.
SQL and Python (pandas, numpy)
Design EMI system for hotel pricing
Could you please share your past experiences
Viewing 2351 - 2360 interview questions