Practice Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Simulate a call stack by processing sequential function call and return traces.
Record the current execution chain as a formatted string immediately after each function call.
Identify the most frequent chain, using maximum depth as a deterministic tiebreaker.

What This Tests

Stack simulation and dynamic state tracking
Frequency counting with hash maps
String formatting and tie-breaking logic

Common Patterns

Hashing

Sorting

Accepted

3.1k/6k

Acceptance Rate52.3%

Test Cases

Input

traces =

Output

Expected