Best of Data Structures — February 2025

1. 1
   Video

   YouTube·1y

   I was bad at Data Structures and Algorithms. Then I did this.

   Andrew shares a detailed roadmap on how he learned data structures and algorithms from scratch. Despite not having a computer science degree, he self-taught these concepts using free online resources and various courses, and now works as a software engineer. He emphasizes the importance of Big O notation, recommends resources like YouTube tutorials and certain books, and advises on practical coding practice with platforms like CodeWars and LeetCode. He also suggests using ChatGPT for additional help and maintaining a fun and consistent learning approach.

   490

   11
2. 2
   Article

   Kirupa·1y

   Hash Functions Deep Dive

   Hash functions are essential for efficient data storage and retrieval, password verification, file integrity checking, and digital signatures. This deep dive explains the fundamentals of hash functions, their inputs and outputs, and the criteria that make a good hash function. It also demonstrates how to create a simple hash function in JavaScript and improves it using position weighting. The importance of using existing, well-designed hash functions like MD5 and SHA for critical purposes is emphasized.

   144
3. 3
   Article

   ITNEXT·1y

   The Hidden Cost of JS Arrays

   JavaScript arrays might appear efficient initially but can perform poorly with large datasets due to the nested operations. By replacing `Array.includes` with data structures like `Set`, `Map`, or indexed arrays, you can achieve constant-time lookups, significantly improving performance.

   121

   11
4. 4
   Article

   Hacker News·1y

   research!rsc: Go Data Structures

   Understanding the memory layout of basic Go data types, including ints, floats, structs, arrays, strings, and slices, helps new programmers optimize performance. The post explains how data is represented in memory and the differences in memory management between C-style pointers and Go's new and make functions.

   29
5. 5
   Article

   Community Picks·1y

   Go 1.24 uses Swiss Table, what are they?

   Go's v1.24 introduced a new hash table implementation called Swiss Table, which improves efficiency and memory usage by using a cache-friendly approach and linear probing with SIMD instructions. Unlike the old Map's chaining strategy, Swiss Table keeps collision data nearby, speeding up comparisons and insertions. A new technique called Elastic Hashing has been proposed, which could potentially offer better performance than the current methods. Benchmarks show significant improvements in lookup and insertion times with the new Swiss Table.

   25