Find Networking Calls
Reported by candidates from Amazon's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
Amazon's October 2024 OA included a networking problem with no explicit pattern hint. You're looking at a graph traversal or connectivity problem dressed up in domain language. The candidate who blanks on BFS or DFS here loses time rebuilding the mental model. StealthCoder reads the problem, identifies the traversal type, and feeds you the template while you're still parsing the problem statement. That's your safety net for the live assessment.
Pattern and pitfall
Networking calls almost always reduce to one of two patterns: counting connected components (union-find or DFS) or finding shortest paths between entities (BFS). The trick is recognizing that 'calls' means edges in an undirected graph. Most candidates overthink the domain language and miss that they're solving a standard graph problem. The pitfall is implementing a half-baked DFS or BFS that doesn't handle disconnected nodes or revisit tracking. StealthCoder spots the pattern instantly and surfaces the right skeleton code, so you don't waste cycles on graph setup during the assessment.
Memorize the pattern. If you can't, run StealthCoder. The proctor sees the IDE. They don't see what's behind it.
You can drill Find Networking Calls cold, or you can hedge it. StealthCoder runs invisibly during screen share and surfaces a working solution in under 2 seconds. The proctor sees the IDE. They don't see what's behind it. Made by an engineer who treats the OA as theater. If yours is tonight, you don't have time to grind. You have time to hedge.
Get StealthCoderRelated leaked OAs
This OA pattern shows up on LeetCode as number of islands. If you have time before the OA, drill that.
You've seen the question.
Make sure you actually pass Amazon's OA.
Amazon reuses patterns across OAs. Made by an engineer who treats the OA as theater. If yours is tonight, you don't have time to grind. You have time to hedge. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Find Networking Calls FAQ
Is this just counting connected components?+
Likely, yes. If the problem asks how many groups of people called each other (directly or transitively), you're counting components. Use DFS or union-find. If it asks shortest call chain between two people, that's BFS. Read the exact question carefully.
Do I need to handle a large graph?+
Almost certainly. Amazon loves scaling questions. If the graph is sparse (edges < nodes squared), DFS or union-find is fast enough. If it's dense, watch your space complexity. Iterative DFS beats recursive to avoid stack overflow.
What's the most common mistake on this question?+
Not resetting visited state between separate test cases or forgetting to handle isolated nodes (people with no calls). Both tank your pass rate silently. Trace through at least one full example before submitting.
How do I prep for this in 48 hours?+
Don't memorize union-find. Know DFS cold: recursive version, iterative version, and how to build an adjacency list from an edge list. One pass through LeetCode 200 (number of islands) gets you 80% of the way.
Will the input be a list of calls or a phone log?+
Amazon usually gives you pairs (caller, callee) or a list of edges. Build your adjacency list as you read. If timestamps or durations are in the input, ignore them unless the problem explicitly asks about duration. Noise is intentional.