Longest_Substring_Without_Duplication.md

Longest Substring Without Duplication

Problem Statement

Write a function that takes in a string and that returns its longest substring without duplicate characters. Assume that there will only be one longest substring without duplication.

Sample input:"clementisacap" Sample output:"mentisac"

Explanation

We can use a Stack here

Solution

Check this Python code.