Check if Two Strings are Anagrams

📌 Definition:

📖 Detailed Explanation:

Two common approaches: (1) sort both and compare — O(n log n); (2) build a frequency map from the first string and decrement with the second — O(n). Normalize case/whitespace if required.

💻 Solutions:

• JavaScript

function isAnagram(a, b) {
  if (a.length !== b.length) return false;
  const count = {};
  for (const ch of a) count[ch] = (count[ch] || 0) + 1;
  for (const ch of b) {
    if (!count[ch]) return false;
    count[ch]--;
  }
  return true;
}

🔑 Key Points:

• Early exit if lengths differ
• Frequency-map approach is O(n) vs O(n log n) for sort
• Decrement and check for negatives/missing
• Normalize case/spaces if the spec requires

🌍 Real-World Example: