Sliding window of unique characters clear solution for Long Non Repeat by Mysta - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Sliding window of unique characters solution in Clear category for Long Non Repeat by Mysta

def non_repeat(line: str) -> str:
    unique: str = ""
    longest: str = ""

    for letter in line:
        if (pos := unique.find(letter)) >= 0:
            unique = unique[pos + 1 :]

        unique += letter

        if len(unique) > len(longest):
            longest = unique

    return longest

April 13, 2026

Comments:

U.V on Sept. 18, 2026, 3:08 p.m.
<p>Good solution !</p>

Strings Theory

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.