🚀 Mastering Hashing in Python: From Brute Force to Optimized Frequency Counting
Feb 9 · 7 min read · 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...
Join discussionDay 1 - Contains Duplicate
Feb 2 · 2 min read · 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...
Join discussionForth Break: Composite Types in GO
Dec 25, 2025 · 6 min read · 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...
Join discussion
Understanding LRU Cache: A Simple Explanation
Nov 12, 2025 · 6 min read · 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...
Join discussionComo Lidar com o Pesadelo do Gerenciador de Buffer
Oct 29, 2025 · 6 min read · 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...
Join discussionThe Magic Behind Instant Lookups: Understanding Hashing and Java's HashMap
Oct 22, 2025 · 7 min read · 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...
Join discussionLeetCode 560. Subarray Sum Equals K - From Intuitive O(n²) to Optimized O(n) solution using HashMap(Med, Java)
Jul 17, 2025 · 3 min read · 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...
Join discussion