Solution done for 0008 and 0009 in c language

Author: pranjal030404

solution/0000-0099/0008.String to Integer (atoi)/README.md

@@ -385,6 +385,39 @@ class Solution {
     }
 }
 ```
+#### C
+``` C 
+int myAtoi(char* s) {
+    int i = 0;
+    int sign = 1;
+    long result = 0;
+    while (s[i] == ' ') {
+        i++;
+    }
+    if (s[i] == '-' || s[i] == '+') {
+        sign = (s[i] == '-') ? -1 : 1;
+        i++;
+    }
+    while (isdigit(s[i])) {
+        result = result * 10 + (s[i] - '0');
+        if (sign == 1 && result > INT_MAX) {
+            return INT_MAX;
+        }
+        if (sign == -1 && -result < INT_MIN) {
+            return INT_MIN;
+        }
+        i++;
+    }
+    b
+        result
+        *= sign;
+    if (result > INT_MAX)
+        return INT_MAX;
+    if (result < INT_MIN)
+        return INT_MIN;
+    return (int) result;
+}
+```
 
 <!-- tabs:end -->
 

solution/0000-0099/0008.String to Integer (atoi)/README_EN.md

@@ -374,6 +374,41 @@ class Solution {
 }
 ```
 
+#### C
+
+``` C 
+int myAtoi(char* s) {
+    int i = 0;
+    int sign = 1;
+    long result = 0;
+    while (s[i] == ' ') {
+        i++;
+    }
+    if (s[i] == '-' || s[i] == '+') {
+        sign = (s[i] == '-') ? -1 : 1;
+        i++;
+    }
+    while (isdigit(s[i])) {
+        result = result * 10 + (s[i] - '0');
+        if (sign == 1 && result > INT_MAX) {
+            return INT_MAX;
+        }
+        if (sign == -1 && -result < INT_MIN) {
+            return INT_MIN;
+        }
+        i++;
+    }
+    b
+        result
+        *= sign;
+    if (result > INT_MAX)
+        return INT_MAX;
+    if (result < INT_MIN)
+        return INT_MIN;
+    return (int) result;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0008.String to Integer (atoi)/Solution.c

@@ -0,0 +1,30 @@
+int myAtoi(char* s) {
+    int i = 0;
+    int sign = 1;
+    long result = 0;
+    while (s[i] == ' ') {
+        i++;
+    }
+    if (s[i] == '-' || s[i] == '+') {
+        sign = (s[i] == '-') ? -1 : 1;
+        i++;
+    }
+    while (isdigit(s[i])) {
+        result = result * 10 + (s[i] - '0');
+        if (sign == 1 && result > INT_MAX) {
+            return INT_MAX;
+        }
+        if (sign == -1 && -result < INT_MIN) {
+            return INT_MIN;
+        }
+        i++;
+    }
+    b
+        result
+        *= sign;
+    if (result > INT_MAX)
+        return INT_MAX;
+    if (result < INT_MIN)
+        return INT_MIN;
+    return (int) result;
+}

solution/0000-0099/0009.Palindrome Number/README.md

@@ -248,6 +248,26 @@ class Solution {
 }
 ```
 
+#### C
+
+``` C
+bool isPalindrome(int x) {
+    if (x < 0)
+        return false;
+    int original = x;
+    int reversed = 0;
+    while (x != 0) {
+        int digit = x % 10;
+        if (reversed > (2147483647 - digit) / 10)
+            return false;
+        reversed = reversed * 10 + digit;
+        x /= 10;
+    }
+    return original == reversed;
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0009.Palindrome Number/README_EN.md

@@ -240,6 +240,26 @@ class Solution {
 }
 ```
 
+#### C
+
+``` C
+bool isPalindrome(int x) {
+    if (x < 0)
+        return false;
+    int original = x;
+    int reversed = 0;
+    while (x != 0) {
+        int digit = x % 10;
+        if (reversed > (2147483647 - digit) / 10)
+            return false;
+        reversed = reversed * 10 + digit;
+        x /= 10;
+    }
+    return original == reversed;
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0009.Palindrome Number/Solution.c

@@ -0,0 +1,14 @@
+bool isPalindrome(int x) {
+    if (x < 0)
+        return false;
+    int original = x;
+    int reversed = 0;
+    while (x != 0) {
+        int digit = x % 10;
+        if (reversed > (2147483647 - digit) / 10)
+            return false;
+        reversed = reversed * 10 + digit;
+        x /= 10;
+    }
+    return original == reversed;
+}