Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Hashing

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Hashing

Valid Anagram

beginnerlayer B3 · Hashing5 tests

Two words are anagrams when one is a rearrangement of the other: the same letters, each used the same number of times. Write isAnagram(s, t) which returns true when t is an anagram of s.

  • Comparison is case-sensitive and every character counts, including repeats
  • Two empty strings are anagrams of each other
  • Strings of different lengths can never be anagrams

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen