Archive - The Coder Cafe

Ford-Fulkerson Algorithm

The maximum flow problem involves finding the highest possible flow that can travel from a source to a sink in a flow network without exceeding edge…

7 hrs ago •

🎉 1,000 Subscribers, 1 Coding Challenge!

We just hit a big milestone at The Coder Cafe! To celebrate, we’re launching our own Discord server and kicking off a coding challenge with prizes.

Apr 23 •

Bloom filters offer a space-efficient solution for checking set membership, trading accuracy for reduced memory usage.

Apr 16 •

So, I Wrote a Book

The Story Behind 100 Go Mistakes and How to Avoid Them

Apr 8 •

Eventually Green Tests (April Fool’s Joke)

With enough time, 97% of failing tests will eventually pass or become irrelevant.

Apr 1 •

March 2025

Lurking Variables

Proactively segmenting data per influencing factors can help discover lurking variables before they lead to misinterpretations.

Mar 26 •

Functors, Applicatives, and Monads

Thanks to constructs like monads, imperative-style code can be reconciled with the purity and declarative nature of functional programming.

Mar 20 •

Post Hoc Ergo Propter Hoc

When temporality becomes causality.

Mar 18 •

Tidying are a subset of refactorings. Tidying are the cute, fuzzy little refactorings that nobody could possibly hate on.

Mar 11 •

Simultaneous Multithreading

What are the key benefits of using Simultaneous Multithreading (SMT) in CPU architecture?

Mar 5 •

February 2025

#nojs-banner { position: fixed; bottom: 0; left: 0; padding: 16px 16px 16px 32px; width: 100%; box-sizing: border-box; background: red; color: white; font-family: -apple-system, "Segoe UI", Roboto, Helvetica, Arial, sans-serif, "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol"; font-size: 13px; line-height: 13px; } #nojs-banner a { color: inherit; text-decoration: underline; } This site requires JavaScript to run correctly. Please turn on JavaScript or unblock scripts