Best of Data Structures — May 2025

1. 1
   Article

   freeCodeCamp·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.

   273

   2
2. 2
   Video

   Fireship·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.

   120

   1
3. 3
   Article

   freeCodeCamp·1y

   Recursive Types in TypeScript: A Brief Exploration

   Exploring recursive types in TypeScript, the post highlights how they work in the type world, similar to recursive functions in the value world. It delves into how these types can apply to data structures like trees and linked lists, extends utility types, and unwraps multidimensional arrays. It also discusses the power and cautionary aspects of using recursive types, emphasizing responsible use due to potential compile-time errors and slower type-checking.

   119

   1
4. 4
   Article

   The 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.

   85
5. 5
   Article

   AppSignal·52w

   Ways to Optimize Your Code in Python

   Optimizing Python code enhances performance, reduces resource consumption, and improves scalability. Key methods for optimization include efficient use of data structures like tuples and dictionaries, minimizing global variable usage while promoting encapsulation, utilizing list comprehensions and generator expressions, and leveraging Python's built-in functions and third-party libraries for performance gains. By implementing these strategies, Python developers can create more efficient and scalable applications.

   41