Tag feed

#hash-table

52 posts2 followers

Explore Hashnode

Alternatives

Trending tags this week

PPrajjvalprajjval.hashnode.devMay 31 · 6 min read

Hashing Explained: From Collisions to Real-World Trade-Offs

Most people hear this: Hashing gives O(1) lookup. And suddenly hashing becomes some magical data structure that solves everything. Not really. Hashing is one of the most widely used techniques in so

0

ANAvinash Negidsawithpython.hashnode.devFeb 19 · 7 min read

Hash Tables Didn't Click — And I'm Okay With That

Day 16 into my DSA journey, and today was the first day I sat with Hash Tables. I didn't finish it feeling confident. Every topic before this — linked lists, stacks, queues, BST — had one thing in common. Nodes. I could draw them. I could visualize t...

0

DKDeepak Kambalatwo-sum.hashnode.devFeb 13 · 1 min read

1. Two Sum Hash Map Approach

https://leetcode.com/problems/two-sum/description/ Core Idea While iterating: For each number n Calculate diff = target - n If diff already seen → answer found Else store current number in dictionary Code class Solution(object): def twoSu...

0

JMJoão Marcos Carnieljoaodeveloper.hashnode.devDec 29, 2025 · 4 min read

Reducing Time Complexity From O(n²) to O(n)

Using the Two Sum exercise from LeetCode we can study how a problem can be solved with less complexity. The description of the problem is very simple: Given an array of integers nums and an integer target, return indices of the two numbers such that...

0

GGurpreetcodeanddebtfreejourney.hashnode.devOct 22, 2025 · 7 min read

The Magic Behind Instant Lookups: Understanding Hashing and Java's HashMap

1. Hashing: The Core Concept Hashing is a technique used to convert a large key into a small integer value that serves as an index in an array. This array is called a Hash Table. The primary goal is to achieve near-O(1) (constant time) complexity for...

0

RRedAurtherreleetcode.hashnode.devAug 20, 2025 · 1 min read

Roman to Integer

🧠 Problem Roman to Integer Roman numerals are represented by seven different symbols:Â I, V, X, L, C, D and M. For example,Â 2 is written as IIÂ in Roman numeral, just two one's added together. 12 is written asÂ XII, which is simply X + II. The numb...

0

RRedAurtherreleetcode.hashnode.devAug 20, 2025 · 1 min read

Integer to Roman

🧠 Problem Integer to Roman Roman numerals are represented by seven different symbols:Â I, V, X, L, C, D and M. For example,Â 2 is written as IIÂ in Roman numeral, just two one's added together. 12 is written asÂ XII, which is simply X + II. The numb...

0

RRedAurtherreleetcode.hashnode.devAug 1, 2025 · 1 min read

Longest Substring Without Repeating Characters

🧠 Problem Longest Substring Without Repeating Characters $('TopicExtraction').first().json.dataforblog['Question Text'] 🏷️ Tags hash table, string, sliding window 📊 Difficulty Medium ✅ Success Rate: 33%📥 Submissions: 9,621,884📈 Accepted: 3,175,...

0

RRedAurtherreleetcode.hashnode.devAug 1, 2025 · 2 min read

Two Sum

🧠 Problem Two Sum $('TopicExtraction').first().json.dataforblog['Question Text'] 🏷️ Tags array, hash table 📊 Difficulty Easy ✅ Success Rate: 48.5%📥 Submissions: 13,207,990📈 Accepted: 6,403,821 ❤️ Reactions 👍 Likes: 31242👎 Dislikes: 988 💡 H...

0

RRedAurtherreleetcode.hashnode.devAug 1, 2025 · 1 min read

Longest Substring Without Repeating Characters

🧠 Problem Longest Substring Without Repeating Characters 🏷️ Tags hash table, string, sliding window 📊 Difficulty Medium ✅ Success Rate: 33%📥 Submissions: 9,621,884📈 Accepted: 3,175,843 ❤️ Reactions 👍 Likes: 22941👎 Dislikes: 1027 💡 Hints ...

0

#hash-table

Search Hashnode

#hash-table

Explore Hashnode

Trending tags this week

Hashing Explained: From Collisions to Real-World Trade-Offs

Hash Tables Didn't Click — And I'm Okay With That

1. Two Sum Hash Map Approach

Reducing Time Complexity From O(n²) to O(n)

The Magic Behind Instant Lookups: Understanding Hashing and Java's HashMap

Roman to Integer

Integer to Roman

Longest Substring Without Repeating Characters

Two Sum

Longest Substring Without Repeating Characters