Mercor SWE Onsite

3 Rounds. 2 Were AI assisted and Claude/ChatGPT easily one shots.

Algo round is:

Find the shortest path between two users in a undirected graph of length k or less. There is an API to get the friends of a user given the user id and token number. The distribution of number of friends is large, so typical BFS does not work. BFS gets the shortest path but you must do a bidirected BFS from both the source and target. Explore the frontier for the side that has a smaller frontier. Stop once you find a path by reaching target/source or a vertex visited from the other side, or if the total depth sums to k. Use concurrency to query the API so you don't get blocked by network to quickly explore the entire layer.

Interviewer seemed inexperienced and did not understand. Let me know if helpful.

Hey wondering what are the questions for the 2 remaining rounds? Wouldnt mind buying from you please DM

how did you get a chance to be interviewed?

匿名用户 发表于 2026-10-23 21:02:21
how did you get a chance to be interviewed?

I applied on the careers page

bibo_ 发表于 2026-10-23 16:27:35
Hey wondering what are the questions for the 2 remaining rounds? Wouldnt mind bu

How can i dm