Hashmap on Hitesh Patelhttps://hiteshbuilds.com/tags/hashmap/Recent content in Hashmap on Hitesh PatelHugo -- 0.155.3en-usFri, 13 Mar 2026 00:00:00 +0530How to Group Anagrams: O(n · m log m) Solution Explainedhttps://hiteshbuilds.com/blind-75/group-anagrams/Fri, 13 Mar 2026 00:00:00 +0530https://hiteshbuilds.com/blind-75/group-anagrams/Step by step explanation of how to group anagrams together using sorting and hashmaps, with brute force and optimized solutionsHow to find if string is Valid Anagram: O(n) solution explainedhttps://hiteshbuilds.com/blind-75/valid-anagram/Thu, 12 Mar 2026 00:00:00 +0530https://hiteshbuilds.com/blind-75/valid-anagram/Step by step explanation with how we found two string are anagrams or not with optimizationMinimum Window Substring: Sliding Window Explainedhttps://hiteshbuilds.com/blind-75/minimum-window-substring/Wed, 11 Mar 2026 00:00:00 +0530https://hiteshbuilds.com/blind-75/minimum-window-substring/Step by step explanation with how we reach the solution of how to find the minimum window substring using Brute Force and Sliding WindowLongest Substring Without Repeating Characters: Sliding Window Explainedhttps://hiteshbuilds.com/blind-75/longest-substring-without-repeating-characters/Mon, 09 Mar 2026 00:00:00 +0530https://hiteshbuilds.com/blind-75/longest-substring-without-repeating-characters/Step by step explanation of how to find the longest substring without repeating characters using Brute Force and Sliding Window, including optimization techniques.Blind 75: Two Sum — From Brute Force to Hash Maphttps://hiteshbuilds.com/blind-75/two-sum/Mon, 26 Jan 2026 00:00:00 +0530https://hiteshbuilds.com/blind-75/two-sum/A step-by-step breakdown of how I approached the Two Sum problem in the Blind 75 list, starting from brute force, rejecting incorrect optimizations, and arriving at the optimal hash map solution.