From c53118a92859995e4e9d9d26d80e64b04caa07dc Mon Sep 17 00:00:00 2001
From: I345718 <rushikesh.joshi@sap.com>
Date: Sun, 3 Apr 2022 19:10:17 +0100
Subject: [PATCH 1/2] Java Solution for 217 Contains Duplicate

---
 java/217-Contains-Duplicate.java | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 java/217-Contains-Duplicate.java

diff --git a/java/217-Contains-Duplicate.java b/java/217-Contains-Duplicate.java
new file mode 100644
index 000000000..9c59be683
--- /dev/null
+++ b/java/217-Contains-Duplicate.java
@@ -0,0 +1,11 @@
+class Solution {
+    public boolean containsDuplicate(int[] nums) {
+        Set<Integer> numbers = new HashSet<Integer>();
+        for (int num : nums) {
+            if (numbers.contains(num)) return true;
+            numbers.add(num);
+        }
+        
+        return false;
+    }
+}
\ No newline at end of file

From df100a5f0a2071c952e1911e6055f93bae0a580e Mon Sep 17 00:00:00 2001
From: I345718 <rushikesh.joshi@sap.com>
Date: Sun, 3 Apr 2022 19:17:30 +0100
Subject: [PATCH 2/2] Java Solution for 242 Valid Anagram

---
 java/242-Valid-Anagram.java | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 java/242-Valid-Anagram.java

diff --git a/java/242-Valid-Anagram.java b/java/242-Valid-Anagram.java
new file mode 100644
index 000000000..83aa38541
--- /dev/null
+++ b/java/242-Valid-Anagram.java
@@ -0,0 +1,19 @@
+class Solution {
+    public boolean isAnagram(String s, String t) {
+        if (s.length() != t.length()) return false;
+        
+        int[] countS = new int[26];
+        int[] countT = new int[26];
+        
+        for (int i = 0 ; i < s.length() ; i++) {
+            countS[s.charAt(i) - 'a']++;
+            countT[t.charAt(i) - 'a']++;
+        }
+        
+        for (int i = 0 ; i < 26 ; i++) {
+            if (countS[i] - countT[i] != 0) return false;
+        }
+        
+        return true;
+    }
+}
\ No newline at end of file