Group Anagrams

In this video, I solved the LeetCode problem "Group Anagrams" using Sorting and Hash Map. Problem: Given an array of strings strs, group the anagrams together. Anagrams are words that contain the same characters but in a different order. Approach: We use a hash map where: * Key = sorted version of the word * Value = list of words having the same sorted form Steps: * Traverse each word * Sort the characters of the word * Use the sorted word as a key * Store the original word in the corresponding group * Finally, collect all groups into the result This works because anagrams become identical after sorting. Time Complexity: O(n * k log k) Space Complexity: O(n * k) GitHub Link: https://github.com/Kumar-Aditya-DEV/Leetcode-Questions LeetCode Profile: https://leetcode.com/u/Aditya-Kumar-DEVP/ LinkedIn: https://www.linkedin.com/in/aditya-kumar-060ba6376/ Notes: * Uses Sorting and Hash Map * Important string grouping problem * Common interview question * Easy to understand approach Language: C++ If this helped you, Like, Share and Subscribe for more coding content. #leetcode #cpp #dsa #coding #strings #hashmap #sorting