Skip to main content
Valid Anagram | AlgoCracked
AlgoCracked
ProblemsValid Anagram
Easy63.0% acceptance
Blind75StringHash TableSorting

Valid Anagram

Given two strings s and t , return true if t is an anagram of s , and false otherwise. An anagram uses exactly the same characters as the original, each the same number of times, in any order. Input format Input is [s, t] , e.g. [ anagram , nagaram ] .

Loading workspace…