Prescreening - min sum of chocolate after n time of breaking each chocolate into half.(solved with priority Q)
Onsite 1 - More like a data scraping problem. Felt like One to many relationship implementation (solved with a Hashmap)
Onsite 2 - Robot to reach at destination [n,n] index at the array. 3 different variation was asked when I solved the problem. With block, Return the path, return the shortest path. (BFS/DFS) Manager
Onsite 3 - Another Manger and the Hiring Manager, mainly asked very in depth of about one of my most challenging previous work, the guy was really picky(positively saying, I am pretty sure engineers under him will have very good learning curve) and detail oriented.
Onsite 4 - With a senior engineer asked to design a system that generate 3D model with a heavy model and the user is only a few numbers. How do you design this system.