June 2018 Update

Task/Palindrome-detection/Processing/palindrome-detection

@@ -0,0 +1,21 @@
+void setup(){
+	println(isPalindrome(InsertPalindromeHere));
+}
+
+boolean isPalindrome(string check){
+	char[] letters = new char[check.length];
+	string invert = " ";
+	string modCheck = " " + check;
+	for(int i = 0; i < letters.length; i++){
+		letters[i] = check.charAt(i);
+	}
+	for(int i = letters.length-1; i >= 0; i--){
+		invert = invert + letters[i];
+	}
+	
+	if(invert == modCheck){
+		return true;
+	} else {
+		return false;
+	}
+}