Toy Language: Type Inference and AST

Problem Overview

You are given a toy programming language with the following grammar: Primitives: char, int, float (lowercase strings) Generics: Uppercase letter + number, e.g. T1, T2, T3, ... Tuples: Comma-separated list of primitives, generics, or other tuples enclosed in brackets, e.g. [int, T1, char] or nested [int, char, [int, T1]] Functions:…

• 4 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people