Skip to content
This repository was archived by the owner on Jul 2, 2024. It is now read-only.

Commit c640c21

Browse files
committed
Updated changelog, added module-level docstrings
1 parent a7b4877 commit c640c21

File tree

2 files changed

+38
-0
lines changed

2 files changed

+38
-0
lines changed

CHANGELOG.rst

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,30 @@
1+
###############
2+
Release 2023-01
3+
###############
4+
5+
***********************
6+
Basic Python Challenges
7+
***********************
8+
9+
Recursive Algorithms
10+
====================
11+
12+
Added factorial and fibonacci number calculation functions.
13+
14+
Dynamic Programming
15+
===================
16+
17+
Implemented the most common challenges (and solutions):
18+
19+
- fibonacci number getter function
20+
- grid travel challenge
21+
- target number against sequences of numbers checkers (can get, generate chunk)
22+
23+
Binary Search
24+
=============
25+
26+
Added binary search algorithm challenge: find strings starting with prefix.
27+
128
###############
229
Release 2022-11
330
###############

src/bisearch/prefix.py

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
"""
2+
Prefix challenge
3+
================
4+
5+
The objective is to get all strings, that start with a specified prefixes,
6+
from the sorted collection.
7+
8+
The most efficient way is to use binary search algorithm for this task.
9+
10+
"""
11+
112
from typing import List
213

314

0 commit comments

Comments
 (0)