Status: 2.10 YOE
Position: Data Engineer
Location: Hongkong

Round 1: Problem Solving

• Question: Given a list of users and their login events (Success or Fail), flag users who have failed consecutively for exactly k times. Conceptually similar to Max Consecutive Ones but with string events and tracking user IDs: https://leetcode.com/problems/max-consecutive-ones/

Verdict: I initially missed an edge case but was able to debug and solve it during the interview. However, I was rejected. Jane Street has an extremely high bar, and I assume they were looking for a completely flawless first-pass execution.