I've compiled some of the most useful resources for DSAs, interview practice sites, commonly asked technical questions, and sites to build practical projects.

Dive into the intricacies of databases, starting from the simplest key-value store using bash functions to the complexities of LSM trees and B-trees.

Learn the key stages of implementation, the role of tools like FastAPI, and the significance of algorithms like ANNs in creating personalized experiences.

Learn about Bloom filters: memory-efficient data structures using hashing for fast set membership queries.

Learn about using maps in Go (golang), including associative arrays, hash maps, collision handling, and sync.Map, with practical code examples.

Data structures are a serious tool to store data conveniently. Modern applications have the flexibility to organize the data in the memory or on disk using vari

While a linked list is primarily a write-only and sequence-scanning data structure, it can be optimized in different ways.

8/2/2024: Top 5 stories on the HackerNoon homepage!

Learn about bloom filters, pros/cons and their applications.

Insert ordered sequences with a string-based algorithm that avoids recalculations, perfect for large datasets in product lists, chats, or task management.

Short article about bloom filters