Set 32 - Binary Search LC #4
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 4. Median of Two Sorted Arrays | Hard | Binary Search | Video |
| Wrap up MNIST CNN: refactor, save checkpoints, write short summary |
Deliverables
- Write a 1-line invariant for each problem.
- Note 1 edge case or pitfall per problem.
- Record time-to-first-correct solution.
Notes
- LC 4: partition arrays; ensure left <= right.
Review
- Time spent + where you got stuck?
- Biggest mistake or missed edge case?
- One concrete improvement for next time.
Comments
Share your approach or ask questions
?
|
Markdown supported
Sign in to post
Loading comments...