0014 and 0015 done

Author: pranjal030404

solution/0000-0099/0014.Longest Common Prefix/README.md

@@ -251,6 +251,26 @@ def longest_common_prefix(strs)
 end
 ```
 
+#### C
+
+``` C
+
+char *longestCommonPrefix(char **strs, int strsSize) {
+  if (strsSize == 0)
+    return "";
+  for (int i = 0; strs[0][i]; i++) {
+    for (int j = 1; j < strsSize; j++) {
+      if (strs[j][i] != strs[0][i]) {
+        strs[0][i] = '\0';
+        return strs[0];
+      }
+    }
+  }
+  return strs[0];
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0014.Longest Common Prefix/README_EN.md

@@ -250,6 +250,26 @@ def longest_common_prefix(strs)
 end
 ```
 
+#### C
+
+``` C
+
+char *longestCommonPrefix(char **strs, int strsSize) {
+  if (strsSize == 0)
+    return "";
+  for (int i = 0; strs[0][i]; i++) {
+    for (int j = 1; j < strsSize; j++) {
+      if (strs[j][i] != strs[0][i]) {
+        strs[0][i] = '\0';
+        return strs[0];
+      }
+    }
+  }
+  return strs[0];
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0014.Longest Common Prefix/Solution.c

@@ -0,0 +1,13 @@
+char* longestCommonPrefix(char** strs, int strsSize) {
+    if (strsSize == 0)
+        return "";
+    for (int i = 0; strs[0][i]; i++) {
+        for (int j = 1; j < strsSize; j++) {
+            if (strs[j][i] != strs[0][i]) {
+                strs[0][i] = '\0';
+                return strs[0];
+            }
+        }
+    }
+    return strs[0];
+}

solution/0000-0099/0015.3Sum/README.md

@@ -453,6 +453,63 @@ class Solution {
 }
 ```
 
+#### C 
+
+``` C
+
+int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
+
+int **threeSum(int *nums, int numsSize, int *returnSize,
+               int **returnColumnSizes) {
+  *returnSize = 0;
+  int capacity = 100;
+  int **result = malloc(capacity * sizeof(int *));
+  int *colSizes = malloc(capacity * sizeof(int));
+  qsort(nums, numsSize, sizeof(int), cmp);
+
+  for (int i = 0; i < numsSize - 2; i++) {
+    if (nums[i] > 0)
+      break;
+    if (i > 0 && nums[i] == nums[i - 1])
+      continue;
+
+    int j = i + 1, k = numsSize - 1;
+    while (j < k) {
+      int sum = nums[i] + nums[j] + nums[k];
+      if (sum < 0) {
+        j++;
+      } else if (sum > 0) {
+        k--;
+      } else {
+        if (*returnSize >= capacity) {
+          capacity *= 2;
+          result = realloc(result, capacity * sizeof(int *));
+          colSizes = realloc(colSizes, capacity * sizeof(int));
+        }
+
+        result[*returnSize] = malloc(3 * sizeof(int));
+        result[*returnSize][0] = nums[i];
+        result[*returnSize][1] = nums[j];
+        result[*returnSize][2] = nums[k];
+        colSizes[*returnSize] = 3;
+        (*returnSize)++;
+
+        j++;
+        k--;
+        while (j < k && nums[j] == nums[j - 1])
+          j++;
+        while (j < k && nums[k] == nums[k + 1])
+          k--;
+      }
+    }
+  }
+
+  *returnColumnSizes = colSizes;
+  return result;
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0015.3Sum/README_EN.md

@@ -449,6 +449,63 @@ class Solution {
 }
 ```
 
+#### C
+
+``` C
+
+int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
+
+int **threeSum(int *nums, int numsSize, int *returnSize,
+               int **returnColumnSizes) {
+  *returnSize = 0;
+  int capacity = 100;
+  int **result = malloc(capacity * sizeof(int *));
+  int *colSizes = malloc(capacity * sizeof(int));
+  qsort(nums, numsSize, sizeof(int), cmp);
+
+  for (int i = 0; i < numsSize - 2; i++) {
+    if (nums[i] > 0)
+      break;
+    if (i > 0 && nums[i] == nums[i - 1])
+      continue;
+
+    int j = i + 1, k = numsSize - 1;
+    while (j < k) {
+      int sum = nums[i] + nums[j] + nums[k];
+      if (sum < 0) {
+        j++;
+      } else if (sum > 0) {
+        k--;
+      } else {
+        if (*returnSize >= capacity) {
+          capacity *= 2;
+          result = realloc(result, capacity * sizeof(int *));
+          colSizes = realloc(colSizes, capacity * sizeof(int));
+        }
+
+        result[*returnSize] = malloc(3 * sizeof(int));
+        result[*returnSize][0] = nums[i];
+        result[*returnSize][1] = nums[j];
+        result[*returnSize][2] = nums[k];
+        colSizes[*returnSize] = 3;
+        (*returnSize)++;
+
+        j++;
+        k--;
+        while (j < k && nums[j] == nums[j - 1])
+          j++;
+        while (j < k && nums[k] == nums[k + 1])
+          k--;
+      }
+    }
+  }
+
+  *returnColumnSizes = colSizes;
+  return result;
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0015.3Sum/Solution.c

@@ -0,0 +1,50 @@
+int cmp(const void* a, const void* b) { return *(int*) a - *(int*) b; }
+
+int** threeSum(int* nums, int numsSize, int* returnSize,
+    int** returnColumnSizes) {
+    *returnSize = 0;
+    int capacity = 100;
+    int** result = malloc(capacity * sizeof(int*));
+    int* colSizes = malloc(capacity * sizeof(int));
+    qsort(nums, numsSize, sizeof(int), cmp);
+
+    for (int i = 0; i < numsSize - 2; i++) {
+        if (nums[i] > 0)
+            break;
+        if (i > 0 && nums[i] == nums[i - 1])
+            continue;
+
+        int j = i + 1, k = numsSize - 1;
+        while (j < k) {
+            int sum = nums[i] + nums[j] + nums[k];
+            if (sum < 0) {
+                j++;
+            } else if (sum > 0) {
+                k--;
+            } else {
+                if (*returnSize >= capacity) {
+                    capacity *= 2;
+                    result = realloc(result, capacity * sizeof(int*));
+                    colSizes = realloc(colSizes, capacity * sizeof(int));
+                }
+
+                result[*returnSize] = malloc(3 * sizeof(int));
+                result[*returnSize][0] = nums[i];
+                result[*returnSize][1] = nums[j];
+                result[*returnSize][2] = nums[k];
+                colSizes[*returnSize] = 3;
+                (*returnSize)++;
+
+                j++;
+                k--;
+                while (j < k && nums[j] == nums[j - 1])
+                    j++;
+                while (j < k && nums[k] == nums[k + 1])
+                    k--;
+            }
+        }
+    }
+
+    *returnColumnSizes = colSizes;
+    return result;
+}