Parse and Reconstruct Stack Trace

Q: Parse and Reconstruct Stack Trace

This question evaluates a candidate's skills in parsing and string processing, hierarchical data structure construction for call-tree reconstruction, and robustness handling of nested causes, abbreviated frames, and malformed input while requiring analysis of time and space complexity.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Given a multi-line stack trace string from a single thread (e.g., each frame is in the form 'at Module::Function(file:line)'), design and implement a parser that: (

extracts the ordered list of frames from most recent to oldest; (
reconstructs the call hierarchy as a tree; and (
identifies the deepest frame associated with the thrown exception. The parser must correctly handle nested causes (e.g., 'Caused by:' sections), abbreviated repeated frames (e.g., '... N more'), and missing or malformed lines. Describe your data structures, time/space complexity, and provide working code for parse and reconstruction.

Parse and Reconstruct Stack Trace

Overview

Comments (0)