diff --git a/Palindrome.java b/Palindrome.java
new file mode 100644
index 0000000..154abd0
--- /dev/null
+++ b/Palindrome.java
@@ -0,0 +1,40 @@
+// Java implementation of the approach 
+public class Solution { 
+
+	// Function that returns true if 
+	// str is a palindrome 
+	static boolean isPalindrome(String str) 
+	{ 
+
+		// Pointers pointing to the beginning 
+		// and the end of the string 
+		int i = 0, j = str.length() - 1; 
+
+		// While there are characters toc compare 
+		while (i < j) { 
+
+			// If there is a mismatch 
+			if (str.charAt(i) != str.charAt(j)) 
+				return false; 
+
+			// Increment first pointer and 
+			// decrement the other 
+			i++; 
+			j--; 
+		} 
+
+		// Given string is a palindrome 
+		return true; 
+	} 
+
+	// Driver code 
+	public static void main(String[] args) 
+	{ 
+		String str = "geeks"; 
+
+		if (isPalindrome(str)) 
+			System.out.print("Yes"); 
+		else
+			System.out.print("No"); 
+	} 
+}