MManikandan S3d ago · 5 min readHashtable in Java1. Introduction to Hashtable Hashtable is a legacy Java class that implements the Map interface. It stores data as key-value pairs and is synchronized, making its individual operations thread-safe. Symanikandan4411.hashnode.dev
MManikandan S6d ago · 6 min readTreeMap in Java1. Introduction to TreeMap TreeMap is a Java class that implements the NavigableMap interface. It stores key-value pairs sorted by keys. Syntax TreeMap<KeyType, ValueType> map = new TreeMap<>(); Exammanikandan4411.hashnode.dev
MManikandan SOct 21 · 5 min readLinkedHashMap in Java1. Introduction to LinkedHashMap LinkedHashMap is a Java class that implements the Map interface. It stores key-value pairs and maintains insertion order by default. Syntax LinkedHashMap<KeyType, Valumanikandan4411.hashnode.dev
MManikandan SOct 19 · 6 min readHashMap in JavaIntroduction to HashMap HashMap is a Java class that implements the Map interface. It stores data as key-value pairs. Keys must be unique, but values can be duplicated. It does not guarantee insertionmanikandan4411.hashnode.dev
MManikandan SOct 5 · 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 manikandan4411.hashnode.dev
MManikandan SOct 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. Wmanikandan4411.hashnode.dev
AAbirami SriSep 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 abi-blog.hashnode.dev
DDeendayal KumawatAug 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 potentiddsha441981.hashnode.dev
VVidit VatsJul 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 contadsa-decoded.hashnode.dev
VVidit VatsJul 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]dsa-decoded.hashnode.dev
