Hash tables are one of the oldest and simplest data structures for storing elements and supporting deletions and queries. Invented in 1953, they underly most computational systems. Yet despite their ...

Inverted Search is a data-structure based C project that implements a fast word-search mechanism across multiple text files. The project uses Hashing + Linked Lists to build an Inverted Index, a ...

This is the Obsidian notes for ML & AI learnings purposes based on different sources that one could find with plain language and easy to understand content. The engineering section is being enhanced ...

Abstract: Hash Tables are important data structures for a wide range of data intensive applications in various domains. They offer compact storage for sparse data, but their performance has ...

The Goods and Services Tax Network (GSTN) has issued a new advisory on April 11, 2025, intimating GST registered taxpayers about two changes made in GSTR-3B and GSTR-1/GSTR-1A from the April 2025 tax ...

The original version of this story appeared in Quanta Magazine. Sometime in the fall of 2021, Andrew Krapivin, an undergraduate at Rutgers University, encountered a paper that would change his life.

After looking at the recent GoLang update for curiosity, I noticed one standout item. GoLang now uses Swiss Tables for mapping. I'd not heard of this algorithm, so it took a bit of searching to come ...