Did the Unity OA last week for a new grad SWE role. Posting this because there's almost nothing current out there and I was going in blind.
Platform: HackerRank. Standard setup. 90 minutes, two problems.
Difficulty: One medium, one medium-hard. Neither felt like a standard LeetCode clone. The first was a graph traversal problem with a game-world framing (think: pathfinding on a tilemap with blocked cells and weighted edges). The second involved some simulation logic that I'd loosely compare to event scheduling. Not pure implementation, needed real thought on the data structure choices.
What I noticed: No output-matching gotchas, they had multiple test cases including edge cases for empty grids and single-node scenarios Time limit per problem was generous enough that brute force probably passes some cases but not all No SQL, no regex, no trivia, straight algorithmic coding
My prep: I'd done about 80 LeetCode problems, mostly medium graph and tree problems. That was enough to approach the questions but not to solve them cleanly. If I'd had another week I'd drill dynamic programming and heap-based problems specifically.
Did I pass? Yes, recruiter moved me to the phone screen. So something went right.
For context: I'm a 2025 grad applying to the Runtime team. The role specifically mentioned C++ but the OA was language-agnostic (I used Python).
Let me know if questions, happy to share more detail on the problem structure without spoiling the actual problems.