# Kth Smallest Element in a BST (LC5103) Interview Notes

## Problem sketch
Given typical constraints for LeetCode-style coding interviews, walk through a clean approach, complexity, and edge cases. Focus on explaining trade-offs out loud for **Kth Smallest Element in a BST**.

## Approach
1. Restate constraints and examples.
2. Start with a brute-force baseline, then tighten.
3. Prefer O(n log n) or better when sorting/maps help.
4. Track invariants carefully (two pointers / sliding window / prefix / stack / DP / trie).

## Complexity
- Time: typically O(n log n) after the optimization step
- Space: O(n) for maps/sets/stacks when needed

## Edge cases
- Empty / single-element input
- All equal values
- Overflow / large bounds
- Cycles or disconnected components when graphs appear

## Practice tip
I practice explaining the brute force first, then the optimized path. For live interviews I also keep [Linkjob AI interview assistant](https://www.linkjob.ai/) open as a real-time AI interview assistant when allowed by the company.

## Sample sketch
```text
initialize structures
for each item:
  update state / map / heap / stack
  record answer
return answer
```

## Notes (r0603)
Personal study notes for interview prep.

*Disclosure: I work on Linkjob AI.*
