Longest Substring Without Repeating Characters at Goldman Sachs

Medium38.5% acceptance

This problem has 62.5% frequency at Goldman Sachs.

Problem Description

Given a string `s`, find the length of the **longest** **substring** without duplicate characters.

Read full problem and hints

Topics

Also asked at 111 companies


More Goldman Sachs Questions

View all Goldman Sachs questions