Mercor Coding Interview Questions

A warm-up on the slowest correct sorting method: try every rearrangement until one comes out in order. The real test is the follow-up, which asks you to predict exactly how much work that brute force does without running it, and it hinges on how repeated values are handled. Expect a discussion of factorial running time and ranking permutations.

A debugging round built around a short function that serialises rows of data to text. It looks almost right, yet it corrupts real-world values and slows to a crawl as the input grows. You will repair the output format, handle awkward characters correctly, and explain where the hidden cost of repeated string building comes from.

A debugging round on a checkout handler that misbehaves when the network or the process fails at the wrong moment. You trace each failure to a concrete sequence of events, make client retries safe, and decide what to do about outcomes that are genuinely unknown at request time.

Investigate complex graph traversal and network analysis techniques to rank influential participants within a referral ecosystem, featured in interview sessions at Mercor. This task challenges you to calculate reach and centrality metrics across directed structures containing potential cycles, requiring robust cycle-detection and path-counting strategies. It is an exceptional test of advanced graph algorithms and performance optimization. Dive into the complete problem statement and optimal architecture by obtaining a subscription.

This Mercor interview question delves into probabilistic modeling to estimate the growth of a referral network over time. You are tasked with calculating the expected total size of the network after a specified number of days, starting with an initial group of users. The model incorporates a daily probability for each person to successfully refer a new user, alongside a lifetime cap on the number of referrals any single individual can make. New users also contribute to growth under the same rules. This problem requires careful consideration of expected values and potentially dynamic programming approaches. The full problem description and a model solution are available with a subscription.

Reported as an interview task from Mercor, this exercise involves designing a specialized data structure to manage directed relationships within a professional referral network. You will need to implement efficient methods for establishing connections and querying immediate associates or downstream candidates within the graph. This challenge examines your object-oriented design capabilities and graph traversal efficiency. Reviewing the complete requirements and optimal code architecture demands a paid subscription.