• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Length of the longest substring without repeating characters

March 26, 2014 by Dhaval Dave

Length of the longest substring without repeating characters


Method 1 (Brute Force Method)
We can consider all substrings.
One by one and check for each substring whether it contains all unique characters or not. 

There will be n*(n+1)/2 substrings. 

Whether a substirng contains all unique characters or not can be checked in linear time by scanning it from left to right and keeping a map of visited characters. 
Time complexity of this solution would be O(n^3).

Method 2 (Linear Time)
This solution uses extra space to store the last indexes of already visited characters.

The idea is to scan the string from left to right, keep track of the maximum length Non-Repeating Character Substring (NRCS) seen so far.
Explanation

Let the maximum length be max_len. When we traverse the string, we also keep track of length of the current NRCS using cur_len variable.

For every new character, we look for it in already processed part of the string

(A temp array called visited[] is used for this purpose).

If it is not present, then we increase the cur_len by 1.

If Present there are two cases

a) The previous instance of character is not part of current NRCS (The NRCS which is under process). In this case, we need to simply increase cur_len by 1.

b) If the previous instance is part of the current NRCS, then our current NRCS changes. It becomes the substring staring from the next character of previous instance to currently scanned character. We also need to compare cur_len and max_len, before changing current NRCS (or changing cur_len)

int longestUniqueSubsttr(char *str)
{
    int n = strlen(str);
    int cur_len = 1;  // To store the lenght of current substring
    int max_len = 1;  // To store the result
    int prev_index;  // To store the previous index
    int i;
    int *visited = (int *)malloc(sizeof(int)*NO_OF_CHARS);

    for (i = 0; i < NO_OF_CHARS;  i++)
        visited[i] = -1;

    visited[str[0]] = 0;

    for (i = 1; i < n; i++)
    {
        prev_index =  visited[str[i]];
        if (prev_index == -1 || i - cur_len > prev_index)
            cur_len++;
        else
        {
            if (cur_len > max_len)
                max_len = cur_len;
            cur_len = i - prev_index;
        }
        visited[str[i]] = i; // update the index of current character
    }
    if (cur_len > max_len)
        max_len = cur_len;
    free(visited); // free memory allocated for visited
    return max_len; 
}

 

Similar Articles

Filed Under: Amazon Interview Question, Hacker Earth Questions, Interview Questions, problem Tagged With: string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

System Design: Designing a LLD for Hotel Booking

Check Binary Tree is Binary Search Tree or not

The Magic HackerEarth Nirvana solutions Hiring Challenge

Adobe Interview Questions 8 month Exp

Find the smallest window in a string containing all characters of another string

Walmart Labs Interview Experience

C++ OOPs Part2

K’th Largest Element in BST when modification to BST is not allowed

SAP Interview Questions

strtok()

Best Java Book | Top Java Programming Book for Beginners

The greedy coins game Dynamic Programming

Client Server C program

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Get K Max and Delete K Max in stream of incoming integers

DFS (Depth First Search)

Find Percentage of Words matching in Two Strings

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

C++ OOPs Part1

Given a float number convert it into the string WITHOUT using any inbuilt Function

Fibonacci Hashing & Fastest Hashtable

Binary Tree in Java

Flipkart Set 1 On Campus with Answers

1014 Practice Question of New GRE – Princeton

BFS (Breath First Search)

LeetCode: Binary Tree Maximum Path Sum

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Wrong Directions given find minimum moves so that he can reach to the destination

Apriori algorithm C Code Data Mining

SAP Off Campus Hiring_ March 2015 Computer Skills

Copyright © 2025 · Genesis Framework · WordPress · Log in