My-LeetCode-Solvings
C# Code Challenges Solved on LeetCode
Project maintained by F4NT0
Hosted on GitHub Pages — Theme by mattgraham
242. Valid Anagram
Level: ![Easy](https://img.shields.io/badge/Easy-lightgreen)
Language: C#
Topic: String
Unit Tests: ![242 - Testing Results](https://github.com/F4NT0/My-LeetCode-Solvings/actions/workflows/242.yml/badge.svg)
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.
Example 1:
- Input: s = “anagram”, t = “nagaram”
- Output: true
Example 2:
- Input: s = “rat”, t = “car”
- Output: false
Constraints:
- 1 <= s.length, t.length <= 5 * 104
- s and t consist of lowercase English letters.