Forem

Algorithms

Heap, Binary Tree, Data Structure it doesn't matter. This tag should be used for anything Algorithm & Data Structure focused.

Posts

👋 Sign in for the ability to sort posts by relevant, latest, or top.
LeetCode и алгоритмы: подготовка к стажировке

LeetCode и алгоритмы: подготовка к стажировке

Comments
1 min read
Graph Problems in Coding Interviews: BFS, DFS, and Beyond
Cover image for Graph Problems in Coding Interviews: BFS, DFS, and Beyond

Graph Problems in Coding Interviews: BFS, DFS, and Beyond

1
Comments
7 min read
2026 Goldman Sachs Coding Interview Real Questions & Solutions
Cover image for 2026 Goldman Sachs Coding Interview Real Questions & Solutions

2026 Goldman Sachs Coding Interview Real Questions & Solutions

Comments
2 min read
Count-Min Sketch

Count-Min Sketch

Comments
8 min read
Solving School Timetabling with Physics: A Simulated Annealing Approach 🏫⚛️
Cover image for Solving School Timetabling with Physics: A Simulated Annealing Approach 🏫⚛️

Solving School Timetabling with Physics: A Simulated Annealing Approach 🏫⚛️

Comments
2 min read
I built a tool that visualizes your code step by step — Recursive
Cover image for I built a tool that visualizes your code step by step — Recursive

I built a tool that visualizes your code step by step — Recursive

5
Comments
1 min read
Greedy Arrays in PHP
Cover image for Greedy Arrays in PHP

Greedy Arrays in PHP

Comments
1 min read
How I built a Game Theory engine in C++

How I built a Game Theory engine in C++

1
Comments
2 min read
GN: Domain-Adaptive Lossless Compression for LLM Conversation Streams

GN: Domain-Adaptive Lossless Compression for LLM Conversation Streams

Comments
6 min read
I Built a Compression Algorithm That Beats Gzip in 2 Weeks. I Have an A+ Cert.
Cover image for I Built a Compression Algorithm That Beats Gzip in 2 Weeks. I Have an A+ Cert.

I Built a Compression Algorithm That Beats Gzip in 2 Weeks. I Have an A+ Cert.

Comments
7 min read
HyperLogLog and Probabilistic Data Structures

HyperLogLog and Probabilistic Data Structures

Comments
9 min read
Why Mahjong AI is 10x Harder Than Go AI (And What We Learned Building One)

Why Mahjong AI is 10x Harder Than Go AI (And What We Learned Building One)

Comments
4 min read
Building AI for a 2v2 Card Game: How We Solved Cooperative Imperfect Information

Building AI for a 2v2 Card Game: How We Solved Cooperative Imperfect Information

Comments
4 min read
Bloom Filters and their Applications

Bloom Filters and their Applications

Comments
10 min read
A Gomoku AI With Minimax, Alpha-Beta Pruning, and Pattern-Based Evaluation

A Gomoku AI With Minimax, Alpha-Beta Pruning, and Pattern-Based Evaluation

Comments
3 min read
👋 Sign in for the ability to sort posts by relevant, latest, or top.