I got the OA the same day I applied, probably a mass send-out. It was almost entirely a math problem, three parts in one hour, and the time was a bit tight.
Part 1: Data Center Registration and Health State Management
Part 2: Computing the Haversine Distance
Part 3: Proximity-Based Routing
A few days later I got the usual HR call. They said I did well on the OA, and asked me to briefly go over my background, the scale of the projects I've worked on, and why Stripe. We had a really nice chat, and then they sent me the VO scheduling link. They suggested booking within two weeks, and when I opened it I saw forty or fifty people scheduled every single day. Scary.
This recruiter is the best recruiter I've dealt with so far. At least I felt respected as a job seeker. There are too many cold HR calls that either ghost you for no reason, or just collect information like a robot and ask things you already filled in on the application.
The VO was also one hour: parsing nested tasks into a map of parent-child relationships.
Root records:
Contain fields like timestamp, task, task_id, and task_name.
Child records:
Contain fields like timestamp, subtask, parent_id, task_id, and task_name.
Tree Connectors:
Render root nodes without any leading connector.
Use ├─ for a non-final child among siblings.
Use └─ for the final child in a sibling group.
The problem itself isn't hard, but the statement is very long, so just reading it took a while, and the output formatting ate some time too. It was split into several parts, and I only finished part two before time ran out. I don't know how many parts were left. The interviewer was a very young engineer with a good attitude, but it felt like he didn't have much interview experience. He basically gave no hints or guidance, and when time ran out he was a little apologetic and said he hoped it hadn't thrown off my rhythm.
After this there is a back-to-back, said to be 3-4 hours, and you can also choose to split it over two days.
Overall the interview experience was very good, and none of the questions tested anything very hard algorithmically.
Discussion
Loading comments…