https://github.com/emahtab/valid-anagram
Check if target string is anagram of source string
https://github.com/emahtab/valid-anagram
anagram leetcode problem-solving
Last synced: 3 months ago
JSON representation
Check if target string is anagram of source string
- Host: GitHub
- URL: https://github.com/emahtab/valid-anagram
- Owner: eMahtab
- Created: 2020-03-08T13:10:26.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2020-03-08T13:25:47.000Z (over 5 years ago)
- Last Synced: 2025-06-07T09:04:38.825Z (4 months ago)
- Topics: anagram, leetcode, problem-solving
- Homepage:
- Size: 4.88 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Valid Anagram
# https://leetcode.com/problems/valid-anagram
Given two strings s and t , write a function to determine if t is an anagram of s.
```
Example 1:
Input: s = "anagram", t = "nagaram"
Output: true
Example 2:
Input: s = "rat", t = "car"
Output: false
```
**Note:**
You may assume the string contains only lowercase alphabets.
**Follow up:**
What if the inputs contain unicode characters? How would you adapt your solution to such case?
# Implementation 1 : Sorting
```java
class Solution {
public boolean isAnagram(String s, String t) {
if (s.length() != t.length())
return false;
char[] str1 = s.toCharArray();
char[] str2 = t.toCharArray();
Arrays.sort(str1);
Arrays.sort(str2);
return Arrays.equals(str1, str2);
}
}
```
# Implementation 2 : Hashing
```java
class Solution {
public boolean isAnagram(String s, String t) {
if (s.length() != t.length())
return false;
int[] chars = new int[26];
for (int i = 0; i < s.length(); i++)
chars[s.charAt(i) - 'a']++;
for (int i = 0; i < t.length(); i++) {
chars[t.charAt(i) - 'a']--;
if (chars[t.charAt(i) - 'a'] < 0) {
return false;
}
}
return true;
}
}
```
# Follow up :
What if the inputs contain unicode characters? How would you adapt your solution to such case?
**Answer :**
Use a hash table instead of a fixed size counter. Imagine allocating a large size array to fit the entire range of unicode characters, which could go up to more than 1 million. A hash table is a more generic solution and could adapt to any range of characters.
# References :
https://leetcode.com/articles/valid-anagram