From 6546e3716e877a06e7e4763ec7e79ca5862777fb Mon Sep 17 00:00:00 2001
From: ashishraj30 <63506542+ashishraj30@users.noreply.github.com>
Date: Fri, 2 Oct 2020 13:55:19 +0530
Subject: [PATCH 1/2] Create Palindrome.java

---
 Palindrome.java | 40 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 40 insertions(+)
 create mode 100644 Palindrome.java

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"); 
+	} 
+} 

From 1536ca3f2b086a3d5ed8c21895660ce3703f600d Mon Sep 17 00:00:00 2001
From: "Restyled.io" <commits@restyled.io>
Date: Fri, 2 Oct 2020 08:25:34 +0000
Subject: [PATCH 2/2] Restyled by clang-format

---
 Palindrome.java | 78 ++++++++++++++++++++++++-------------------------
 1 file changed, 38 insertions(+), 40 deletions(-)

diff --git a/Palindrome.java b/Palindrome.java
index 154abd0..e70a496 100644
--- a/Palindrome.java
+++ b/Palindrome.java
@@ -1,40 +1,38 @@
-// 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"); 
-	} 
-} 
+// 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");
+  }
+}