Dsa

Background Today, we’ll discuss hashmaps—a fundamental data structure in computer science. I chose this topic while solving the “Two Sum” problem, which required the use of hashmaps to efficiently find a solution. In this post, we’ll cover hash functions, linked lists, and how they come together to form hashmaps. Hashing Let’s start by understanding hashing. Hashing is a process of mapping variable-sized input data (like strings or numbers) to a fixed-size output. This mapping is carried out by a hashing function. ...

Background I’ve recently decided to dive back into data structures and algorithms (DSA). These are fundamental skills for any developer, regardless of the field you’re in, and mastering them can significantly sharpen your problem-solving abilities. Beyond that, DSA is also intellectually stimulating and—dare I say—fun, especially when you’re tackling challenges with a friend. Now seems like the perfect time to revisit these essential topics. Solving Problems In computer science, just like in life, there are often multiple ways to solve a single problem. Each solution comes with its own trade-offs—just like how different recipes for making a cake can require varying amounts of time, effort, and ingredients. Similarly, algorithms have different “costs” in terms of resources. ...