fakhir hassanfakhirhassan.hashnode.dev·Jan 25, 2025Grouping Anagrams in Python: Brute Force vs Optimal ApproachAnagrams are words formed by rearranging the letters of another word, like "eat", "tea", and "ate". Grouping anagrams efficiently is a common coding challenge in interviews and competitive programming. In this article, we’ll explore two approaches: ...groupanagram
Himanshu Goyaldsa-patterns-prefix-sum-with-hashmap.hashnode.dev·Dec 17, 2024DSA Patterns: Prefix Sum with Hash Map Technique ✨✨✨Welcome to the first article in our DSA Patterns series, where we discuss commonly used patterns to solve coding problems, particularly for interviews. In this blog, we will break down the Prefix Sum with Hash Map technique—a powerful approach for so...dsapatterns