palendrome

Author: sachuverma

DSA Crack Sheet/README.md

@@ -56,6 +56,8 @@
 ### Strings
 
 - [Reverse String](https://leetcode.com/problems/reverse-string/ "view question") - [Cpp Solution](./solutions/Reverse%20String.cpp)
+- [Palindrome String](https://practice.geeksforgeeks.org/problems/palindrome-string0817/1 "view question") - [Cpp Solution](./solutions/Palindrome%20String.cpp)
+- []( "view question") - [Cpp Solution](./solutions/.cpp)
 
 ### Searching & Sorting
 

DSA Crack Sheet/solutions/Palindrome String.cpp

@@ -0,0 +1,35 @@
+/*
+Palindrome String
+=================
+
+Given a string S, check if it is palindrome or not.
+
+Example 1:
+Input: S = "abba"
+Output: 1
+Explanation: S is a palindrome
+
+Example 2:
+Input: S = "abc" 
+Output: 0
+Explanation: S is not a palindrome
+
+Your Task:  
+You don't need to read input or print anything. Complete the function isPlaindrome() which accepts string S and returns a boolean value
+
+Expected Time Complexity: O(Length of S) 
+Expected Auxiliary Space: O(1) 
+
+Constraints:
+1 <= Length of S <= 105
+*/
+
+int isPlaindrome(string s)
+{
+  for (int i = 0; i < s.size() / 2; ++i)
+  {
+    if (s[i] != s[s.size() - 1 - i])
+      return 0;
+  }
+  return 1;
+}