Best of Algorithms — May 2025

  1. 1
    Article
    Avatar of freecodecampfreeCodeCamp·51w

    LeetCode Meditations: A Visualized Tour of DSA Concepts (A Handbook)

    A comprehensive handbook covering fundamental data structures and algorithms concepts through visual explanations and code examples. Topics include arrays, hash tables, two pointers technique, sliding window, stacks, binary search, linked lists, trees, heaps, and backtracking. Each concept is explained with practical implementations in JavaScript, TypeScript, and Python, along with time and space complexity analysis. The guide emphasizes understanding core principles rather than memorizing specific problem solutions.

  2. 2
    Video
    Avatar of fireshipFireship·1y

    5 weird (but useful) data structures in computer science

    The post explores five unusual but useful data structures that go beyond the basic ones commonly known in computer science: B trees, radix trees, ropes, Bloom filters, and cuckoo hashing. Each data structure offers unique advantages in handling specific problems, such as reducing search complexity, efficiently managing large strings, and resolving hash table collisions. Additionally, a new VS Code extension by Code Rabbit is introduced, enhancing code review processes.

  3. 3
    Article
    Avatar of francofernandoThe Polymathic Engineer·1y

    Hashing in Coding Interviews

    Hash tables and sets are essential data structures for coding interviews due to their efficiency in checking existence and counting elements. They can optimize solutions by improving algorithm time complexity, often reducing it from O(n^2) to O(n). While these structures involve space-time trade-offs, their ability to handle large inputs and constraints efficiently makes them invaluable in software engineering challenges.

  4. 4
    Video
    Avatar of lauriewiredLaurieWired·51w

    making computers multiply FASTER! (matrix hacking)

    Matrix multiplication optimization has evolved from the naive O(n³) approach to more efficient algorithms like Strassen's method, which reduces complexity to O(n^2.807). New research from Austria's Institute for Algebra introduces novel optimization techniques using flip graph search algorithms to find minimal multiplication operations for specific matrix dimensions. These optimizations are crucial for applications in machine learning, graphics, and high-frequency trading, though their effectiveness depends on factors like matrix size, hardware architecture, and whether computation or memory bandwidth is the limiting factor.

See all Algorithms archives