diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/last-letter-first-letter.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/last-letter-first-letter.english.md index 47cbc10da9..d95355b160 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/last-letter-first-letter.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/last-letter-first-letter.english.md @@ -28,19 +28,19 @@ Write a function that takes an input array of words. The function should return ``` yml tests: - text: findLongestChain should be a function. - testString: assert(typeof findLongestChain == 'function', 'findLongestChain should be a function.'); + testString: assert(typeof findLongestChain == 'function'); - text: findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"]) should return an array. - testString: assert(Array.isArray(findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"])), 'findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"]) should return an array.'); + testString: assert(Array.isArray(findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"]))); - text: findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"]) should return ["involves", "starting", "game", "each"]. - testString: assert.deepEqual(findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"]), ['involves', 'starting', 'game', 'each'], 'findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"]) should return ["involves", "starting", "game", "each"].'); + testString: assert.deepEqual(findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"]), ['involves', 'starting', 'game', 'each']); - text: findLongestChain(["audino", "bagon", "kangaskhan", "banette", "bidoof", "braviary", "exeggcute", "yamask"]) should return ["braviary", "yamask", "kangaskhan"] - testString: assert.deepEqual(findLongestChain(["audino", "bagon", "kangaskhan", "banette", "bidoof", "braviary", "exeggcute", "yamask"]), ['braviary', 'yamask', 'kangaskhan'], 'findLongestChain(["audino", "bagon", "kangaskhan", "banette", "bidoof", "braviary", "exeggcute", "yamask"]) should return ["braviary", "yamask", "kangaskhan"].'); + testString: assert.deepEqual(findLongestChain(["audino", "bagon", "kangaskhan", "banette", "bidoof", "braviary", "exeggcute", "yamask"]), ['braviary', 'yamask', 'kangaskhan']); - text: findLongestChain(["harp", "poliwrath", "poochyena", "porygon2", "porygonz", "archana"]) should return ["poliwrath", "harp", "poochyena", "archana"]. - testString: assert.deepEqual(findLongestChain(["harp", "poliwrath", "poochyena", "porygon2", "porygonz", "archana"]), ['poliwrath', 'harp', 'poochyena', 'archana'], 'findLongestChain(["harp", "poliwrath", "poochyena", "porygon2", "porygonz", "archana"]) should return ["poliwrath", "harp", "poochyena", "archana"].'); + testString: assert.deepEqual(findLongestChain(["harp", "poliwrath", "poochyena", "porygon2", "porygonz", "archana"]), ['poliwrath', 'harp', 'poochyena', 'archana']); - text: findLongestChain(["scolipede", "elephant", "zeaking", "sealeo", "silcoon", "tigers"]) should return ["scolipede", "elephant", "tigers", "sealeo"]. - testString: assert.deepEqual(findLongestChain(["scolipede", "elephant", "zeaking", "sealeo", "silcoon", "tigers"]), ['scolipede', 'elephant', 'tigers', 'sealeo'], 'findLongestChain(["scolipede", "elephant", "zeaking", "sealeo", "silcoon", "tigers"]) should return ["scolipede", "elephant", "tigers", "sealeo"].'); + testString: assert.deepEqual(findLongestChain(["scolipede", "elephant", "zeaking", "sealeo", "silcoon", "tigers"]), ['scolipede', 'elephant', 'tigers', 'sealeo']); - text: findLongestChain(["loudred", "lumineon", "lunatone", "machamp", "magnezone", "nosepass", "petilil", "pidgeotto", "pikachu"]) should return ["machamp", "petilil", "lumineon", "nosepass"]. - testString: assert.deepEqual(findLongestChain(["loudred", "lumineon", "lunatone", "machamp", "magnezone", "nosepass", "petilil", "pidgeotto", "pikachu"]), ['machamp', 'petilil', 'lumineon', 'nosepass'], 'findLongestChain(["loudred", "lumineon", "lunatone", "machamp", "magnezone", "nosepass", "petilil", "pidgeotto", "pikachu"]) should return ["machamp", "petilil", "lumineon", "nosepass"].'); + testString: assert.deepEqual(findLongestChain(["loudred", "lumineon", "lunatone", "machamp", "magnezone", "nosepass", "petilil", "pidgeotto", "pikachu"]), ['machamp', 'petilil', 'lumineon', 'nosepass']); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/letter-frequency.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/letter-frequency.english.md index 0d55136752..1da0057044 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/letter-frequency.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/letter-frequency.english.md @@ -23,21 +23,21 @@ For example, given the string "ab", your function should return [['a', 1], ``` yml tests: - text: letterFrequency should be a function. - testString: assert(typeof letterFrequency == 'function', 'letterFrequency should be a function.'); + testString: assert(typeof letterFrequency == 'function'); - text: letterFrequency("Not all that Mrs. Bennet, however") should return an array. - testString: assert(Array.isArray(letterFrequency("Not all that Mrs. Bennet, however")), 'letterFrequency("Not all that Mrs. Bennet, however") should return an array.'); + testString: assert(Array.isArray(letterFrequency("Not all that Mrs. Bennet, however"))); - text: letterFrequency("Not all that Mrs. Bennet, however") should return [[" ", 5], [", ", 1], [".", 1], ["B", 1], ["M", 1], ["N", 1], ["a", 2], ["e", 4], ["h", 2], ["l", 2], ["n", 2], ["o", 2], ["r", 2], ["s", 1], ["t", 4], ["v", 1], ["w", 1]]. - testString: assert.deepEqual(letterFrequency("Not all that Mrs. Bennet, however"), [[' ', 5], [',', 1], ['.', 1], ['B', 1], ['M', 1], ['N', 1], ['a', 2], ['e', 4], ['h', 2], ['l', 2], ['n', 2], ['o', 2], ['r', 2], ['s', 1], ['t', 4], ['v', 1], ['w', 1]], 'letterFrequency("Not all that Mrs. Bennet, however") should return [[" ", 5], [", ", 1], [".", 1], ["B", 1], ["M", 1], ["N", 1], ["a", 2], ["e", 4], ["h", 2], ["l", 2], ["n", 2], ["o", 2], ["r", 2], ["s", 1], ["t", 4], ["v", 1], ["w", 1]].'); + testString: assert.deepEqual(letterFrequency("Not all that Mrs. Bennet, however"), [[' ', 5], [',', 1], ['.', 1], ['B', 1], ['M', 1], ['N', 1], ['a', 2], ['e', 4], ['h', 2], ['l', 2], ['n', 2], ['o', 2], ['r', 2], ['s', 1], ['t', 4], ['v', 1], ['w', 1]]); - text: letterFrequency("daughters, could ask on the ") should return [[' ',5],[',',1],['a',2],['c',1],['d',2],['e',2],['g',1],['h',2],['k',1],['l',1],['n',1],['o',2],['r',1],['s',2],['t',2],['u',2]]. - testString: assert.deepEqual(letterFrequency("daughters, could ask on the "), [[' ', 5], [',', 1], ['a', 2], ['c', 1], ['d', 2], ['e', 2], ['g', 1], ['h', 2], ['k', 1], ['l', 1], ['n', 1], ['o', 2], ['r', 1], ['s', 2], ['t', 2], ['u', 2]], 'letterFrequency("daughters, could ask on the ") should return [[" ", 5], [", ", 1], ["a", 2], ["c", 1], ["d", 2], ["e", 2], ["g", 1], ["h", 2], ["k", 1], ["l", 1], ["n", 1], ["o", 2], ["r", 1], ["s", 2], ["t", 2], ["u", 2]].'); + testString: assert.deepEqual(letterFrequency("daughters, could ask on the "), [[' ', 5], [',', 1], ['a', 2], ['c', 1], ['d', 2], ['e', 2], ['g', 1], ['h', 2], ['k', 1], ['l', 1], ['n', 1], ['o', 2], ['r', 1], ['s', 2], ['t', 2], ['u', 2]]); - text: letterFrequency("husband any satisfactory description") should return [[" ", 3], ["a", 4], ["b", 1], ["c", 2], ["d", 2], ["e", 1], ["f", 1], ["h", 1], ["i", 3], ["n", 3], ["o", 2], ["p", 1], ["r", 2], ["s", 4], ["t", 3], ["u", 1], ["y", 2]]. - testString: assert.deepEqual(letterFrequency("husband any satisfactory description"), [[' ', 3], ['a', 4], ['b', 1], ['c', 2], ['d', 2], ['e', 1], ['f', 1], ['h', 1], ['i', 3], ['n', 3], ['o', 2], ['p', 1], ['r', 2], ['s', 4], ['t', 3], ['u', 1], ['y', 2]], 'letterFrequency("husband any satisfactory description") should return [[" ", 3], ["a", 4], ["b", 1], ["c", 2], ["d", 2], ["e", 1], ["f", 1], ["h", 1], ["i", 3], ["n", 3], ["o", 2], ["p", 1], ["r", 2], ["s", 4], ["t", 3], ["u", 1], ["y", 2]].'); + testString: assert.deepEqual(letterFrequency("husband any satisfactory description"), [[' ', 3], ['a', 4], ['b', 1], ['c', 2], ['d', 2], ['e', 1], ['f', 1], ['h', 1], ['i', 3], ['n', 3], ['o', 2], ['p', 1], ['r', 2], ['s', 4], ['t', 3], ['u', 1], ['y', 2]]); - text: letterFrequency("in various ways--with barefaced") should return [[" ", 3], ["-", 2], ["a", 4], ["b", 1], ["c", 1], ["d", 1], ["e", 2], ["f", 1], ["h", 1], ["i", 3], ["n", 1], ["o", 1], ["r", 2], ["s", 2], ["t", 1], ["u", 1], ["v", 1], ["w", 2], ["y", 1]]. - testString: assert.deepEqual(letterFrequency("in various ways--with barefaced"), [[' ', 3], ['-', 2], ['a', 4], ['b', 1], ['c', 1], ['d', 1], ['e', 2], ['f', 1], ['h', 1], ['i', 3], ['n', 1], ['o', 1], ['r', 2], ['s', 2], ['t', 1], ['u', 1], ['v', 1], ['w', 2], ['y', 1]], 'letterFrequency("in various ways--with barefaced") should return [[" ", 3], ["-", 2], ["a", 4], ["b", 1], ["c", 1], ["d", 1], ["e", 2], ["f", 1], ["h", 1], ["i", 3], ["n", 1], ["o", 1], ["r", 2], ["s", 2], ["t", 1], ["u", 1], ["v", 1], ["w", 2], ["y", 1]].'); + testString: assert.deepEqual(letterFrequency("in various ways--with barefaced"), [[' ', 3], ['-', 2], ['a', 4], ['b', 1], ['c', 1], ['d', 1], ['e', 2], ['f', 1], ['h', 1], ['i', 3], ['n', 1], ['o', 1], ['r', 2], ['s', 2], ['t', 1], ['u', 1], ['v', 1], ['w', 2], ['y', 1]]); - text: letterFrequency("distant surmises; but he eluded") should return [[" ", 4], ["; ", 1], ["a", 1], ["b", 1], ["d", 3], ["e", 4], ["h", 1], ["i", 2], ["l", 1], ["m", 1], ["n", 1], ["r", 1], ["s", 4], ["t", 3], ["u", 3]]. - testString: assert.deepEqual(letterFrequency("distant surmises; but he eluded"), [[' ', 4], [';', 1], ['a', 1], ['b', 1], ['d', 3], ['e', 4], ['h', 1], ['i', 2], ['l', 1], ['m', 1], ['n', 1], ['r', 1], ['s', 4], ['t', 3], ['u', 3]], 'letterFrequency("distant surmises; but he eluded") should return [[" ", 4], ["; ", 1], ["a", 1], ["b", 1], ["d", 3], ["e", 4], ["h", 1], ["i", 2], ["l", 1], ["m", 1], ["n", 1], ["r", 1], ["s", 4], ["t", 3], ["u", 3]].'); + testString: assert.deepEqual(letterFrequency("distant surmises; but he eluded"), [[' ', 4], [';', 1], ['a', 1], ['b', 1], ['d', 3], ['e', 4], ['h', 1], ['i', 2], ['l', 1], ['m', 1], ['n', 1], ['r', 1], ['s', 4], ['t', 3], ['u', 3]]); - text: letterFrequency("last obliged to accept the second-hand,") should return [[" ", 5], [", ", 1], ["-", 1], ["a", 3], ["b", 1], ["c", 3], ["d", 3], ["e", 4], ["g", 1], ["h", 2], ["i", 1], ["l", 2], ["n", 2], ["o", 3], ["p", 1], ["s", 2], ["t", 4]]. - testString: assert.deepEqual(letterFrequency("last obliged to accept the second-hand,"), [[' ', 5], [',', 1], ['-', 1], ['a', 3], ['b', 1], ['c', 3], ['d', 3], ['e', 4], ['g', 1], ['h', 2], ['i', 1], ['l', 2], ['n', 2], ['o', 3], ['p', 1], ['s', 2], ['t', 4]], 'letterFrequency("last obliged to accept the second-hand,") should return [[" ", 5], [", ", 1], ["-", 1], ["a", 3], ["b", 1], ["c", 3], ["d", 3], ["e", 4], ["g", 1], ["h", 2], ["i", 1], ["l", 2], ["n", 2], ["o", 3], ["p", 1], ["s", 2], ["t", 4]].'); + testString: assert.deepEqual(letterFrequency("last obliged to accept the second-hand,"), [[' ', 5], [',', 1], ['-', 1], ['a', 3], ['b', 1], ['c', 3], ['d', 3], ['e', 4], ['g', 1], ['h', 2], ['i', 1], ['l', 2], ['n', 2], ['o', 3], ['p', 1], ['s', 2], ['t', 4]]); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/levenshtein-distance.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/levenshtein-distance.md index a7850936f0..690306d7d8 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/levenshtein-distance.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/levenshtein-distance.md @@ -29,21 +29,21 @@ Write a function that returns the Levenshtein distance between two strings given ``` yml tests: - text: levenshtein should be a function. - testString: assert(typeof levenshtein == 'function', 'levenshtein should be a function.'); + testString: assert(typeof levenshtein == 'function'); - text: levenshtein("mist", "dist") should return a number. - testString: assert(typeof levenshtein("mist", "dist") == 'number', 'levenshtein("mist", "dist") should return a number.'); + testString: assert(typeof levenshtein("mist", "dist") == 'number'); - text: levenshtein("mist", "dist") should return 1. - testString: assert.equal(levenshtein("mist", "dist"), 1, 'levenshtein("mist", "dist") should return 1.'); + testString: assert.equal(levenshtein("mist", "dist"), 1); - text: levenshtein("tier", "tor") should return 2. - testString: assert.equal(levenshtein("tier", "tor"), 2, 'levenshtein("tier", "tor") should return 2.'); + testString: assert.equal(levenshtein("tier", "tor"), 2); - text: levenshtein("kitten", "sitting") should return 3. - testString: assert.equal(levenshtein("kitten", "sitting"), 3, 'levenshtein("kitten", "sitting") should return 3.'); + testString: assert.equal(levenshtein("kitten", "sitting"), 3); - text: levenshtein("stop", "tops") should return 2. - testString: assert.equal(levenshtein("stop", "tops"), 2, 'levenshtein("stop", "tops") should return 2.'); + testString: assert.equal(levenshtein("stop", "tops"), 2); - text: levenshtein("rosettacode", "raisethysword") should return 8. - testString: assert.equal(levenshtein("rosettacode", "raisethysword"), 8, 'levenshtein("rosettacode", "raisethysword") should return 8.'); + testString: assert.equal(levenshtein("rosettacode", "raisethysword"), 8); - text: levenshtein("mississippi", "swiss miss") should return 8. - testString: assert.equal(levenshtein("mississippi", "swiss miss"), 8, 'levenshtein("mississippi", "swiss miss") should return 8.'); + testString: assert.equal(levenshtein("mississippi", "swiss miss"), 8); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/linear-congruential-generator.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/linear-congruential-generator.md index 280f7c60d4..61535b2e8c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/linear-congruential-generator.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/linear-congruential-generator.md @@ -29,19 +29,19 @@ Write a function that takes $r_0,a,c,m,n$ as parameters and returns $r_n$. ``` yml tests: - text: linearCongGenerator should be a function. - testString: assert(typeof linearCongGenerator == 'function', 'linearCongGenerator should be a function.'); + testString: assert(typeof linearCongGenerator == 'function'); - text: linearCongGenerator(324, 1145, 177, 2148, 3) should return a number. - testString: assert(typeof linearCongGenerator(324, 1145, 177, 2148, 3) == 'number', 'linearCongGenerator(324, 1145, 177, 2148, 3) should return a number.'); + testString: assert(typeof linearCongGenerator(324, 1145, 177, 2148, 3) == 'number'); - text: linearCongGenerator(324, 1145, 177, 2148, 3) should return 855. - testString: assert.equal(linearCongGenerator(324, 1145, 177, 2148, 3), 855, 'linearCongGenerator(324, 1145, 177, 2148, 3) should return 855.'); + testString: assert.equal(linearCongGenerator(324, 1145, 177, 2148, 3), 855); - text: linearCongGenerator(234, 11245, 145, 83648, 4) should return 1110. - testString: assert.equal(linearCongGenerator(234, 11245, 145, 83648, 4), 1110, 'linearCongGenerator(234, 11245, 145, 83648, 4) should return 1110.'); + testString: assert.equal(linearCongGenerator(234, 11245, 145, 83648, 4), 1110); - text: linearCongGenerator(85, 11, 1234, 214748, 5) should return 62217. - testString: assert.equal(linearCongGenerator(85, 11, 1234, 214748, 5), 62217, 'linearCongGenerator(85, 11, 1234, 214748, 5) should return 62217.'); + testString: assert.equal(linearCongGenerator(85, 11, 1234, 214748, 5), 62217); - text: linearCongGenerator(0, 1103515245, 12345, 2147483648, 1) should return 12345. - testString: assert.equal(linearCongGenerator(0, 1103515245, 12345, 2147483648, 1), 12345, 'linearCongGenerator(0, 1103515245, 12345, 2147483648, 1) should return 12345.'); + testString: assert.equal(linearCongGenerator(0, 1103515245, 12345, 2147483648, 1), 12345); - text: linearCongGenerator(0, 1103515245, 12345, 2147483648, 2) should return 1406932606. - testString: assert.equal(linearCongGenerator(0, 1103515245, 12345, 2147483648, 2), 1406932606, 'linearCongGenerator(0, 1103515245, 12345, 2147483648, 2) should return 1406932606.'); + testString: assert.equal(linearCongGenerator(0, 1103515245, 12345, 2147483648, 2), 1406932606); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/long-multiplication.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/long-multiplication.md index bebad11584..a30899cc3f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/long-multiplication.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/long-multiplication.md @@ -22,19 +22,19 @@ Write a function that takes two strings of large numbers as parameters. Your fun ``` yml tests: - text: mult should be a function. - testString: assert(typeof mult == 'function', 'mult should be a function.'); + testString: assert(typeof mult == 'function'); - text: mult("18446744073709551616", "18446744073709551616") should return a string. - testString: assert(typeof mult("18446744073709551616", "18446744073709551616") == 'string', 'mult("18446744073709551616", "18446744073709551616") should return a string.'); + testString: assert(typeof mult("18446744073709551616", "18446744073709551616") == 'string'); - text: mult("18446744073709551616", "18446744073709551616") should return "340282366920938463463374607431768211456". - testString: assert.equal(mult("18446744073709551616", "18446744073709551616"), "340282366920938463463374607431768211456", 'mult("18446744073709551616", "18446744073709551616") should return "340282366920938463463374607431768211456".'); + testString: assert.equal(mult("18446744073709551616", "18446744073709551616"), "340282366920938463463374607431768211456"); - text: mult("31844674073709551616", "1844674407309551616") should return "58743055272886011737990786529368211456". - testString: assert.equal(mult("31844674073709551616", "1844674407309551616"), "58743055272886011737990786529368211456", 'mult("31844674073709551616", "1844674407309551616") should return "58743055272886011737990786529368211456".'); + testString: assert.equal(mult("31844674073709551616", "1844674407309551616"), "58743055272886011737990786529368211456"); - text: mult("1846744073709551616", "44844644073709551616") should return "82816580680737279241781007431768211456". - testString: assert.equal(mult("1846744073709551616", "44844644073709551616"), "82816580680737279241781007431768211456", 'mult("1846744073709551616", "44844644073709551616") should return "82816580680737279241781007431768211456".'); + testString: assert.equal(mult("1846744073709551616", "44844644073709551616"), "82816580680737279241781007431768211456"); - text: mult("1844674407370951616", "1844674407709551616") should return "3402823669833978308014392742590611456". - testString: assert.equal(mult("1844674407370951616", "1844674407709551616"), "3402823669833978308014392742590611456", 'mult("1844674407370951616", "1844674407709551616") should return "3402823669833978308014392742590611456".'); + testString: assert.equal(mult("1844674407370951616", "1844674407709551616"), "3402823669833978308014392742590611456"); - text: mult("2844674407370951616", "1844674407370955616") should return "5247498076580334548376218009219475456". - testString: assert.equal(mult("2844674407370951616", "1844674407370955616"), "5247498076580334548376218009219475456", 'mult("2844674407370951616", "1844674407370955616") should return "5247498076580334548376218009219475456".'); + testString: assert.equal(mult("2844674407370951616", "1844674407370955616"), "5247498076580334548376218009219475456"); ```