longestSubstrLength.js

const longestSubstrLen = (s) => {
  const originalStrLen = s.length;
  const originalStrArr = s.split('');
  let subStrLen = 0;
  const lookupMap = {};
  
  for(let j=0, i=0; j < originalStrLen; j++) {
    const currChar = originalStrArr[j];
    
    console.log('i', i);
    console.log('j', j);
    console.log('currChar at j', currChar);
    console.log('lookupMap[currChar]', lookupMap[currChar]);
    
    if (lookupMap[currChar]) {
      i = Math.max(lookupMap[currChar], i);
    }
    subStrLen = Math.max(subStrLen, j-i + 1);
    lookupMap[currChar] = j + 1;
  }
  
  return subStrLen;
}