Pallindrome String Checker

Author: rrrrr4788

Check_String_Palindrome/Source1.cpp

@@ -0,0 +1,27 @@
+#include<iostream>
+#include<string>
+
+bool checkStringPallindrome(string inputString);
+
+bool checkStringPallindrome(string inputString) {
+	//if (inputString.length() % 2 == 1) {
+		for (int i = 0; i < inputString.length()/2; i++) {
+			if (inputString.at[i] != inputString.at[inputString.length() - 1 - i]) {
+				return false;
+			}
+		}
+	//}
+	//else {
+
+	//}
+		return true;
+}
+int main(){
+
+	string input = "";
+	std::getline(std::cin, input);
+	std::cout<<checkStringPallindrome(input);
+
+	system("pause");
+	return 1;
+}

Check_String_Palindrome/problem.txt

@@ -0,0 +1,17 @@
+You are given a string consisting of letters from a-z and A-Z. No any special characters. A palindrome is a word which is equal to itself when reversed. Examples are DAD, MOM, APCPA. Words like TIGER, RAT are not palindromes.
+Input and Output:
+The function should take a queue of characters as input and return True or False as output. If the queue is empty return true.
+
+
+Sample Input 1: 
+ABCBA
+Sample Output 1: 
+true
+Sample Input 2: 
+PrOGraMiNG
+Sample Output 2: 
+false
+Sample Input 3: 
+AA
+Sample Output 3: 
+true