diff --git a/GeeksForGeeks/June/01-6-24/GFG.java b/GeeksForGeeks/June/01-6-24/GFG.java
new file mode 100644
index 0000000..2317986
--- /dev/null
+++ b/GeeksForGeeks/June/01-6-24/GFG.java
@@ -0,0 +1,48 @@
+//{ Driver Code Starts
+import java.io.*;
+import java.util.*;
+
+class GFG {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int t;
+        t = Integer.parseInt(br.readLine());
+        while (t-- > 0) {
+
+            String s;
+            s = br.readLine();
+
+            Solution obj = new Solution();
+            String res = obj.oddEven(s);
+
+            System.out.println(res);
+        }
+    }
+}
+
+// } Driver Code Ends
+
+
+
+class Solution 
+{
+    public static String oddEven(String s) 
+    {
+        // code here
+        int a[] = new int[27];
+        for(int i=0; i<s.length(); i++)
+            a[s.charAt(i)-'a' + 1]++;
+            
+        int x=0, y=0;
+        
+        for(int i=1; i<=26; i++)
+        {
+            if(a[i]!=0 && (i%2==0 && a[i]%2==0))
+                x++;
+            if(a[i]!=0 && (i%2!=0 && a[i]%2!=0))
+                y++;
+        }
+        
+        return (x+y)%2 == 0 ? "EVEN" : "ODD";
+    }
+}
diff --git a/GeeksForGeeks/June/01-6-24/README.md b/GeeksForGeeks/June/01-6-24/README.md
new file mode 100644
index 0000000..9fc5d70
--- /dev/null
+++ b/GeeksForGeeks/June/01-6-24/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(|s|)
+Space complexity - O(1)
diff --git a/LeetCode/June/01-6-24/README.md b/LeetCode/June/01-6-24/README.md
new file mode 100644
index 0000000..9567f26
--- /dev/null
+++ b/LeetCode/June/01-6-24/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(1)
diff --git a/LeetCode/June/01-6-24/Solution.java b/LeetCode/June/01-6-24/Solution.java
new file mode 100644
index 0000000..abcafb4
--- /dev/null
+++ b/LeetCode/June/01-6-24/Solution.java
@@ -0,0 +1,10 @@
+class Solution {
+    public int scoreOfString(String s) {
+        int ans = 0;
+
+        for (int i = 1; i < s.length(); ++i)
+            ans += Math.abs(s.charAt(i) - s.charAt(i - 1));
+
+        return ans;
+    }
+}