refactor 242

fishercoder1534 · fishercoder1534 · commit 4795613ee1a1 · 2020-05-23T08:18:04.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_242.java b/src/main/java/com/fishercoder/solutions/_242.java
@@ -2,21 +2,6 @@
 
 import java.util.Arrays;
 
-/**
- * 242. Valid Anagram
- * Given two strings s and t, write a function to determine if t is an anagram of s.
-
- For example,
- s = "anagram", t = "nagaram", return true.
- s = "rat", t = "car", return 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?
- */
-
 public class _242 {
 
     public static class Solution1 {
