출처: https://leetcode.com/problems/longest-substring-without-repeating-characters/

문제 설명

Given a string s, find the length of the longest substring without repeating characters.

문제풀이

const solution = (s) => {
  let subStringLength = [0];
  let subString = "";

  for (let index = 0; index < s.length; index++) {
    for (let i = index; i < s.length; i++) {
      if (!subString.includes(s[i])) {
        subString += s[i];
      } else {
        break;
      }
    }

    subStringLength.push(subString.length);
    subString = "";
  }

  return Math.max(...subStringLength);
};