Arrays & Hashing/Easy

Valid AnagramPRO PASS

Time: O(N)Space: O(1)

Initialize Hash Map

Target is 0. We iterate through nums array and maintain a hash map of { value: index }.

Array Elements & Pointers

i=0

i=1

i=2

Live Variables & Invariants

target:0

i:0

current:-

complement:-

Step 1 / 714%

Solution Code

function isAnagram(s: string, t: string): boolean {

  if (s.length !== t.length) return false;

  const count = new Array(26).fill(0);

  for (let i = 0; i < s.length; i++) {

    count[s.charCodeAt(i) - 97]++;

    count[t.charCodeAt(i) - 97]--;

  return count.every(c => c === 0);

Custom Test Case Runner

Input your custom values and visualize step-by-step trace

Array Input (comma separated):

Target Number:

Quick Presets:

AI DSA Coach

Contextual Tutor for Valid Anagram

Hello! I am your AI DSA Tutor for **Valid Anagram** (Arrays & Hashing). Ask me anything about this algorithm, time complexity, or request a step hint!