Valid Anagram | Coding Problem | LeetCode - 242
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
If you want to learn Machine Learning from beginning, watch this ML playlist designed for absolute beginners.
ML Playlist -
• Machine Learning Tutorial Playlist Fo...
Watch video Valid Anagram | Coding Problem | LeetCode - 242 online without registration, duration hours minute second in high quality. This video was added by user Data Science Diaries 05 May 2022, don't forget to share it with your friends and acquaintances, it has been viewed on our site 101 once and liked it 14 people.