Skip to content

Latest commit

 

History

History
12 lines (9 loc) · 436 Bytes

File metadata and controls

12 lines (9 loc) · 436 Bytes

Problem 3: Multi-set Equivalence (Valid Anagram)

Problem Statement

Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Input Format

  • Two strings s and t.

Example

Input: s = "anagram", t = "nagaram"
Output: True