Bob Belderbos
banner
bbelderbos.bsky.social
Bob Belderbos
@bbelderbos.bsky.social
Co-founder @pybites.bsky.social. Python developer & coach helping devs level up with project-based learning & modern Python. Start here → https://pybit.es
For a previous year / day I learned that you can take the boarding pass as a 10-bit binary number.

Thanks to this I could replace a lot of range/partition code with a single `int(..., 2)`.

Unlocking new mental models! 📈
December 16, 2025 at 4:00 PM
Want a structured plan to bridge the gap between "code contributor" and "technical leader"?
December 15, 2025 at 2:43 PM
Stop waiting for AI to replace you. Start mastering the skills AI cannot replace.
December 15, 2025 at 2:43 PM
The intersection of all three (A ∩ M ∩ S)?

That’s the AI Age Unicorn 🦄 — the technical leader who can execute the vision and lead the team.
December 15, 2025 at 2:43 PM
Architect (A): Defining the technical vision and system strategy.

Engineering Manager (M): Leading and optimizing people and processes.

Senior Software Engineer (S): Mastering complex execution and deep code contributions.
December 15, 2025 at 2:43 PM
I think to thrive the future software engineer 3 most valuable skills will be:
December 15, 2025 at 2:43 PM
Check it out here, any feedback welcome:
github.com/bbelderbos/...
GitHub - bbelderbos/code_quality
Contribute to bbelderbos/code_quality development by creating an account on GitHub.
github.com
December 5, 2025 at 11:05 AM
Cool things I learned:
- work with different panels making a nice layout
- open files in an overlaying Vim window
- fuzzy search to target different repos from within the TUI

Amazingly I have a pretty rich + functioning interface with little over 300 LOC 📈
December 5, 2025 at 11:05 AM
Nice reminder: if you only care about the top K items, reach for heapq instead of a full sort.
December 4, 2025 at 3:00 PM
Refactor:

- sorted(..., key=... )[:top_n] ➡️ heapq.nsmallest(top_n, ...)
- sorted(..., key=..., reverse=True)[:top_n] ➡️ heapq.nlargest(top_n, ...)

Same behaviour, but now it’s O(n log k) instead of O(n log n) when k << n.
December 4, 2025 at 3:00 PM
On Python >= 3.10? Long if/elif chains are prime candidates for this.

And seeing match/case so much in Rust, I appreciate it even more in Python now 🐍😍
December 3, 2025 at 3:00 PM
What other (more_)itertools gems have you used recently? 💬
December 2, 2025 at 2:00 PM
👉 Where have Rust (or other language)-inspired patterns improved your Python the most?
December 1, 2025 at 3:00 PM
--
None of this turns Python into Rust, but borrowing (no pun intended 😄) Rust’s strictness makes your Python code more predictable, easier to refactor, and more pleasant to work in.
December 1, 2025 at 3:00 PM