ANAGRAMS

How I Understood Checking Anagrams in Python (LeetCode 242) When I first saw this problem, it looked like it might require sorting or multiple passes, but after thinking about it, I realized it can be solved efficiently with frequency counting. Problem Given two strings s and t, determine if t is an anagram of s. An anagram means both strings contain the same characters with the same frequency, but possibly in a different order. Examples: Python s = "anagram" t = "nagaram" Output: True Python s = "rat" t = "car" Output: False ** What I Noticed** Instead of sorting both strings (O(n log n)), I focused on: Counting how many times each character appears in s Subtracting counts based on characters in t If all counts are zero at the end, the strings are anagrams This approach is linear time O(n) and uses minimal extra space. **What Helped Me **Using a single frequency dictionary worked perfectly: Check lengths first: If lengths differ, they can’t be anagrams Count characters: Add for s Subt