MSManikandan Sinmanikandan4411.hashnode.dev·4d ago · 7 min readJava Collection ComparisonsJava provides different collection types for storing and managing data. Understanding the differences between them is important for Java development, DSA, and interviews. This article covers the most 00
MSManikandan Sinmanikandan4411.hashnode.dev·Oct 1 · 6 min readJava CollectionsJava Collections Framework provides a set of interfaces, classes, and methods for storing and manipulating groups of objects. It makes it easier to store, search, sort, and process data in Java. 1. W00
ASAbirami Sriinabi-blog.hashnode.dev·Sep 2 · 6 min readDay 3 of My 30-Day DSA Journey — Hashing and Map/Set Patterns1. Two Sum — LeetCode 1 Problem Given an array of integers and a target, return the indices of two numbers whose sum equals the target. Approach For every number, I calculate the value I need: needed 00
DKDeendayal Kumawatinddsha441981.hashnode.dev·Aug 21 · 10 min readHow I Built a Cache-Line Aligned Hash Table in Rust That Fits Every Bucket in 64 BytesMost hash tables waste memory. They store data in one place, eviction metadata in another, and chain everything together with pointers. Every lookup chases 2-3 pointers across memory, each one potenti00
VVVidit Vatsindsa-decoded.hashnode.dev·Jul 16 · 5 min readLC-15 3Sum ProblemGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not conta00
VVVidit Vatsindsa-decoded.hashnode.dev·Jul 16 · 2 min readLC 167 Two Sum II - Input Array Is SortedGiven a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1]00
SSowmiyainsowmiya.hashnode.dev·May 7 · 4 min readSolving DSA Series - A word on HashMap and Two PointersHello readers! Welcome to my Solving DSA Problems Series - Part 1 In this piece, we're going to be looking at two of the basic concepts - HashMap and Two Pointers. If these terms doesn't feel familiar00
MYMuhammad Yafi Alhakiminyafi.hashnode.dev·Apr 7 · 2 min readCollections: The "Dynamic Containers"In JavaScript, every Array or Object is dynamic. You can add or remove elements whenever you want. In Rust, we use Collections when we need that same flexibility. Think of Collections as Dynamic Toolboxes. While Primitives like arrays have a fixed s...00
EJEJ Junginejjung.hashnode.dev·Mar 4 · 4 min readOverriding equals() and hashcode()0. Introduction When discussing HashMap in Java interviews, a very common follow-up question appears after explaining hash collisions: "Why do we need to override both equals() and hashCode()?" Howeve00
EJEJ Junginejjung.hashnode.dev·Mar 3 · 4 min readJava HashMap Structure and Hash Collision0. Introduction HashMap is one of the most commonly used data structures in Java. It provides fast key value lookups and is widely used in both application code and system level libraries. Because of 00
