Location: USA\nYOE: 0\nOA: \n* Variation of Reorder Data in Log Files(https://leetcode.com/problems/reorder-data-in-log-files/)\n* Hard BFS/DFS Matrix Traversal\nPassed all test cases\n\nPhone Screen:\n* Variation of High Five(https://leetcode.com/problems/high-five/) combined with Valid IP Address(https://leetcode.com/problems/validate-ip-address/), \nBasically processing DB files containing bunch of IP metadata to find most frequent ones. Interviewer was very satisfied when I wrote 10/10 code and suggested this would be useful logic for load balancer, basically signaling him my knowledge in distributed systems\n\nOnsite:\n* Variation of Design Search Autocomplete System(https://leetcode.com/problems/design-search-autocomplete-system/)\nWrote working code in 15 min but interviewer grilled me very hard on various tradeoffs you could make and different approaches. He was satisfied after I showed him different way to implement it using backtracking, with proper complexity analysis on every function. In my opinion, 9/10 because I did not point out edge case before interviewer did\n* Best Time to Buy and Sell Stock(https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\nLiterally same question. Went great. No surprise here. 10/10\n* Design Hotel Booking System(OOD)\nDidn\'t really prepare for OOD explicitly but interviewer was very nice and gave me plenty of hints. We spent almost 45 mins together and came to a design we were both happy with. 8/10 because I couldn\'t get it correct in one go and had to do fair amount of refactoring to get it right\n\n\nOverall very positive experience with nice interviewers. Waiting for reply now...\nEDIT: Recruiter said I passed with flying colors today!

Location: USA\nYOE: 0\nOA: \n Variation of Reorder Data in Log Files(https://leetcode.com/problems/reorder-data-in-log-files/)\n Hard BFS/DFS Matrix Traversal\n