René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/buddy-strings","name":"#859 - Buddy Strings - LeetCode JavaScript Solutions","description":"Given two strings s and goal, return true if you can swap two letters in s so the result is equal to goal, otherwise, return false. Swapping...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} s\n * @param {string} goal\n * @return {boolean}\n */\nvar buddyStrings = function(s, goal) {\n  if (s.length !== goal.length) return false;\n\n  const differences = [];\n  const charCount = new Map();\n  let hasDuplicate = false;\n\n  for (let i = 0; i < s.length; i++) {\n    if (s[i] !== goal[i]) {\n      differences.push(i);\n      if (differences.length > 2) return false;\n    }\n    charCount.set(s[i], (charCount.get(s[i]) || 0) + 1);\n    if (charCount.get(s[i]) > 1) hasDuplicate = true;\n  }\n\n  if (differences.length === 0) return hasDuplicate;\n  if (differences.length !== 2) return false;\n\n  const [first, second] = differences;\n  return s[first] === goal[second] && s[second] === goal[first];\n};","keywords":"LeetCode 859, #859 - Buddy Strings, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}