Best of Algorithms — June 2025

1. 1
   Video

   The Coding Sloth·48w

   16 Cool GitHub Repos You WILL Use (no pressure)

   A curated list of 16 useful GitHub repositories covering various programming topics including algorithm implementations, free programming books, project tutorials, system design resources, and open source alternatives. The repositories range from beginner-friendly learning materials like roadmaps and free books to more advanced topics like building programming languages and machine learning from scratch. Notable mentions include awesome lists for technology resources, algorithms repository with implementations in multiple languages, and practical tools like free developer services and public APIs.

   376

   8
2. 2
   Article

   freeCodeCamp·49w

   How to Work with Queues in TypeScript

   A comprehensive guide to implementing different types of queues in TypeScript using circular doubly linked lists. Covers simple queues, circular queues, double-ended queues (deque), and priority queues with complete code implementations. Explains FIFO principles, queue operations like enqueue/dequeue, and provides practical examples with test cases. Also discusses when to use queues versus other data structures and potential pitfalls in production systems.

   148

   2
3. 3
   Article

   Hacker News·49w

   Art of Problem Solving

   A comprehensive collection of visual mathematical proofs demonstrating various theorems and identities through geometric diagrams and illustrations. Covers summations (including odd numbers, triangular numbers, and Fibonacci sequences), geometric series, fundamental geometry theorems like the Pythagorean theorem, and advanced concepts like Fermat's Little Theorem. Each proof uses visual arrangements and geometric transformations to make abstract mathematical concepts more intuitive and accessible.

   121
4. 4
   Article

   Medium·48w

   The 5 Most Surprising, Ingenious Data Structures and What They Actually Do

   Explores five advanced data structures that solve complex problems beyond basic arrays and lists: B-Trees for efficient database storage with shallow depth, Radix Trees for fast prefix-based lookups in routing, Ropes for efficient text editing in large documents, Bloom Filters for probabilistic membership testing at scale, and Cuckoo Hashing for constant-time operations using eviction strategies. Each structure addresses specific performance challenges in real-world systems.

   89

   1
5. 5
   Article

   Lobsters·49w

   The fastest way to detect a vowel in a string

   A comprehensive performance analysis of 11 different methods to detect vowels in strings using Python. The study reveals that regex methods significantly outperform traditional loops due to CPython's interpreter overhead and optimized C implementations. Through bytecode analysis and CPython source code examination, the author demonstrates how regex engines use bitmap lookups for character matching, making them surprisingly faster than simple Python loops, especially for longer strings.

   86
6. 6
   Article

   freeCodeCamp·51w

   How to Code Linked Lists with TypeScript: A Handbook for Developers

   A comprehensive guide to implementing linked lists in TypeScript, covering singly linked lists, doubly linked lists, and circular variations. The tutorial provides hands-on implementation of core operations like prepend, append, delete, find, and traverse, with detailed explanations of node structures, pointer management, and time complexity analysis. Each implementation includes complete code examples and testing instructions.

   14
7. 7
   Article

   freeCodeCamp·48w

   How to Write a PHP Script to Calculate the Area of a Triangle

   A comprehensive guide demonstrating three different methods to calculate triangle area using PHP: the base-height formula, Heron's formula for when all three sides are known, and the trigonometric formula using two sides and an included angle. Each approach includes complete PHP code examples, mathematical explanations, time/space complexity analysis, and guidance on when to use each method.

   12

   1