solution of 0003 done in c

Author: pranjal030404

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

@@ -300,6 +300,34 @@ class Solution {
 }
 ```
 
+#### C
+
+``` c
+int lengthOfLongestSubstring(char *s) {
+  int freq[256] = {0};
+  int l = 0, r = 0;
+  int ans = 0;
+  int len = strlen(s);
+
+  for (r = 0; r < len; r++) {
+    char c = s[r];
+    freq[(unsigned char)c]++;
+
+    while (freq[(unsigned char)c] > 1) {
+      freq[(unsigned char)s[l]]--;
+      l++;
+    }
+
+    if (ans < r - l + 1) {
+      ans = r - l + 1;
+    }
+  }
+
+  return ans;
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md

@@ -298,6 +298,35 @@ class Solution {
 }
 ```
 
+#### C
+
+```c 
+
+int lengthOfLongestSubstring(char *s) {
+  int freq[256] = {0};
+  int l = 0, r = 0;
+  int ans = 0;
+  int len = strlen(s);
+
+  for (r = 0; r < len; r++) {
+    char c = s[r];
+    freq[(unsigned char)c]++;
+
+    while (freq[(unsigned char)c] > 1) {
+      freq[(unsigned char)s[l]]--;
+      l++;
+    }
+
+    if (ans < r - l + 1) {
+      ans = r - l + 1;
+    }
+  }
+
+  return ans;
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.c

@@ -0,0 +1,22 @@
+int lengthOfLongestSubstring(char *s) {
+  int freq[256] = {0};
+  int l = 0, r = 0;
+  int ans = 0;
+  int len = strlen(s);
+
+  for (r = 0; r < len; r++) {
+    char c = s[r];
+    freq[(unsigned char)c]++;
+
+    while (freq[(unsigned char)c] > 1) {
+      freq[(unsigned char)s[l]]--;
+      l++;
+    }
+
+    if (ans < r - l + 1) {
+      ans = r - l + 1;
+    }
+  }
+
+  return ans;
+}