"A ship in port is safe, but that's not what ships are built for." – Grace Hopper
Collection of Go implementations for LeetCode Design problems.
Every solution lives in its own folder and ships with stress tests (randomised, 200k+ operations).
| # | Title | Difficulty | Time | Space |
|---|---|---|---|---|
| 146 | LRU Cache | Medium | O(1) | O(capacity) |
| 155 | Min Stack | Easy | O(1) | O(n) |
| 225 | Stack using Queues | Easy | Push O(n) | O(n) |
| 232 | Queue using Stacks | Easy | amortized O(1) | O(n) |
| 303 | Range Sum Query – Immutable | Easy | Constructor O(n), SumRange O(1) | O(n) |
| 460 | LFU Cache | Hard | O(1) | O(capacity) |
| 705 | Design HashSet | Easy | O(1) amortized (expected) | O(n + m) |
| 706 | Design HashMap | Easy | O(1) amortized (expected) | O(n + buckets) |
| 707 | Design Linked List | Medium | O(1) head/tail, O(n) index ops | O(n) |
| 933 | Recent Counter | Medium | O(n) worst-case | O(n) |
| 1603 | Design Parking System | Easy | O(1) | O(1) |
| 1656 | Design Ordered Stream | Easy | O(1) amortized | O(n) |
go test -race ./... # entire repo
cd 232_queue_using_stacks && go test -v # single problemby Herman Murauyou: LeetCode · Codeforces · LinkedIn
«Корабль в гавани в безопасности, но не для этого строят корабли.» – Грейс Хоппер
Решения задач раздела Design с LeetCode на Go.
В каждой папке – исходный код и стресс-тесты (рандомизированные, от 200 тысяч операций).
| # | Название | Сложность | Время | Память |
|---|---|---|---|---|
| 146 | LRU Cache | Medium | O(1) | O(capacity) |
| 155 | Min Stack | Easy | O(1) | O(n) |
| 225 | Stack using Queues | Easy | Push O(n) | O(n) |
| 232 | Queue using Stacks | Easy | амортизированное O(1) | O(n) |
| 303 | Range Sum Query – Immutable | Easy | Constructor O(n), SumRange O(1) | O(n) |
| 460 | LFU Cache | Hard | O(1) | O(capacity) |
| 705 | Design HashSet | Easy | амортизированное O(1) (ожидаемо) | O(n + m) |
| 706 | Design HashMap | Easy | среднее O(1) | O(n + buckets) |
| 707 | Design Linked List | Medium | O(1) для head/tail, O(n) для операций по индексу | O(n) |
| 933 | Recent Counter | Medium | O(n) в худшем случае | O(n) |
| 1603 | Design Parking System | Easy | O(1) | O(1) |
| 1656 | Design Ordered Stream | Easy | O(1) амортизированное | O(n) |
go test -race ./... # всё сразу
cd 232_queue_using_stacks && go test -v # одна задачаby Herman Murauyou: LeetCode · Codeforces · LinkedIn