Day2 (#27)

* Add @imkaka as a contributor

* Day2 Cpp

Day2/C++/checkPalindrome.cpp

@@ -0,0 +1,33 @@
+/*
+* @author: imkaka
+* @date :  21/12/2018
+*/
+
+#include<iostream>
+#include<string>
+
+using namespace std;
+
+int main(){
+
+    string str;
+    cin >> str ;
+
+    int size = str.size();
+    bool flag = false;
+    for(int i = 0; i< size/2; i++)
+    {
+        if(str[i] != str[size-i-1])
+        {
+           flag = true;
+           break;
+        }
+    }
+
+    if(!flag)
+        cout << str <<" is a Palindrome!!"  << endl;
+    else
+        cout << str << " is NOT a Palindrome!" << endl;
+
+    return 0;
+}

Day2/C++/reversString.cpp

@@ -0,0 +1,27 @@
+/*
+* @author: imkaka
+* @date :  21/12/2018
+*/
+
+#include<iostream>
+#include<string>
+
+using namespace std;
+
+int main(){
+
+    string str;
+    cin >> str ;
+
+    int size = str.size();
+    for(int i = 0; i< size/2; i++)
+    {
+        char temp = str[i];
+        str[i] = str[size-i-1];
+        str[size-1-i] = temp;
+    }
+
+    cout << str << endl;
+
+    return 0;
+}

Day2/README.md

@@ -65,10 +65,10 @@ function strRev (str) {
     var i, j,
       len = str.length,
       tempArr = [];
-    
+
     // Read string in reverse order and store each letter in the array
     for (j=len-1; j>=0; j--) {
-        tempArr.push(str[j]); 
+        tempArr.push(str[j]);
     }
 
     // Join the tempArr to convert it into a string
@@ -93,7 +93,7 @@ function strRev (str) {
     var i, j,
       len = str.length,
       tempArr = [];
-    
+
     // Read string in reverse order and store each letter in the array
     for (i=0, j=len-1; i<len; i++, j--) {
         tempArr[i] = str[j]; // You can use push() instead of assigning by index
@@ -217,7 +217,35 @@ public class Reverse {
     }
 }
 
-```
+## C++ Implementation
+
+### [Cpp Solution](./C++/reverseString.cpp)
+
+```cpp
+/*
+* @author: imkaka
+* @date :  21/12/2018
+*/
+
+#include<iostream>
+#include<string>
+
+using namespace std;
+
+int main(){
+
+    string str;
+    cin >> str ;
+
+    int size = str.size();
+    for(int i = 0; i< size/2; i++)
+    {
+        char temp = str[i];
+        str[i] = str[size-i-1];
+        str[size-1-i] = temp;
+    }
+
+    cout << str << endl;
 
 ## Python Implementation
 
@@ -400,7 +428,7 @@ isPalindrome('level');
  * @author MadhavBahlMD
  * @date 21/12/2018
  */
- 
+
 import java.util.Scanner;
 
 public class Palindrome {
@@ -439,7 +467,7 @@ public class Palindrome {
  * @author MadhavBahlMD
  * @date 21/12/2018
  */
- 
+
 import java.util.Scanner;
 // Method 2: Check whether reversed string is equal to the original string
 
@@ -458,7 +486,7 @@ public class Palindrome2 {
         for (int i=0; i<str.length(); i++) {
             reversed = str.charAt(i) + reversed;
         }
-        
+
         // Check if the reversed string is same as the original string
         if (str.equals(reversed)) {
             System.out.println ("The given string \"" + str + "\" is a Palindrome");
@@ -469,6 +497,44 @@ public class Palindrome2 {
 }
 ```
 
+### [C++ Implementation](./C++/checkPalindrome.cpp)
+
+```cpp
+/*
+* @author: imkaka
+* @date :  21/12/2018
+*/
+
+#include<iostream>
+#include<string>
+
+using namespace std;
+
+int main(){
+
+    string str;
+    cin >> str ;
+
+    int size = str.size();
+    bool flag = false;
+    for(int i = 0; i< size/2; i++)
+    {
+        if(str[i] != str[size-i-1])
+        {
+           flag = true;
+           break;
+        }
+    }
+
+    if(!flag)
+        cout << str <<" is a Palindrome!!"  << endl;
+    else
+        cout << str << " is NOT a Palindrome!" << endl;
+
+    return 0;
+}
+
+
 ## Python Implementation
 
 ### [Solution 1](./Python/Palindrome.py)