Skip to content
read0nly
Raw data, clear context.
[
[
[
About Us
Archive
]
]
]
Tag:
algorithms
Two-sum in Python: trade a little memory for one pass
Sep 11, 2026
Top-k selection in Python: stop sorting values you will discard
Sep 9, 2026
Euclid’s algorithm in Python: use remainders instead of repeated subtraction
Sep 7, 2026
Binary exponentiation in Python: use the exponent’s bits instead of counting to it
Sep 4, 2026
Sliding-window maximums in Python: a monotonic deque avoids repeated scans
Sep 2, 2026
Prefix sums in Python: pay once, answer static range totals quickly
Aug 31, 2026
Horner’s method in Python: evaluate polynomials with less repeated work
Aug 28, 2026
Topological sorting in Python: turn dependencies into a build order
Aug 26, 2026
Dijkstra in Python: replace the full scan with a heap
Aug 24, 2026
Subscribe
Subscribed
read0nly
Sign me up
Already have a WordPress.com account?
Log in now.
read0nly
Subscribe
Subscribed
Sign up
Log in
Report this content
View site in Reader
Manage subscriptions
Collapse this bar
read0nly 