Best of Data Structures — June 2025

1. 1
   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
2. 2
   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
3. 3
   Article

   Planet Python·49w

   A Python dict that can report which keys you did not use

   A custom Python dictionary class that tracks which keys have been accessed, helping developers identify unused data fields in their applications. The TrackingDict class extends the built-in dict and maintains a set of accessed keys, providing properties to check both accessed and never-accessed keys. This is particularly useful for optimizing database queries, ensuring complete test coverage, and identifying redundant data retrieval in applications.

   19

   2
4. 4
   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