longestSubstring.js

/**
 * Given a string, find the length of the longest substring without repeating characters.
 * @param {string} s
 * @returns {number} The length of the longest substring without repeating characters
 */
function longestSubstring(s) {
  const len = s.length;
  let start = 0;
  let end = 1;
  let maxLength = 0;

  while (end <= len) {
    let currentSubstring = s.substring(start, end);
    maxLength = Math.max(maxLength, currentSubstring.length);
    if (currentSubstring.includes(s[end])) {
      do {
        start++;
        currentSubstring = s.substring(start, end);
      } while (currentSubstring.includes(s[end]));
    }
    end++;
  }
  return maxLength;
}

module.exports = { longestSubstring };