1542-find-longest-awesome-substring.js

/**
 * @param {string} s
 * @return {number}
 */
const longestAwesome = function(s) {
  const n = s.length, map = new Map(), {max} = Math
  let res = 0, mask = 0
  
  map.set(0, -1)
  for(let i = 0; i < n; i++) {
    const d = +s[i]
    mask ^= (1 << d)
    if(map.has(mask)) {
        res = max(res, i - map.get(mask))
    }

    for(let j = 0; j < 10; j++) {
        const tmp = mask ^ (1 << j)
        if(map.has(tmp)) {
            // console.log(i, map.get(tmp), tmp)
            res = max(res, i - map.get(tmp))
        }
    }

    if(!map.has(mask)) {
        map.set(mask, i)
    }
  }

  return res
};

// another

/**
 * @param {string} s
 * @return {number}
 */
const longestAwesome = function (s) {
  const dp = new Array(1024).fill(s.length)
  let res = 0,
    mask = 0
  dp[0] = -1
  for (let i = 0; i < s.length; ++i) {
    mask ^= 1 << +s.charAt(i)
    res = Math.max(res, i - dp[mask])
    for (let j = 0; j <= 9; ++j) res = Math.max(res, i - dp[mask ^ (1 << j)])
    dp[mask] = Math.min(dp[mask], i)
  }
  return res
}

// another

/**
 * @param {string} s
 * @return {number}
 */
const longestAwesome = function(s) {
  const n = s.length, { max, min } = Math
  const dp = Array(2 ** 10).fill(n)
  let res = 0, mask = 0
  dp[0] = -1
  for(let i = 0; i < n; i++) {
    mask ^= (1 << parseInt(s[i]))
    res = max(res, i - dp[mask])
    for(let j = 0; j <= 9; j++) {
      const tmp = mask ^ (1 << j)
      res = max(res, i - dp[tmp])
    }
    dp[mask] = min(i, dp[mask])
  }
  
  return res
};