Tag feed

#hashmap

122 posts3 followers

Mmytechctomytechcto.hashnode.dev

🚀 Mastering Hashing in Python: From Brute Force to Optimized Frequency Counting

When solving problems in programming, one of the most common tasks is: Count how many times each element appears. This problem looks simple — but when input size becomes very large (millions or billions of elements), a naive approach can crash your...

Feb 97 min read

Hhimanshublogs-himanshu.hashnode.dev

Day 1 - Contains Duplicate

Question Given an integer array nums, return true if any value appears more than once in the array, otherwise return false. Example 1 Input: nums = [1, 2, 3, 3] Output: true Example 2 Input: nums = [1, 2, 3, 4] Output: false Understanding the questio...

Feb 22 min read

JJimmex04jimmexploit.hashnode.dev

Forth Break: Composite Types in GO

Hi everyone! this is Jimmy , and this is the forth article in my series “Breaking Things with Go.” In this series, I document my journey through Jon Bodner’s Second Edition: Learning Go – An Idiomatic Approach to Real-World Go Programming and explore...

Dec 25, 20256 min read

SAShahwar Alam Naqviis-power-of-two.hashnode.dev

LeetCode: Isomorphic Strings

Problem: https://leetcode.com/problems/isomorphic-strings/description/ Code: class Solution: def map_check(self, txt1: str,txt2: str, char_map: dict)->bool: for i in range(len(txt1)): if txt1[i] not in char_map: ...

Dec 14, 20252 min read

IAI am Developeriamdevelopr.hashnode.dev

Understanding LRU Cache: A Simple Explanation

Let’s say you’re building an application where you need to get some data from the database to show to the user. You make a GET request to the backend and write a query there to retrieve the data from the database. Simple, right? While this is the mos...

Nov 12, 20256 min read

JFJefferson Ferreirajefferson-f.hashnode.dev

Como Lidar com o Pesadelo do Gerenciador de Buffer

Após a luta contra o “Byte Fantasma” e a serialização e a deserialização manual (que rendeu algumas boas histórias), havia chegado o momento enfrentar o próximo “boss”: gerenciador de buffer. Basicamente, ele é responsável por fazer a gestão do cache...

Oct 29, 20256 min read

GGurpreetcodeanddebtfreejourney.hashnode.dev

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...

Oct 22, 20257 min read

AHAnni Huanghuanganni.hashnode.dev

LeetCode 560. Subarray Sum Equals K - From Intuitive O(n²) to Optimized O(n) solution using HashMap(Med, Java)

Problem Statement LeetCode 560. Subarray Sum Equals K Given an integer array nums and an integer k, return the total number of continuous subarrays whose sum is equal to k. Example: Input: nums = [1,1,1], k = 2 Output: 2 (subarrays [1,1] at indice...

Jul 17, 20253 min read

AHAnni Huanghuanganni.hashnode.dev

LeetCode 519 Random Flip Matrix (Med, Java, O(1))

Problem Description -519. Random Flip Matrix The "Random Flip Matrix" problem requires implementing a class that can randomly flip cells in an m×n binary matrix from 0 to 1. The class should support two operations: Operations: flip(): Randomly selec...

Jul 14, 20253 min read

AHAnni Huanghuanganni.hashnode.dev

Leetcode 706 Design HashMap - How HashMap is Implemented in Java (Easy, O(n))

Leetcode 706: Design HashMap Problem Summary – Leetcode 706: Design HashMap You're asked to implement a basic HashMap data structure that supports: put(key, value) — insert/update a key-value pair. get(key) — retrieve the value by key; return -1 if ...

Jul 9, 20254 min read

Search Hashnode

#hashmap

🚀 Mastering Hashing in Python: From Brute Force to Optimized Frequency Counting

Day 1 - Contains Duplicate

Forth Break: Composite Types in GO

LeetCode: Isomorphic Strings

Understanding LRU Cache: A Simple Explanation

Como Lidar com o Pesadelo do Gerenciador de Buffer

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

LeetCode 560. Subarray Sum Equals K - From Intuitive O(n²) to Optimized O(n) solution using HashMap(Med, Java)

LeetCode 519 Random Flip Matrix (Med, Java, O(1))

Leetcode 706 Design HashMap - How HashMap is Implemented in Java (Easy, O(n))