I had my Roblox phone screen yesterday. 45 minutes, two problems.
Part 1 was a rate limiter, which I think is a repeat question from the forum. Part 2 was a follow-up: if the request has several fields, rate limit each field separately. Time was pretty tight. Now I wait for the result.
I also finished my Snowflake phone screen yesterday. Two rounds, each one hour of coding, in an editor where you can actually run code, and no AI allowed.
Round 1 was deleting nodes from an n-ary tree and computing the height. When a node is deleted, its children get attached to its parent. It is not the whole subtree being deleted. You are given a list of nodes to delete and have to say what the tree height is afterward. The approach is a bottom-up DFS, and you do not need to actually modify the tree. If you want the code to really run you have to write your own tests, and they asked about complexity too.
The second part of round 1 no longer gave a list. Instead you get a maximum height N and have to find the fewest nodes to delete. What you return is the set of nodes, not a count, and for this part you could write pseudo code. I did not explain this part very smoothly and got a bit stuck.
Round 2 was Connect Four, did_player_connect_four(board, row, col, player). You just count consecutive same-colored pieces in the four directions around the piece that was just placed. After that they asked about complexity, and we also chatted for a while about writing the boundary checks with Python chained comparisons.
They did not ask much else. I am pretty sure I am cooked.
Discussion
Loading comments…