{"version":3,"sources":["../../src/Easy/longestCommonPrefix/index.ts","../../src/Easy/isPalindrome/index.ts","../../src/constants.ts","../../src/Easy/validBrackets/index.ts","../../src/Easy/romanToInt/index.ts","../../src/Easy/twoSum/index.ts","../../src/Easy/containsDuplicate/index.ts","../../src/Easy/isHappy/index.ts","../../src/Easy/plusOne/index.ts","../../src/Easy/addBinary/index.ts"],"names":["longestCommonPrefix_default","words","minLen","min","word","i","prefix","str","isPalindrome_default","x","s","RomanNumerals","BracketPairMapping","validBrackets_default","stack","char","romanToInt_default","roman","result","val","next","twoSum_default","nums","target","mapping","num","search","containsDuplicate_default","isHappy_default","n","previous","recurse","sum","acc","plusOne_default","digits","addBinary_default","strs","a","b"],"mappings":"AAAA,IAAOA,EAASC,GAAoB,CAChC,GAAIA,EAAM,QAAU,EAAG,MAAO,GAC9B,GAAIA,EAAM,OAAS,EAAG,OAAOA,EAAM,CAAC,EAEpC,IAAMC,EAASD,EAAM,OACjB,CAACE,EAAKC,IAAS,KAAK,IAAID,EAAKC,EAAK,MAAM,EACxC,GACJ,EAEA,GAAIF,IAAW,EAAG,MAAO,GAEzB,QAASG,EAAIH,EAAQG,EAAI,EAAGA,IAAK,CAC7B,IAAMC,EAASL,EAAM,CAAC,EAAG,MAAM,EAAGI,CAAC,EACnC,GAAIJ,EAAM,MAAOM,GAAQA,EAAI,MAAM,EAAGF,CAAC,IAAMC,CAAM,EAAG,OAAOA,CACjE,CAEA,MAAO,EACX,ECjBA,IAAOE,EAASC,IACVC,GAAcA,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAMA,GAAGD,EAAE,SAAS,CAAC,ECD/D,IAAKE,OACRA,IAAA,EAAI,GAAJ,IACAA,IAAA,EAAI,GAAJ,IACAA,IAAA,EAAI,IAAJ,IACAA,IAAA,EAAI,IAAJ,IACAA,IAAA,EAAI,KAAJ,IACAA,IAAA,EAAI,KAAJ,IACAA,IAAA,EAAI,KAAJ,IAPQA,OAAA,IAYCC,EAAqB,IAAI,IAAI,CACtC,CAAC,IAAK,GAAG,EACT,CAAC,IAAK,GAAG,EACT,CAAC,IAAK,GAAG,CACb,CAAC,ECdD,IAAOC,EAASN,GAAgB,CAC5B,IAAMO,EAAkB,CAAC,EAEzB,QAAWC,KAAQR,EACf,GAAIK,EAAmB,IAAIG,CAAI,EAAGD,EAAM,KAAKC,CAAI,UAE7CD,EAAM,SAAW,GACjBF,EAAmB,IAAIE,EAAM,IAAI,CAAE,IAAMC,EAEzC,MAAO,GAGf,OAAOD,EAAM,SAAW,CAC5B,ECbA,IAAOE,EAASC,GAAkB,CAC9B,IAAIC,EAAS,EAEb,QAASb,EAAI,EAAGA,EAAIY,EAAM,OAAQZ,IAAK,CACnC,IAAMc,EAAMR,EAAcM,EAAMZ,CAAC,CAAiB,EAC5Ce,EAAOT,EAAcM,EAAMZ,EAAI,CAAC,CAAiB,GAAK,EAE5Da,EAASC,GAAOC,EAAOF,EAASC,EAAMD,EAASC,CACnD,CAEA,OAAOD,CACX,ECbA,IAAOG,EAAQ,CAACC,EAAgBC,IAAmB,CAC/C,IAAMC,EAAU,IAAI,IAEpB,OAAW,CAACnB,EAAGoB,CAAG,IAAKH,EAAK,QAAQ,EAAG,CACnC,IAAMI,EAASF,EAAQ,IAAIC,CAAG,EAC9B,GAAIC,GAAU,KAAW,MAAO,CAACA,EAAQrB,CAAC,EAC1CmB,EAAQ,IAAID,EAASE,EAAKpB,CAAC,CAC/B,CAEA,MAAO,CAAC,CACZ,ECVA,IAAOsB,EAASL,GAA4B,IAAI,IAAIA,CAAI,EAAE,OAASA,EAAK,OCAxE,IAAOM,EAASC,GAAuB,CACnC,IAAMC,EAAqB,CAAC,EAEtBC,EAAWN,GAAyB,CACtC,GAAIK,EAAS,SAASL,CAAG,EAAG,MAAO,GACnCK,EAAS,KAAKL,CAAG,EAEjB,IAAMO,EAAM,MAAM,KAAKP,EAAI,SAAS,EAAE,MAAM,EAAE,EAAG,MAAM,EAAE,OACrD,CAACQ,EAAKxB,IAAMwB,EAAMxB,EAAIA,EACtB,CACJ,EAEA,OAAOuB,IAAQ,EAAI,GAAOD,EAAQC,CAAG,CACzC,EAEA,OAAOD,EAAQF,CAAC,CACpB,EChBA,IAAOK,EAASC,GACZ,MAAM,MAAM,OAAOA,EAAO,KAAK,EAAE,CAAC,EAAI,OAAO,CAAC,GAAG,SAAS,EAAG,MAAM,ECDvE,IAAOC,EAAQ,IAAIC,IACfA,EACK,IAAK9B,GAAQ,OAAO,KAAKA,CAAG,EAAE,CAAC,EAC/B,OAAO,CAAC+B,EAAGC,IAAMD,EAAIC,EAAG,OAAO,CAAC,CAAC,EACjC,SAAS,CAAC","sourcesContent":["export default (words: string[]) => {\n    if (words.length == 0) return '';\n    if (words.length < 2) return words[0];\n\n    const minLen = words.reduce(\n        (min, word) => Math.min(min, word.length),\n        Infinity\n    );\n\n    if (minLen === 0) return '';\n\n    for (let i = minLen; i > 0; i--) {\n        const prefix = words[0]!.slice(0, i);\n        if (words.every((str) => str.slice(0, i) === prefix)) return prefix;\n    }\n\n    return '';\n};\n","export default (x: number) =>\n    ((s: string) => s.split('').reverse().join('') === s)(x.toString());\n","export enum RomanNumerals {\n    I = 1,\n    V = 5,\n    X = 10,\n    L = 50,\n    C = 100,\n    D = 500,\n    M = 1000\n}\n\nexport type RomanNumeral = keyof typeof RomanNumerals;\n\nexport const BracketPairMapping = new Map([\n    ['(', ')'],\n    ['{', '}'],\n    ['[', ']']\n]);\n","import { BracketPairMapping } from '../../constants';\n\nexport default (str: string) => {\n    const stack: string[] = [];\n\n    for (const char of str) {\n        if (BracketPairMapping.has(char)) stack.push(char);\n        else if (\n            stack.length === 0 ||\n            BracketPairMapping.get(stack.pop()!) !== char\n        )\n            return false;\n    }\n\n    return stack.length === 0;\n};\n","import { RomanNumeral, RomanNumerals } from '../../constants';\n\nexport default (roman: string) => {\n    let result = 0;\n\n    for (let i = 0; i < roman.length; i++) {\n        const val = RomanNumerals[roman[i] as RomanNumeral];\n        const next = RomanNumerals[roman[i + 1] as RomanNumeral] ?? 0;\n\n        result = val >= next ? result + val : result - val;\n    }\n\n    return result;\n};\n","export default (nums: number[], target: number) => {\n    const mapping = new Map<number, number>();\n\n    for (const [i, num] of nums.entries()) {\n        const search = mapping.get(num);\n        if (search != undefined) return [search, i];\n        mapping.set(target - num, i);\n    }\n\n    return [];\n};\n","export default (nums: number[]): boolean => new Set(nums).size !== nums.length;\n","export default (n: number): boolean => {\n    const previous: number[] = [];\n\n    const recurse = (num: number): boolean => {\n        if (previous.includes(num)) return false;\n        previous.push(num);\n\n        const sum = Array.from(num.toString().split(''), Number).reduce(\n            (acc, x) => acc + x * x,\n            0\n        );\n\n        return sum === 1 ? true : recurse(sum);\n    };\n\n    return recurse(n);\n};\n","export default (digits: number[]) =>\n    Array.from((BigInt(digits.join('')) + BigInt(1)).toString(), Number);\n","export default (...strs: string[]): string =>\n    strs\n        .map((str) => BigInt(`0b${str}`))\n        .reduce((a, b) => a + b, BigInt(0))\n        .toString(2);\n"]}