Let me tell you one of the experience with m*ot .
Second Technical Round:
A knight has 8 possible moves it can make, as illustrated below. Each move is two squares in a cardinal direction, then one square in an orthogonal direction.
1. Find Minimum Move
2. Print all minimum move
3. Find longest path
4. Print all longest path.
5. Do write code for Queen move as well.
https://leetcode.com/problems/minimum-knight-moves/
https://leetcode.com/discuss/interview-question/124828/tag/179/uber/Implementing everything within 30 minute is justified ?
Update:
Thanks evryone for such warm and supportive comments.
Got Offer from PayPal, Amazon, SIXT , VMWare. Decided to Join PAYPAL