Essential session storage is required to sign in. Optional analytics remain off unless you allow them.
Solve at least 12 algorithm problems spanning the core patterns (hashing, two pointers, sliding window, binary search, BFS/DFS, recursion/backtracking). For each: a brute-force baseline, an optimized solution, a written explanation of the optimization, the time/space complexity of both, and tests including edge cases.
≥12 problems spanning the core patterns; the right technique is chosen for each.
Brute-force baseline AND optimized solution per problem; correct Big-O for both, with the optimization explained.
Solutions correct on edge cases and tested.
Explanations make the approach and trade-offs clear.
Use this README structure to make the work reviewable.
DevPath fetches a read-only, size-capped snapshot. Submitted code is never executed.
# Pattern-based problem set with complexity analysis ## Goal Solve at least 12 algorithm problems spanning the core patterns (hashing, two pointers, sliding window, binary search, BFS/DFS, recursion/backtracking). For each: a brute-force baseline, an optimized solution, a written explanation of the optimization, the time/space complexity of both, and tests including edge cases. ## Acceptance criteria - [ ] Pattern coverage: ≥12 problems spanning the core patterns; the right technique is chosen for each. - [ ] Optimization & analysis: Brute-force baseline AND optimized solution per problem; correct Big-O for both, with the optimization explained. - [ ] Correctness & tests: Solutions correct on edge cases and tested. - [ ] Clarity: Explanations make the approach and trade-offs clear. ## Verification - [ ] Document installation and run commands. - [ ] Record automated checks and their exact commands. - [ ] Add representative output, screenshots, or a short demo where useful. - [ ] Confirm failure paths and known constraints. ## Decision log ### Decision title - Context: - Choice: - Alternatives considered: - Tradeoffs: ## Evidence - Link each rubric criterion to the file, test, or artifact that demonstrates it. ## Known limitations - List what is intentionally out of scope and what should be improved next.