From bbd600789f85bc3f100c6810015a75ddbffaab44 Mon Sep 17 00:00:00 2001
From: Sahil Madhyan <sahilmadhyan880@gmail.com>
Date: Mon, 16 Oct 2023 21:19:57 +0530
Subject: [PATCH] Added valid_anagram.java

---
 JAVA/valid_anagram.java | 47 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 47 insertions(+)
 create mode 100644 JAVA/valid_anagram.java

diff --git a/JAVA/valid_anagram.java b/JAVA/valid_anagram.java
new file mode 100644
index 00000000..e2f99ed6
--- /dev/null
+++ b/JAVA/valid_anagram.java
@@ -0,0 +1,47 @@
+// https://leetcode.com/problems/valid-anagram/
+/* 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. */
+
+class valid_anagram {
+    public boolean isAnagram(String s, String t) {
+        if (s.length() != t.length()) {
+            return false;
+        }
+        int characters[] = new int[26];
+        for (int i = 0; i < s.length(); i++) {
+            characters[s.charAt(i) - 'a']++;
+            characters[t.charAt(i) - 'a']--;
+        }
+        for (int alphabet : characters) {
+            if (alphabet != 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    public static void main(String args[]) {
+        String s = "anagram";
+        String t = "nagaram";
+        valid_anagram va = new valid_anagram();
+        System.out.println(va.isAnagram(s, t));
+    }
+}
\ No newline at end of file