Addition of Longest Substring Without Repeating Characters

[adwityac]

Problem Statement

Given a string, your task is to determine the length of the longest substring that does not contain any repeating characters. A substring is defined as a contiguous sequence of characters within a string.

Describe the solution you'd like

The solution to finding the longest substring without repeating characters employs a sliding window approach. We use a dictionary to track the last index of each character while iterating through the string.

As we encounter each character, we check if it has appeared before and whether its last index is within the current substring's bounds. If it has, we move the starting index of our substring to one position right of its last occurrence. We then update the character's last index in the dictionary and calculate the current substring length. If this length exceeds our previously recorded maximum length, we update it.

By the end of the traversal, the maximum length will represent the longest substring without repeating characters. This method runs in linear time, O(n), making it efficient for large strings.

Language: Python

[github-actions]

Hi 😄, @adwityac Thanks for creating issue at AlgoTree, do read and follow the Code of Conduct and the Contribution Guidelines while contributing. Refer to PR's which has been merged earlier in AlgoTree Click Here Like, How many File they have changed?, Which type of files need to be change? and many more.

[github-actions]

Hi 😄, thanks for creating issue at AlgoTree, do read and follow the Code of Conduct and the Contribution Guidelines while contributing.