Subscribe
Sign in
Home
Programming
Testing
Distributed Systems
Reliability
Systems
Beyond Code
Inner Brew
š Index
š¬ Discord
Programming
Latest
Top
Discussions
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ā¦
Apr 30
Ā
ā¢
Ā
Teiva Harsanyi
6
Share this post
The Coder Cafe
Ford-Fulkerson Algorithm
Copy link
Facebook
Email
Notes
More
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
Ā
ā¢
Ā
Teiva Harsanyi
4
Share this post
The Coder Cafe
Functors, Applicatives, and Monads
Copy link
Facebook
Email
Notes
More
3
Tidy First?
Tidying are a subset of refactorings. Tidying are the cute, fuzzy little refactorings that nobody could possibly hate on.
Mar 11
Ā
ā¢
Ā
Teiva Harsanyi
9
Share this post
The Coder Cafe
Tidy First?
Copy link
Facebook
Email
Notes
More
Partially Applied Functions vs. Currying
Combining currying with partial application leads to a cleaner and more concise way to break down complex functions into reusable components.
Feb 11
Ā
ā¢
Ā
Teiva Harsanyi
5
Share this post
The Coder Cafe
Partially Applied Functions vs. Currying
Copy link
Facebook
Email
Notes
More
Nested Code
Align the happy path to the left; you should quickly be able to scan down one column to see the expected execution flow
Feb 4
Ā
ā¢
Ā
Teiva Harsanyi
6
Share this post
The Coder Cafe
Nested Code
Copy link
Facebook
Email
Notes
More
Topological Sort
The topological sort is used in various places, especially when handling dependencies. For example, in Homebrew to resolve the package dependencies andā¦
Dec 5, 2024
Ā
ā¢
Ā
Teiva Harsanyi
3
Share this post
The Coder Cafe
Topological Sort
Copy link
Facebook
Email
Notes
More
Graphs
From social networks to maps and even in biology, graphs provide a powerful way to represent and analyze relationships between objects.
Dec 4, 2024
Ā
ā¢
Ā
Teiva Harsanyi
2
Share this post
The Coder Cafe
Graphs
Copy link
Facebook
Email
Notes
More
Binary Heaps
A binary heap is great when we need quick access to the minimum or maximum element in a dataset.
Dec 3, 2024
Ā
ā¢
Ā
Teiva Harsanyi
2
Share this post
The Coder Cafe
Binary Heaps
Copy link
Facebook
Email
Notes
More
Arrays vs. Linked Lists
Linked lists offer better time complexity for certain operations, but can lead to lower performance in practice due to a lack of spatial locality andā¦
Dec 2, 2024
Ā
ā¢
Ā
Teiva Harsanyi
4
Share this post
The Coder Cafe
Arrays vs. Linked Lists
Copy link
Facebook
Email
Notes
More
Gossip Glomers
Gossip Glomers is a fantastic challenge that explores the world of distributed systems.
Nov 28, 2024
Ā
ā¢
Ā
Teiva Harsanyi
3
Share this post
The Coder Cafe
Gossip Glomers
Copy link
Facebook
Email
Notes
More
One Billion Row Challenge
The One Billion Row Challenge is a programming challenge designed to test how fast we can process a file containing 1 billion lines of data.
Nov 27, 2024
Ā
ā¢
Ā
Teiva Harsanyi
2
Share this post
The Coder Cafe
One Billion Row Challenge
Copy link
Facebook
Email
Notes
More
Exercism
Exercism is one of the best ways I know to learn a new programming language.
Nov 26, 2024
Ā
ā¢
Ā
Teiva Harsanyi
4
Share this post
The Coder Cafe
Exercism
Copy link
Facebook
Email
Notes
More
Share
Copy link
Facebook
Email
Notes
More
This site requires JavaScript to run correctly. Please
turn on JavaScript
or unblock scripts