# Parse Lisp Expression: Study Guide

Parse Lisp Expression shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Tokenize the expression (spaces, parentheses, integers, symbols). Evaluate recursively: (add x y), (mult x y), or nested (let v1 e1 ... expr) which extends an environment map and evaluates expr in that scope. A variable lookup walks the innermost scope first.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Treating let as assigning only one variable, or evaluating variables before the let bindings are applied in order.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview copilot.