This is the repo where I store every solved problem I encountered during my CS learning process. It has hundreds of solved leetcode tasks as well as tasks from some online competitions. You'll find the list below. Also there are some implemented algorithms from CLRS.
Task | Solution |
---|---|
Nearest Bus Stop From a House | Python |
Non-Adjacent Combination Sum | Python |
Sublist with Largest Min-Length Product | Python |
Smallest Number With No Adjacent Duplicates | Python |
- Binary search
- Binary tree
- Deque
- Heap
- KMP algorithm
- Linear search
- Linked List
- Merge Sort
- Object array representation
- Helper to print binary tree
- Queue
- Two stacks queue
- Really simple sort
- Selection sort
- Stack
- Two queues stack
- Tree
- 22.1-3
- 32.3-1
- Array index and element equality
- Array of array products
- Busiest time in the mall
- Largest smaller BST key
Отборочное задание для наставников курса "Алгоритмы для разработчиков"
Task | Solution |
---|---|
A. Палиндромная конкатенация | Python Golang |
B. Расстановка скобок | Python Golang |
C. Путь по компонентам | Python Golang |
Task | Solution |
---|---|
103715: A | Python |
103715: B | Python |
103715: C | Python |
103715: D | Python |