Lean4

32. Valid anagram

EasyProgramFree10 points

Write isAnagram s t, which is true when t uses exactly the same characters as s, each as many times, in any order, and false otherwise.

Case matters: "a" and "A" are different characters.

Examples

  1. InputisAnagram "anagram" "nagaram"Outputtrue
  2. InputisAnagram "rat" "car"Outputfalse
  3. InputisAnagram "aab" "abb"Outputfalse

Submitting also runs 9 hidden tests.

Constraints

  • Hidden tests include strings of 20,000 characters.
stringssorting

Learn the ideas

Similar problems

Solution.lean
Loading…
Loading editor…
3#guard (isAnagram "anagram" "nagaram") = (true)
4#guard (isAnagram "rat" "car") = (false)
5#guard (isAnagram "aab" "abb") = (false)
examples

Run checks your code against the examples and your custom inputs and records nothing. Submit also runs the hidden tests, confirms the axioms your proof uses and records the result. Each uses one compiler check.

ReadyLn 1, Col 1Lean 4
Draft saved in this browser