• 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

Amazon Interview On-Campus For Internship – 1

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Find min element in Sorted Rotated Array (With Duplicates)

SAP Hiring Off-Campus General Aptitude

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Given a sorted array and a number x, find the pair in array whose sum is closest to x

SAP Interview Questions

Knight Tour Problem (Graph – Breadth First Search)

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

Spanning Tree

Common Ancestor in a Binary Tree or Binary Search Tree

Binary Tree Isomorphic to each other

Find min element in Sorted Rotated Array (Without Duplicates)

Python String and numbers

Get Minimum element in O(1) from input numbers or Stack

Serialise Deserialise N-ary Tree

Search element in a matrix with all rows and columns in sorted order

Circular Linked List

Find if a binary tree is height balanced ?

CodeChef Code SGARDEN

Test Cases for Round Function

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Word Break Problem

Maximum sum contiguous subarray of an Array

Check Binary Tree is Binary Search Tree or not

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Implement LRU Cache

Coin Collection Dynamic Programming

Calculate price of parking from parking start end time prices

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

Copyright © 2025 · Genesis Framework · WordPress · Log in