May 2010
Nov 2010
Nov 2010
Nov...
Follow me on Linkedin
Given a string find the length of longest substring which has none of its character repeated? for eg: i/p string: abcabcbb length of longest substring with no repeating charcters: 3 (abc)
Given a string find the length of longest substring which has none of its character repeated?
for eg:
i/p string:
abcabcbb
length of longest substring with no repeating charcters: 3 (abc)
Program :
#include<stdlib.h>
#include<stdio.h>
#define NO_OF_CHARS 256
int min(int a, int b);
int longestUniqueSubsttr(char *str)
{
int n = strlen(str);
int cur_len = 1; // To store the lenght of current...
Subscribe to:
Posts (Atom)
