Longest Substring Without Repeating Characters

LongestSubstring.c

//Longest substring without repeating chars
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int lengthOfLongestSubstring(char *s) {
    int maxlen = 0;
    int curlen = 0;
    int len = strlen(s);
    int map[256];
    memset(map, -1, sizeof(map));

    for (int i = 0; i < len; i++) {
        if (map[s[i]] >= curlen) {
            maxlen = maxlen > i - curlen ? maxlen : i - curlen;
            curlen = map[s[i]] + 1;
        }
        map[s[i]] = i;
    }

    maxlen = maxlen > len - curlen ? maxlen : len - curlen;
    return maxlen;
}


int main(void) {
    char s[] = "abcabcbb";
    printf("Length of Longest Substring with non-repeating chars %d\n", lengthOfLongestSubstring(s));
}