We study algorithms through structured practice
What started in 2014 as evening study sessions has grown into a systematic platform where professionals work through algorithmic problems together.
We focus on implementation rather than theory lectures. Participants write actual code, debug edge cases, and compare different approaches to the same problem.
Our sessions are designed for people who already code but want to strengthen their algorithmic thinking and develop cleaner problem-solving habits.
We run structured online seminars focused on algorithm design. Each session covers a specific algorithmic pattern or technique through hands-on problem-solving. Participants work through implementations in their preferred language, share solutions, and discuss trade-offs between different approaches.
The format emerged from realizing that most algorithm resources teach concepts in isolation. We wanted something more practical where you could see how sorting algorithms actually perform on messy data, or why certain graph traversal methods work better for specific use cases.
Our sessions combine brief conceptual overviews with extended implementation time. You'll spend most of each seminar writing code, testing edge cases, and refactoring based on performance benchmarks. Discussion segments focus on comparing implementations and understanding why certain approaches outperform others.
We cover fundamental algorithms like sorting and searching, then progress into graph theory, dynamic programming, and specialized data structures. The curriculum builds systematically, with each session referencing techniques from previous ones. Participants often revisit earlier problems with new optimization strategies they've learned.
The online format allows you to study from home while still engaging with other developers. Discussion happens through shared code editors and voice channels. You can see how others structure their solutions and get immediate feedback on your implementations.
People who design our curriculum
Our instruction team includes developers who've worked on algorithm-intensive systems and transitioned into technical education. They bring practical implementation experience to session design.
Henrik Löfgren
Henrik builds the foundational modules covering sorting algorithms and basic complexity analysis. He spent six years in backend development before transitioning into technical education.
Astrid Kovalenko
Astrid designs our graph theory and dynamic programming sessions. Her background includes algorithm optimization work for data processing systems handling millions of records daily.
Bjorn Thwaites
Bjorn moderates live discussion sessions and helps participants debug their implementations. He previously worked on search algorithm improvements for an e-commerce platform.
How we run sessions
Implementation first
You spend session time writing actual code rather than watching demonstrations. We provide the problem specifications and test cases, then let you work through implementations with guidance when needed.
Comparative analysis
After implementation, we review multiple solutions side by side. Participants explain their approach and we measure performance differences using benchmark data from actual test runs.
Progressive complexity
Early sessions focus on single algorithms. Later modules combine multiple techniques to solve more complex problems, mirroring how you'd approach real development challenges.