815 lines
48 KiB
JSON
815 lines
48 KiB
JSON
[
|
|
{
|
|
"_id": "ad7123c8c441eddfaeb5bdef",
|
|
"name": "Meet Bonfire",
|
|
"difficulty": "0",
|
|
"description": [
|
|
"Click the button below for further instructions.",
|
|
"Your goal is to fix the failing test.",
|
|
"First, run all the tests by clicking \"Run code\" or by pressing Control + Enter",
|
|
"The failing test is in red. Fix the code so that all tests pass. Then you can move on to the next Bonfire.",
|
|
"Make this function return true no matter what."
|
|
],
|
|
"tests": [
|
|
"expect(meetBonfire()).to.be.a(\"boolean\");",
|
|
"expect(meetBonfire()).to.be.true;"
|
|
],
|
|
"challengeSeed": "function meetBonfire(argument) {\n // Good luck!\n console.log(\"you can read this function's argument in the developer tools\", argument);\n\n return false;\n}\n\n\n\nmeetBonfire(\"You can do this!\");"
|
|
},
|
|
{
|
|
"_id": "a202eed8fc186c8434cb6d61",
|
|
"name": "Reverse a String",
|
|
"difficulty": "1.01",
|
|
"tests": [
|
|
"expect(reverseString('hello')).to.be.a('String');",
|
|
"expect(reverseString('hello')).to.equal('olleh');",
|
|
"expect(reverseString('Howdy')).to.equal('ydwoH');",
|
|
"expect(reverseString('Greetings from Earth')).to.equal('htraE morf sgniteerG');"
|
|
],
|
|
"description": [
|
|
"Reverse the provided string.",
|
|
"You may need to turn the string into an array before you can reverse it.",
|
|
"Your result must be a string."
|
|
],
|
|
"challengeSeed": "function reverseString(str) {\n return str;\r\n}\n\nreverseString('hello');",
|
|
"MDNlinks" : ["Global String Object", "String.split()", "Array.reverse()", "Array.join()"]
|
|
},
|
|
{
|
|
"_id": "a302f7aae1aa3152a5b413bc",
|
|
"name": "Factorialize a Number",
|
|
"tests": [
|
|
"expect(factorialize(5)).to.be.a(\"Number\");",
|
|
"expect(factorialize(5)).to.equal(120);",
|
|
"expect(factorialize(10)).to.equal(3628800);",
|
|
"expect(factorialize(20)).to.equal(2432902008176640000);"
|
|
],
|
|
"difficulty": "1.02",
|
|
"description": [
|
|
"Return the factorial of the provided integer.",
|
|
"If the integer is represented with the letter n, a factorial is the product of all positive integers less than or equal to n.",
|
|
"Factorials are often represented with the shorthand notation n!",
|
|
"For example: 5! = 1 * 2 * 3 * 4 * 5 = 120f"
|
|
],
|
|
"challengeSeed": "function factorialize(num) {\n return num;\r\n}\n\nfactorialize(5);",
|
|
"MDNlinks" : ["Arithmetic Operators"]
|
|
},
|
|
{
|
|
"_id": "aaa48de84e1ecc7c742e1124",
|
|
"name": "Check for Palindromes",
|
|
"difficulty": "1.03",
|
|
"description": [
|
|
"Return true if the given string is a palindrome. Otherwise, return false.",
|
|
"A palindrome is a word or sentence that's spelled the same way both forward and backward, ignoring punctuation, case, and spacing.",
|
|
"You'll need to remove punctuation and turn everything lower case in order to check for palindromes.",
|
|
"We'll pass strings with varying formats, such as \"racecar\", \"RaceCar\", and \"race CAR\" among others."
|
|
],
|
|
"tests": [
|
|
"expect(palindrome(\"eye\")).to.be.a(\"boolean\");",
|
|
"assert.deepEqual(palindrome(\"eye\"), true);",
|
|
"assert.deepEqual(palindrome(\"race car\"), true);",
|
|
"assert.deepEqual(palindrome(\"not a palindrome\"), false);",
|
|
"assert.deepEqual(palindrome(\"A man, a plan, a canal. Panama\"), true);",
|
|
"assert.deepEqual(palindrome(\"never odd or even\"), true);",
|
|
"assert.deepEqual(palindrome(\"nope\"), false);"
|
|
],
|
|
"challengeSeed": "function palindrome(str) {\n // Good luck!\n return true;\n}\n\n\n\npalindrome(\"eye\");",
|
|
"MDNlinks" : ["String.replace()", "String.toLowerCase()"]
|
|
},
|
|
{
|
|
"_id": "a26cbbe9ad8655a977e1ceb5",
|
|
"name": "Find the Longest Word in a String",
|
|
"difficulty": "1.04",
|
|
"description": [
|
|
"Return the length of the longest word in the provided sentence.",
|
|
"Your response should be a number."
|
|
],
|
|
"challengeSeed": "function findLongestWord(str) {\n return str.length;\r\n}\n\nfindLongestWord('The quick brown fox jumped over the lazy dog');",
|
|
"tests": [
|
|
"expect(findLongestWord('The quick brown fox jumped over the lazy dog')).to.be.a('Number');",
|
|
"expect(findLongestWord('The quick brown fox jumped over the lazy dog')).to.equal(6);",
|
|
"expect(findLongestWord('May the force be with you')).to.equal(5);",
|
|
"expect(findLongestWord('Google do a barrel roll')).to.equal(6);",
|
|
"expect(findLongestWord('What is the average airspeed velocity of an unladen swallow')).to.equal(8);"
|
|
],
|
|
"MDNlinks" : ["String.split()", "String.length"]
|
|
},
|
|
{
|
|
"_id": "ab6137d4e35944e21037b769",
|
|
"name": "Title Case a Sentence",
|
|
"difficulty": "1.05",
|
|
"description": [
|
|
"Return the provided string with the first letter of each word capitalized.",
|
|
"For the purpose of this exercise, you should also capitalize connecting words like 'the' and 'of'."
|
|
],
|
|
"challengeSeed": "function titleCase(str) {\n return str;\r\n}\n\ntitleCase(\"I'm a little tea pot\");",
|
|
"tests": [
|
|
"expect(titleCase(\"I'm a little tea pot\")).to.be.a('String');",
|
|
"expect(titleCase(\"I'm a little tea pot\")).to.equal(\"I'm A Little Tea Pot\");",
|
|
"expect(titleCase(\"sHoRt AnD sToUt\")).to.equal(\"Short And Stout\");",
|
|
"expect(titleCase(\"HERE IS MY HANDLE HERE IS MY SPOUT\")).to.equal(\"Here Is My Handle Here Is My Spout\");"
|
|
],
|
|
"MDNlinks" : ["String.charAt()"]
|
|
},
|
|
{
|
|
"_id": "a789b3483989747d63b0e427",
|
|
"name": "Return Largest Numbers in Arrays",
|
|
"difficulty": "1.06",
|
|
"description": [
|
|
"Return an array consisting of the largest number from each provided sub-array. For simplicity, the provided array will contain exactly 4 sub-arrays.",
|
|
"Remember, you can iterate through an array with a simple for loop, and access each member with array syntax arr[i] .",
|
|
"If you are writing your own Chai.js tests, be sure to use a deep equal statement instead of an equal statement when comparing arrays."
|
|
],
|
|
"challengeSeed": "function largestOfFour(arr) {\n // You can do this!\r\n return arr;\r\n}\n\nlargestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);",
|
|
"tests": [
|
|
"expect(largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]])).to.be.a('array');",
|
|
"(largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]])).should.eql([5,27,39,1001]);",
|
|
"assert(largestOfFour([[4, 9, 1, 3], [13, 35, 18, 26], [32, 35, 97, 39], [1000000, 1001, 857, 1]]).should.eql([9,35,97,1000000]));"
|
|
],
|
|
"MDNlinks" : ["Comparison Operators"]
|
|
},
|
|
{
|
|
"_id": "acda2fb1324d9b0fa741e6b5",
|
|
"name": "Confirm the Ending",
|
|
"difficulty": "1.07",
|
|
"description": [
|
|
"Check if a string (first argument) ends with the given target string (second argument)."
|
|
],
|
|
|
|
"challengeSeed": "function end(str, target) {\n // \"Never give up and good luck will find you.\"\r\n // -- Falcor\r\n return str;\r\n}\n\nend('Bastian', 'n');",
|
|
"tests": [
|
|
"assert.strictEqual(end('Bastian', 'n'), true, 'should equal true if target equals end of string');",
|
|
"assert.strictEqual(end('He has to give me a new name', 'name'), true, 'should equal true if target equals end of string');",
|
|
"assert.strictEqual(end('If you want to save our world, you must hurry. We dont know how much longer we can withstand the nothing', 'mountain'), false, 'should equal false if target does not equal end of string');"
|
|
],
|
|
"MDNlinks" : ["String.substr()"]
|
|
},
|
|
{
|
|
"_id": "afcc8d540bea9ea2669306b6",
|
|
"name": "Repeat a string repeat a string",
|
|
"difficulty": "1.08",
|
|
"description": [
|
|
"Repeat a given string (first argument) n times (second argument). Return an empty string if n is a negative number."
|
|
],
|
|
"challengeSeed": "function repeat(str, num) {\n // repeat after me\r\n return str;\r\n}\n\nrepeat('abc', 3);",
|
|
"tests": [
|
|
"assert.strictEqual(repeat('*', 3), '***', 'should repeat a string n times');",
|
|
"assert.strictEqual(repeat('abc', 3), 'abcabcabc', 'should repeat a string n times');",
|
|
"assert.strictEqual(repeat('abc', -2), '', 'should return an empty string for negative numbers');"
|
|
],
|
|
"MDNlinks" : ["Global String Object"]
|
|
},
|
|
{
|
|
"_id": "ac6993d51946422351508a41",
|
|
"name": "Truncate a string",
|
|
"difficulty": "1.09",
|
|
"description": [
|
|
"Truncate a string (first argument) if it is longer than the given maximum string length (second argument). Return the truncated string with a '...' ending.",
|
|
"Note that the three dots at the end add to the string length."
|
|
],
|
|
"challengeSeed":"function truncate(str, num) {\n // Clear out that junk in your trunk\r\n return str;\r\n}\n\ntruncate('A-tisket a-tasket A green and yellow basket', 11);",
|
|
"tests": [
|
|
"expect(truncate('A-tisket a-tasket A green and yellow basket', 11)).to.eqls('A-tisket...');",
|
|
"assert(truncate('A-tisket a-tasket A green and yellow basket', 'A-tisket a-tasket A green and yellow basket'.length) === 'A-tisket a-tasket A green and yellow basket', 'should not truncate if string is = length');",
|
|
"assert.strictEqual(truncate('A-tisket a-tasket A green and yellow basket', 'A-tisket a-tasket A green and yellow basket'.length + 2), 'A-tisket a-tasket A green and yellow basket', 'should not truncate if string is < length');"
|
|
],
|
|
"MDNlinks" : ["String.slice()"]
|
|
},
|
|
{
|
|
"_id": "a9bd25c716030ec90084d8a1",
|
|
"name": "Chunky Monkey",
|
|
"difficulty": "1.10",
|
|
"description": [
|
|
"Write a function that splits an array (first argument) into groups the length of size (second argument) and returns them as a multidimensional array."
|
|
],
|
|
"challengeSeed": "function chunk(arr, size) {\n // Break it up.\r\n return arr;\r\n}\n\nchunk(['a', 'b', 'c', 'd'], 2);",
|
|
"tests": [
|
|
"assert.deepEqual(chunk(['a', 'b', 'c', 'd'], 2), [['a', 'b'], ['c', 'd']], 'should return chunked arrays');",
|
|
"assert.deepEqual(chunk([0, 1, 2, 3, 4, 5], 3), [[0, 1, 2], [3, 4, 5]], 'should return chunked arrays');",
|
|
"assert.deepEqual(chunk([0, 1, 2, 3, 4, 5], 4), [[0, 1, 2, 3], [4, 5]], 'should return the last chunk as remaining elements');"
|
|
],
|
|
"MDNlinks" : ["Array.push()"]
|
|
},
|
|
{
|
|
"_id": "ab31c21b530c0dafa9e241ee",
|
|
"name": "Slasher Flick",
|
|
"difficulty": "1.11",
|
|
"description": [
|
|
"Return the remaining elements of an array after chopping off n elements from the head."
|
|
],
|
|
"challengeSeed": "function slasher(arr, howMany) {\n // it doesn't always pay to be first\r\n return arr;\r\n}\n\nslasher([1, 2, 3], 2);",
|
|
"tests": [
|
|
"assert.deepEqual(slasher([1, 2, 3], 2), [3], 'should drop the first two elements');",
|
|
"assert.deepEqual(slasher([1, 2, 3], 0), [1, 2, 3], 'should return all elements when n < 1');",
|
|
"assert.deepEqual(slasher([1, 2, 3], 9), [], 'should return an empty array when n >= array.length');"
|
|
],
|
|
"MDNlinks" : ["Array.slice()", "Array.splice()"]
|
|
},
|
|
{
|
|
"_id": "af2170cad53daa0770fabdea",
|
|
"name": "Mutations",
|
|
"difficulty": "1.12",
|
|
"description": [
|
|
"Return true if the string in the first element of the array contains the letters of the string in the second element of the array.",
|
|
"For example, ['hello', 'Hello'], should return true because all of the letters in the second string are present in the first, ignoring case.",
|
|
"The arguments ['hello', 'hey'] should return false because the string 'hello' does not contain a 'y'.",
|
|
"Another example, ['Alien', 'line'], should return true because all of the letters in 'line' are present in 'Alien'."
|
|
],
|
|
"challengeSeed": "function mutation(arr) {\n return arr;\n}\n\nmutation(['hello', 'hey']);",
|
|
"tests": [
|
|
"expect(mutation(['hello', 'hey'])).to.be.false;",
|
|
"expect(mutation(['hello', 'Hello'])).to.be.true;",
|
|
"expect(mutation(['zyxwvutsrqponmlkjihgfedcba', 'qrstu'])).to.be.true;",
|
|
"expect(mutation(['Mary', 'Army'])).to.be.true;",
|
|
"expect(mutation(['Alien', 'line'])).to.be.true;"
|
|
],
|
|
"MDNlinks" : ["Array.sort()"]
|
|
},
|
|
{
|
|
"_id": "adf08ec01beb4f99fc7a68f2",
|
|
"name": "Falsey Bouncer",
|
|
"difficulty": "1.50",
|
|
"description": [
|
|
"Remove all falsey values from an array.",
|
|
"Falsey values in javascript are false, null, 0, \"\", undefined, and NaN."
|
|
],
|
|
"challengeSeed": "function bouncer(arr) {\n // Don't show a false ID to this bouncer.\r\n return arr;\r\n}\n\nbouncer([7, 'ate', '', false, 9]);",
|
|
"tests": [
|
|
"assert.deepEqual(bouncer([7, 'ate', '', false, 9]), [7, 'ate', 9], 'should remove falsey values');",
|
|
"assert.deepEqual(bouncer(['a', 'b', 'c']), ['a', 'b', 'c'], 'should return full array if no falsey elements');",
|
|
"assert.deepEqual(bouncer([false, null, 0]), [], 'should return empty array if all elements are falsey');"
|
|
],
|
|
"MDNlinks" : ["Boolean Objects", "Array.filter()"]
|
|
},
|
|
{
|
|
"_id":"a8e512fbe388ac2f9198f0fa",
|
|
"name":"Where art thou",
|
|
"difficulty":"1.55",
|
|
"description":[
|
|
"Make a function that looks through a list (first argument) and returns an array of all objects that have equivalent property values (second argument)."
|
|
],
|
|
"challengeSeed":"function where(collection, source) {\n var arr = [];\r\n // What's in a name?\r\n return arr;\r\n}\n\nwhere([{ first: 'Romeo', last: 'Montague' }, { first: 'Mercutio', last: null }, { first: 'Tybalt', last: 'Capulet' }], { last: 'Capulet' });",
|
|
"tests":[
|
|
"assert.deepEqual(where([{ first: 'Romeo', last: 'Montague' }, { first: 'Mercutio', last: null }, { first: 'Tybalt', last: 'Capulet' }], { last: 'Capulet' }), [{ first: 'Tybalt', last: 'Capulet' }], 'should return an array of objects');",
|
|
"assert.deepEqual(where([{ 'a': 1 }, { 'a': 1 }, { 'a': 1, 'b': 2 }], { 'a': 1 }), [{ 'a': 1 }, { 'a': 1 }, { 'a': 1, 'b': 2 }], 'should return with multiples');"
|
|
],
|
|
"MDNlinks" : ["Global Object", "Object.hasOwnProperty()", "Object.keys()"]
|
|
},
|
|
{
|
|
"_id":"a39963a4c10bc8b4d4f06d7e",
|
|
"name":"Seek and Destroy",
|
|
"difficulty":"1.60",
|
|
"description":[
|
|
"Remove all values (last argument(s)) from an array (first argument) and return as a new array."
|
|
],
|
|
"challengeSeed": "function destroyer(arr) {\n // Remove all the values\r\n return arr;\r\n}\n\ndestroyer([1, 2, 3, 1, 2, 3], 2, 3);",
|
|
"tests": [
|
|
"assert.deepEqual(destroyer([1, 2, 3, 1, 2, 3], 2, 3), [1, 1], 'should remove correct values from an array');",
|
|
"assert.deepEqual(destroyer([1, 2, 3, 5, 1, 2, 3], 2, 3), [1, 5, 1], 'should remove correct values from an array');"
|
|
],
|
|
"MDNlinks" : ["Array.filter()"]
|
|
},
|
|
{
|
|
"_id": "a24c1a4622e3c05097f71d67",
|
|
"name": "Where do I belong",
|
|
"difficulty": "1.61",
|
|
"description": [
|
|
"Return the lowest index at which a value (second argument) should be inserted into a sorted array (first argument).",
|
|
"For example, where([1,2,3,4], 1.5) should return 1 because it is greater than 1 (0th index), but less than 2 (1st index)."
|
|
],
|
|
"challengeSeed": "function where(arr, num) {\n // Find my place in this sorted array.\r\n return num;\r\n}\n\nwhere([40, 60], 50);",
|
|
"tests": [
|
|
"expect(where([10, 20, 30, 40, 50], 35)).to.equal(3);",
|
|
"expect(where([10, 20, 30, 40, 50], 30)).to.equal(2);"
|
|
]
|
|
},
|
|
{
|
|
"_id": "a3566b1109230028080c9345",
|
|
"name": "Sum All Numbers in a Range",
|
|
"difficulty": "2.00",
|
|
"description": [
|
|
"We'll pass you an array of two numbers. Return the sum of those two numbers and all numbers between them.",
|
|
"The lowest number will not always come first."
|
|
],
|
|
"challengeSeed": "function sumAll(arr) {\n return(1);\r\n}\n\nsumAll([1, 4]);",
|
|
"tests": [
|
|
"expect(sumAll([1, 4])).to.be.a('Number');",
|
|
"expect(sumAll([1, 4])).to.equal(10);",
|
|
"expect(sumAll([4, 1])).to.equal(10);",
|
|
"expect(sumAll([5, 10])).to.equal(45);",
|
|
"expect(sumAll([10, 5])).to.equal(45);"
|
|
],
|
|
"MDNlinks" : ["Math.max()", "Math.min()", "Array.reduce()"]
|
|
},
|
|
{
|
|
"_id": "a5de63ebea8dbee56860f4f2",
|
|
"name": "Diff Two Arrays",
|
|
"difficulty": "2.01",
|
|
"description": [
|
|
"Compare two arrays and return a new array with any items not found in both of the original arrays."
|
|
],
|
|
"challengeSeed": "function diff(arr1, arr2) {\n var newArr = [];\r\n // Same, same; but different.\r\n return newArr;\r\n}\n\ndiff([1, 2, 3, 5], [1, 2, 3, 4, 5]);",
|
|
"tests": [
|
|
"expect(diff([1, 2, 3, 5], [1, 2, 3, 4, 5])).to.be.a('array');",
|
|
"assert.deepEqual(diff(['diorite', 'andesite', 'grass', 'dirt', 'pink wool', 'dead shrub'], ['diorite', 'andesite', 'grass', 'dirt', 'dead shrub']), ['pink wool'], 'arrays with only one difference');",
|
|
"assert.includeMembers(diff(['andesite', 'grass', 'dirt', 'pink wool', 'dead shrub'], ['diorite', 'andesite', 'grass', 'dirt', 'dead shrub']), ['diorite', 'pink wool'], 'arrays with more than one difference');",
|
|
"assert.deepEqual(diff(['andesite', 'grass', 'dirt', 'dead shrub'], ['andesite', 'grass', 'dirt', 'dead shrub']), [], 'arrays with no difference');",
|
|
"assert.deepEqual(diff([1, 2, 3, 5], [1, 2, 3, 4, 5]), [4], 'arrays with numbers');",
|
|
"assert.includeMembers(diff([1, 'calf', 3, 'piglet'], [1, 'calf', 3, 4]), ['piglet', 4], 'arrays with numbers and strings');",
|
|
"assert.deepEqual(diff([], ['snuffleupagus', 'cookie monster', 'elmo']), ['snuffleupagus', 'cookie monster', 'elmo'], 'empty array');"
|
|
]
|
|
},
|
|
{
|
|
"_id": "a7f4d8f2483413a6ce226cac",
|
|
"name": "Roman Numeral Converter",
|
|
"tests": [
|
|
"expect(convert(12)).to.equal(\"XII\");",
|
|
"expect(convert(5)).to.equal(\"V\");",
|
|
"expect(convert(9)).to.equal(\"IX\");",
|
|
"expect(convert(29)).to.equal(\"XXIX\");",
|
|
"expect(convert(16)).to.equal(\"XVI\");"
|
|
],
|
|
"difficulty": "2.02",
|
|
"description": [
|
|
"Convert the number be a roman numeral.",
|
|
"All <a href=\"http://www.mathsisfun.com/roman-numerals.html\">roman numerals</a> answers should be provided in upper-case."
|
|
],
|
|
"challengeSeed": "function convert(num) {\n return num;\r\n}\n\nconvert(36);",
|
|
"MDNlinks" : ["Array.splice()", "Array.indexOf()", "Array.join()"]
|
|
},
|
|
{
|
|
"_id": "a0b5010f579e69b815e7c5d6",
|
|
"name": "Search and Replace",
|
|
"tests": [
|
|
"expect(replace(\"Let us go to the store\", \"store\", \"mall\")).to.equal(\"Let us go to the mall\");",
|
|
"expect(replace(\"He is Sleeping on the couch\", \"Sleeping\", \"sitting\")).to.equal(\"He is Sitting on the couch\");",
|
|
"expect(replace(\"This has a spellngi error\", \"spellngi\", \"spelling\")).to.equal(\"This has a spelling error\");",
|
|
"expect(replace(\"His name is Tom\", \"Tom\", \"john\")).to.equal(\"His name is John\");",
|
|
"expect(replace(\"Let us get back to more Coding\", \"Coding\", \"bonfires\")).to.equal(\"Let us get back to more Bonfires\");"
|
|
],
|
|
"difficulty": "2.03",
|
|
"description": [
|
|
"Perform a search and replace on the sentence using the arguments provided and return the new sentence.",
|
|
"First argument is the sentence the perform the search and replace on.",
|
|
"Second argument is the word that you will be replacing (before).",
|
|
"Third argument is what you will be replacing the second argument with (after)."
|
|
],
|
|
"challengeSeed": "function replace(str, before, after) {\n return str;\r\n}\n\nreplace(\"A quick brown fox jumped over the lazy dog\", \"jumped\", \"leaped\");",
|
|
"MDNlinks" : ["Array.splice()", "String.replace()", "Array.join()"]
|
|
},
|
|
{
|
|
"_id": "aa7697ea2477d1316795783b",
|
|
"name": "Pig Latin",
|
|
"tests": [
|
|
"expect(translate(\"california\")).to.equal(\"aliforniacay\");",
|
|
"expect(translate(\"paragraphs\")).to.equal(\"aragraphspay\");",
|
|
"expect(translate(\"glove\")).to.equal(\"oveglay\");",
|
|
"expect(translate(\"algorithm\")).to.equal(\"algorithmway\");",
|
|
"expect(translate(\"eight\")).to.equal(\"eightway\");"
|
|
],
|
|
"difficulty": "2.04",
|
|
"description": [
|
|
"Translate the provided string to pig latin.",
|
|
"<a href=\"http://en.wikipedia.org/wiki/Pig_Latin\">Pig Latin</a> takes the first consonant (or consonant cluster) of an English word, moves it to the end of the word and suffixes an \"ay\".",
|
|
"If a word begins with a vowel you just add \"way\" to the end."
|
|
],
|
|
"challengeSeed": "function translate(str) {\n return str;\r\n}\n\ntranslate(\"consonant\");",
|
|
"MDNlinks" : ["Array.indexOf()", "Array.push()", "Array.join()", "String.substr()", "String.split()"]
|
|
},
|
|
{
|
|
"_id": "afd15382cdfb22c9efe8b7de",
|
|
"name": "DNA Pairing",
|
|
"tests": [
|
|
"assert.deepEqual(pair(\"ATCGA\"),[['A','T'],['T','A'],['C','G'],['G','C'],['A','T']], 'should return the dna pair');",
|
|
"assert.deepEqual(pair(\"TTGAG\"),[['T','A'],['T','A'],['G','C'],['A','T'],['G','C']], 'should return the dna pair');",
|
|
"assert.deepEqual(pair(\"CTCTA\"),[['C','G'],['T','A'],['C','G'],['T','A'],['A','T']], 'should return the dna pair');"
|
|
],
|
|
"difficulty": "2.05",
|
|
"description": [
|
|
"The DNA strand is missing the pairing element. Match each character with the missing element and return the results as a 2d array.",
|
|
"<a href=\"http://en.wikipedia.org/wiki/Base_pair\">Base pairs</a> are a pair of AT and CG. Match the missing element to the provided character.",
|
|
"Return the provided character as the first element in each array."
|
|
],
|
|
"challengeSeed": "function pair(str) {\n return str;\r\n}\n\npair(\"GCG\");",
|
|
"MDNlinks" : ["Array.push()", "String.split()"]
|
|
},
|
|
{
|
|
"_id": "af7588ade1100bde429baf20",
|
|
"name" : "Missing letters",
|
|
"difficulty": "2.05",
|
|
"description" : [
|
|
"Find the missing letter in the passed letter range and return it.",
|
|
"If all letters are present in the range, return undefined."
|
|
],
|
|
"challengeSeed": "function fearNotLetter(str) {\n return str;\n}\n\nfearNotLetter('abce');",
|
|
"tests": [
|
|
"expect(fearNotLetter('abce')).to.equal('d');",
|
|
"expect(fearNotLetter('bcd')).to.be.undefined;",
|
|
"expect(fearNotLetter('abcdefghjklmno')).to.equal('i');",
|
|
"expect(fearNotLetter('yz')).to.be.undefined;"
|
|
],
|
|
"MDNlinks" : ["String.charCodeAt()"]
|
|
},
|
|
{
|
|
"_id": "a77dbc43c33f39daa4429b4f",
|
|
"name": "Boo who",
|
|
"difficulty": "2.06",
|
|
"description": [
|
|
"Check if a value is classified as a boolean primitive. Return true or false.",
|
|
"Boolean primitives are true and false."
|
|
],
|
|
"challengeSeed": "function boo(bool) {\n // What is the new fad diet for ghost developers? The Boolean.\r\n return bool;\r\n}\n\nboo(null);",
|
|
"tests": [
|
|
"assert.strictEqual(boo(true), true);",
|
|
"assert.strictEqual(boo(false), true);",
|
|
"assert.strictEqual(boo([1, 2, 3]), false);",
|
|
"assert.strictEqual(boo([].slice), false);",
|
|
"assert.strictEqual(boo({ 'a': 1 }), false);",
|
|
"assert.strictEqual(boo(1), false);",
|
|
"assert.strictEqual(boo(NaN), false);",
|
|
"assert.strictEqual(boo('a'), false);"
|
|
],
|
|
"MDNlinks" : ["Boolean Objects"]
|
|
},
|
|
{
|
|
"_id": "a105e963526e7de52b219be9",
|
|
"name": "Sorted Union",
|
|
"difficulty": "2.07",
|
|
"description": [
|
|
"Write a function that takes two or more arrays and returns a new array of unique values in the order of the original provided arrays.",
|
|
"In other words, all values present from all arrays should be included in their original order, but with no duplicates in the final array.",
|
|
"The unique numbers should be sorted by their original order, but the final array should not be sorted in numerical order.",
|
|
"Check the assertion tests for examples."
|
|
],
|
|
"challengeSeed": "function unite(arr1, arr2, arr3) {\n return arr1;\r\n}\n\nunite([1, 2, 3], [5, 2, 1, 4], [2, 1]);",
|
|
"tests": [
|
|
"assert.deepEqual(unite([1, 3, 2], [5, 2, 1, 4], [2, 1]), [1, 3, 2, 5, 4], 'should return the union of the given arrays');",
|
|
"assert.deepEqual(unite([1, 3, 2], [1, [5]], [2, [4]]), [1, 3, 2, [5], [4]], 'should not flatten nested arrays');"
|
|
]
|
|
},
|
|
{
|
|
"_id": "a6b0bb188d873cb2c8729495",
|
|
"name": "Convert HTML Entities",
|
|
"difficulty": "2.07",
|
|
"description": [
|
|
"Convert the characters \"&\", \"<\", \">\", '\"', and \"'\", in a string to their corresponding HTML entities."
|
|
],
|
|
"challengeSeed": "function convert(str) {\n // :)\r\n return str;\r\n}\n\nconvert('Dolce & Gabbana');",
|
|
"tests": [
|
|
"assert.strictEqual(convert('Dolce & Gabbana'), 'Dolce & Gabbana', 'should escape characters');",
|
|
"assert.strictEqual(convert('abc'), 'abc', 'should handle strings with nothing to escape');"
|
|
],
|
|
"MDNlinks" : ["RegExp"]
|
|
},
|
|
{
|
|
"_id": "a103376db3ba46b2d50db289",
|
|
"name": "Spinal Tap Case",
|
|
"difficulty": "2.08",
|
|
"description": [
|
|
"Convert a string to spinal case. Spinal case is all-lowercase-words-joined-by-dashes."
|
|
],
|
|
"challengeSeed": "function spinalCase(str) {\n // \"It's such a fine line between stupid, and clever.\"\r\n // --David St. Hubbins\r\n return str;\r\n}\n\nspinalCase('This Is Spinal Tap');",
|
|
"tests": [
|
|
"assert.strictEqual(spinalCase('This Is Spinal Tap'), 'this-is-spinal-tap', 'should return spinal case from string with spaces');",
|
|
"assert.strictEqual(spinalCase('thisIsSpinalTap'), 'this-is-spinal-tap', 'should return spinal case from string with camel case');",
|
|
"assert.strictEqual(spinalCase('The_Andy_Griffith_Show'), 'the-andy-griffith-show', 'should return spinal case from string with snake case');",
|
|
"assert.strictEqual(spinalCase('Teletubbies say Eh-oh'), 'teletubbies-say-eh-oh', 'should return spinal case from string with spaces and hyphens');"
|
|
],
|
|
"MDNlinks" : ["RegExp", "String.replace()"]
|
|
},
|
|
{
|
|
"_id": "a5229172f011153519423690",
|
|
"name": "Sum All Odd Fibonacci Numbers",
|
|
"difficulty": "2.09",
|
|
"description": [
|
|
"Return the sum of all odd Fibonacci numbers up to and including the passed number if it is a Fibonacci number.",
|
|
"The first few numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8, and each subsequent number is the sum of the previous two numbers.",
|
|
"As an example, passing 4 to the function should return 5 because all the odd Fibonacci numbers under 4 are 1, 1, and 3."
|
|
],
|
|
"challengeSeed": "function sumFibs(num) {\n return num;\r\n}\n\nsumFibs(4);",
|
|
"tests": [
|
|
"expect(sumFibs(1)).to.be.a('number');",
|
|
"expect(sumFibs(1000)).to.equal(1785);",
|
|
"expect(sumFibs(4000000)).to.equal(4613732);",
|
|
"expect(sumFibs(4)).to.equal(5);",
|
|
"expect(sumFibs(75024)).to.equal(60696);",
|
|
"expect(sumFibs(75025)).to.equal(135721);"
|
|
],
|
|
"MDNlinks" : ["Remainder"]
|
|
},
|
|
{
|
|
"_id": "a3bfc1673c0526e06d3ac698",
|
|
"name": "Sum All Primes",
|
|
"difficulty": "2.10",
|
|
"description": [
|
|
"Sum all the prime numbers up to and including the provided number.",
|
|
"A prime number is defined as having only two divisors, 1 and itself. For example, 2 is a prime number because it's only divisible by 1 and 2. 1 isn't a prime number, because it's only divisible by itself.",
|
|
"The provided number may not be a prime."
|
|
],
|
|
"challengeSeed": "function sumPrimes(num) {\n return num;\r\n}\n\nsumPrimes(10);",
|
|
"tests": [
|
|
"expect(sumPrimes(10)).to.be.a('number');",
|
|
"expect(sumPrimes(10)).to.equal(17);",
|
|
"expect(sumPrimes(977)).to.equal(73156);"
|
|
]
|
|
},
|
|
{
|
|
"_id": "ae9defd7acaf69703ab432ea",
|
|
"name": "Smallest Common Multiple",
|
|
"difficulty": "2.11",
|
|
"description": [
|
|
"Find the smallest number that evenly divides all numbers in the provided range.",
|
|
"The range will be an array of two numbers that will not necessarily be in numerical order."
|
|
],
|
|
"challengeSeed": "function smallestCommons(arr) {\n return arr;\r\n}\r\n\n\nsmallestCommons([1,5]);",
|
|
"tests": [
|
|
"expect(smallestCommons([1,5])).to.be.a('number');",
|
|
"expect(smallestCommons([1,5])).to.equal(60);",
|
|
"expect(smallestCommons([5,1])).to.equal(60);",
|
|
"(smallestCommons([1,13])).should.equal(360360);"
|
|
]
|
|
},
|
|
{
|
|
"_id": "a6e40f1041b06c996f7b2406",
|
|
"name": "Finders Keepers",
|
|
"difficulty": "2.12",
|
|
"description": [
|
|
"Create a function that looks through an array (first argument) and returns the first element in the array that passes a truth test (second argument)."
|
|
],
|
|
"challengeSeed": "function find(arr, func) {\n var num = 0;\r\n return num;\r\n}\n\nfind([1, 2, 3, 4], function(num){ return num % 2 === 0; });",
|
|
"tests": [
|
|
"assert.strictEqual(find([1, 3, 5, 8, 9, 10], function(num) { return num % 2 === 0; }), 8, 'should return first found value');",
|
|
"assert.strictEqual(find([1, 3, 5, 9], function(num) { return num % 2 === 0; }), undefined, 'should return undefined if not found');"
|
|
],
|
|
"MDNlinks" : ["Array.some()"]
|
|
},
|
|
{
|
|
"_id": "a5deed1811a43193f9f1c841",
|
|
"name": "Drop it like it's hot",
|
|
"difficulty": "2.13",
|
|
"description": [
|
|
"Drop the elements of an array (first argument), starting from the front, until the predicate (second argument) returns true."
|
|
],
|
|
"challengeSeed": "function drop(arr, func) {\n // Drop them elements.\r\n return arr;\r\n}\n\ndrop([1, 2, 3], function(n) {return n < 3; });",
|
|
"tests": [
|
|
"expect(drop([1, 2, 3, 4], function(n) {return n >= 3; })).to.eqls([3, 4]);",
|
|
"expect(drop([1, 2, 3], function(n) {return n > 0; })).to.eqls([1, 2, 3]);",
|
|
"expect(drop([1, 2, 3, 4], function(n) {return n > 5; })).to.eqls([]);"
|
|
],
|
|
"MDNlinks" : ["Arguments object", "Array.shift()"]
|
|
},
|
|
{
|
|
"_id": "ab306dbdcc907c7ddfc30830",
|
|
"name": "Steamroller",
|
|
"difficulty": "2.14",
|
|
"description": [
|
|
"Flatten a nested array. You must account for varying levels of nesting."
|
|
],
|
|
"challengeSeed": "function steamroller(arr) {\n // I'm a steamroller, baby\r\n return arr;\r\n}\n\nsteamroller([1, [2], [3, [[4]]]]);",
|
|
"tests": [
|
|
"assert.deepEqual(steamroller([[['a']], [['b']]]), ['a', 'b'], 'should flatten nested arrays');",
|
|
"assert.deepEqual(steamroller([1, [2], [3, [[4]]]]), [1, 2, 3, 4], 'should flatten nested arrays');",
|
|
"assert.deepEqual(steamroller([1, [], [3, [[4]]]]), [1, 3, 4], 'should work with empty arrays');"
|
|
],
|
|
"MDNlinks" : ["Array.isArray()"]
|
|
},
|
|
{
|
|
"_id": "a8d97bd4c764e91f9d2bda01",
|
|
"name": "Binary Agents",
|
|
"difficulty": "2.15",
|
|
"description": [
|
|
"Return an English translated sentence of the passed binary string.",
|
|
"The binary string will be space separated."
|
|
],
|
|
"challengeSeed": "function binaryAgent(str) {\n return str;\r\n}\n\nbinaryAgent('01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111');",
|
|
"tests": [
|
|
"expect(binaryAgent('01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111')).to.equal(\"Aren't bonfires fun!?\");",
|
|
"expect(binaryAgent('01001001 00100000 01101100 01101111 01110110 01100101 00100000 01000110 01110010 01100101 01100101 01000011 01101111 01100100 01100101 01000011 01100001 01101101 01110000 00100001')).to.equal(\"I love FreeCodeCamp!\");"
|
|
],
|
|
"MDNlinks" : ["String.charCodeAt()", "String.fromCharCode()"]
|
|
},
|
|
{
|
|
"_id" : "a3f503de51cfab748ff001aa",
|
|
"name": "Pairwise",
|
|
"difficulty": "2.16",
|
|
"description": [
|
|
"Return the sum of all indices of elements of 'arr' that can be paired with one other element to form a sum that equals the value in the second argument 'arg'. If multiple sums are possible, return the smallest sum. Once an element has been used, it cannot be reused to pair with another.",
|
|
"For example, pairwise([1, 4, 2, 3, 0, 5], 7) should return 11 because 4, 2, 3 and 5 can be paired with each other to equal 7.",
|
|
"pairwise([1, 3, 2, 4], 4) would only equal 1, because only the first two elements can be paired to equal 4, and the first element has an index of 0!"
|
|
],
|
|
"challengeSeed": "function pairwise(arr, arg) {\n return arg;\n}\n\npairwise([1,4,2,3,0,5], 7);",
|
|
"tests": [
|
|
"expect(pairwise([1, 4, 2, 3, 0, 5], 7)).to.equal(11);",
|
|
"expect(pairwise([1, 3, 2, 4], 4)).to.equal(1);",
|
|
"expect(pairwise([1,1,1], 2)).to.equal(1);",
|
|
"expect(pairwise([0, 0, 0, 0, 1, 1], 1)).to.equal(10);",
|
|
"expect(pairwise([], 100)).to.equal(0);"
|
|
]
|
|
},
|
|
{
|
|
"_id": "a3f503de51cf954ede28891d",
|
|
"name": "Symmetric Difference",
|
|
"difficulty": "2.20",
|
|
"description": [
|
|
"Create a function that takes two or more arrays and returns an array of the symmetric difference of the provided arrays.",
|
|
"The mathematical term symmetric difference refers to the elements in two sets that are in either the first or second set, but not in both."
|
|
],
|
|
"challengeSeed": "function sym(arr) {\n return arr;\r\n}\n\nsym([1, 2, 3], [5, 2, 1, 4]);",
|
|
"tests": [
|
|
"assert.deepEqual(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]), [1, 4, 5], 'should return the symmetric difference of the given arrays');",
|
|
"assert.deepEqual(sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5]), [1, 4, 5], 'should return an array of unique values');",
|
|
"assert.deepEqual(sym([1, 1]), [1], 'should return an array of unique values');"
|
|
]
|
|
},
|
|
{
|
|
"_id": "a10d2431ad0c6a099a4b8b52",
|
|
"name": "Everything Be True",
|
|
"difficulty": "2.21",
|
|
"description": [
|
|
"Check if the predicate (second argument) returns truthy (defined) for all elements of a collection (first argument).",
|
|
"For this, check to see if the property defined in the second argument is present on every element of the collection.",
|
|
"Remember, you can access object properties through either dot notation or [] notation."
|
|
],
|
|
"challengeSeed": "function every(collection, pre) {\n // Does everyone have one of these?\r\n return pre;\r\n}\n\nevery([{'user': 'Tinky-Winky', 'sex': 'male'}, {'user': 'Dipsy', 'sex': 'male'}, {'user': 'Laa-Laa', 'sex': 'female'}, {'user': 'Po', 'sex': 'female'}], 'sex');",
|
|
"tests": [
|
|
"assert.strictEqual(every([{'user': 'Tinky-Winky', 'sex': 'male'}, {'user': 'Dipsy', 'sex': 'male'}, {'user': 'Laa-Laa', 'sex': 'female'}, {'user': 'Po', 'sex': 'female'}], 'sex'), true, 'should return true if predicate returns truthy for all elements in the collection');",
|
|
"assert.strictEqual(every([{'user': 'Tinky-Winky', 'sex': 'male'}, {'user': 'Dipsy', 'sex': 'male'}, {'user': 'Laa-Laa', 'sex': 'female'}, {'user': 'Po', 'sex': 'female'}], {'sex': 'female'}), false, 'should return false if predicate returns falsey for any element in the collection');"
|
|
],
|
|
"MDNlinks" : ["Object.hasOwnProperty()", "Object.getOwnPropertyNames()"]
|
|
},
|
|
{
|
|
"_id": "a97fd23d9b809dac9921074f",
|
|
"name": "Arguments Optional",
|
|
"difficulty": "2.22",
|
|
"description": [
|
|
"Create a function that sums two arguments together. If only one argument is provided, return a function that expects one additional argument and will return the sum.",
|
|
"For example, add(2, 3) should return 5, and add(2) should return a function that is waiting for an argument so that <code>var sum2And = add(2); return sum2And(3); // 5</code>",
|
|
"If either argument isn't a valid numbers, return undefined"
|
|
],
|
|
"challengeSeed": "function add() {\n return false;\n}\n\nadd(2,3);",
|
|
"tests": [
|
|
"expect(add(2, 3)).to.equal(5);",
|
|
"expect(add(2)(3)).to.equal(5);",
|
|
"expect(add('http://bit.ly/IqT6zt')).to.be.undefined;"
|
|
],
|
|
"MDNlinks": ["Global Function Object", "Arguments object"]
|
|
},
|
|
{
|
|
"_id": "a2f1d72d9b908d0bd72bb9f6",
|
|
"name": "Make a Person",
|
|
"difficulty": "3.12",
|
|
"description": [
|
|
"Fill in the object constructor with the methods specified in the tests.",
|
|
"Those methods are getFirstName(), getLastName(), getFullName(), setFirstName(), setLastName(), and setFullName().",
|
|
"These methods must be the only available means for interacting with the object."
|
|
],
|
|
"challengeSeed": "var Person = function(firstAndLast) {\n return firstAndLast;\r\n};\n\nvar bob = new Person('Bob Ross');\nbob.getFullName();",
|
|
"tests": [
|
|
"expect(Object.keys(bob).length).to.eql(6);",
|
|
"expect(bob instanceof Person).to.be.true;",
|
|
"expect(bob.firstName).to.be.undefined();",
|
|
"expect(bob.lastName).to.be.undefined();",
|
|
"expect(bob.getFirstName()).to.eql('Bob');",
|
|
"expect(bob.getLastName()).to.eql('Ross');",
|
|
"expect(bob.getFullName()).to.eql('Bob Ross');",
|
|
"bob.setFirstName('Happy');",
|
|
"expect(bob.getFirstName()).to.eql('Happy');",
|
|
"bob.setLastName('Trees');",
|
|
"expect(bob.getLastName()).to.eql('Trees');",
|
|
"bob.setFullName('George Carlin');",
|
|
"expect(bob.getFullName()).to.eql('George Carlin');",
|
|
"bob.setFullName('Bob Ross');"
|
|
],
|
|
"MDNlinks" : ["Closures", "Details of the Object Model"]
|
|
},
|
|
{
|
|
"_id": "af4afb223120f7348cdfc9fd",
|
|
"name": "Map the Debris",
|
|
"difficulty": "3.50",
|
|
"description": [
|
|
"Return a new array that transforms the element's average altitude into their orbital periods.",
|
|
"The array will contain objects in the format <code>{name: 'name', avgAlt: avgAlt}</code>.",
|
|
"You can read about orbital periods <a href=\"http://en.wikipedia.org/wiki/Orbital_period\">on wikipedia</a>.",
|
|
"The values should be rounded to the nearest whole number. The body being orbited is Earth.",
|
|
"The radius of the earth is 6367.4447 kilometers, and the GM value of earth is 398600.4418"
|
|
],
|
|
"challengeSeed": "function orbitalPeriod(arr) {\n var GM = 398600.4418;\n var earthRadius = 6367.4447;\n return arr;\r\n}\r\n\r\norbitalPeriod([{name : \"sputkin\", avgAlt : 35873.5553}]);",
|
|
"tests": [
|
|
"expect(orbitalPeriod([{name : \"sputkin\", avgAlt : 35873.5553}])).to.eqls([{name: \"sputkin\", orbitalPeriod: 86400}]);",
|
|
"expect(orbitalPeriod([{name: \"iss\", avgAlt: 413.6}, {name: \"hubble\", avgAlt: 556.7}, {name: \"moon\", avgAlt: 378632.553}])).to.eqls([{name : \"iss\", orbitalPeriod: 5557}, {name: \"hubble\", orbitalPeriod: 5734}, {name: \"moon\", orbitalPeriod: 2377399}]);"
|
|
],
|
|
"MDNlinks" : ["Math.pow()"]
|
|
},
|
|
{
|
|
"_id": "aff0395860f5d3034dc0bfc9",
|
|
"name": "Validate US Telephone Numbers",
|
|
"difficulty": "4.01",
|
|
"description": [
|
|
"Return true if the passed string is a valid US phone number",
|
|
"The user may fill out the form field any way they choose as long as it is a valid US number. The following are all valid formats for US numbers:",
|
|
"555-555-5555, (555)555-5555, (555) 555-5555, 555 555 5555, 5555555555, 1 555 555 5555",
|
|
"For this challenge you will be presented with a string such as \"800-692-7753\" or \"8oo-six427676;laskdjf\". Your job is to validate or reject the US phone number based on any combination of the formats provided above. The area code is required. If the country code is provided, you must confirm that the country code is \"1\". Return true if the string is a valid US phone number; otherwise false."
|
|
],
|
|
"tests": [
|
|
"expect(telephoneCheck(\"555-555-5555\")).to.be.a(\"boolean\");",
|
|
"assert.deepEqual(telephoneCheck(\"1 555-555-5555\"), true);",
|
|
"assert.deepEqual(telephoneCheck(\"1 (555) 555-5555\"), true);",
|
|
"assert.deepEqual(telephoneCheck(\"5555555555\"), true);",
|
|
"assert.deepEqual(telephoneCheck(\"555-555-5555\"), true);",
|
|
"assert.deepEqual(telephoneCheck(\"(555)555-5555\"), true);",
|
|
"assert.deepEqual(telephoneCheck(\"1(555)555-5555\"), true);",
|
|
"assert.deepEqual(telephoneCheck(\"1 555 555 5555\"), true);",
|
|
"assert.deepEqual(telephoneCheck(\"555-555-5555\"), true);",
|
|
"assert.deepEqual(telephoneCheck(\"1 456 789 4444\"), true);",
|
|
"assert.deepEqual(telephoneCheck(\"123**&!!asdf#\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"55555555\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"(6505552368)\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"2 (757) 622-7382\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"0 (757) 622-7382\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"-1 (757) 622-7382\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"2 757 622-7382\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"10 (757) 622-7382\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"27576227382\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"(275)76227382\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"2(757)6227382\"), false);",
|
|
"assert.deepEqual(telephoneCheck(\"2(757)622-7382\"), false);"
|
|
],
|
|
"challengeSeed": "function telephoneCheck(str) {\n // Good luck!\n return true;\n}\n\n\n\ntelephoneCheck(\"555-555-5555\");"
|
|
},
|
|
{
|
|
"_id": "aa2e6f85cab2ab736c9a9b24",
|
|
"name": "Cash Register",
|
|
"difficulty": "4.02",
|
|
"description": [
|
|
"Design a cash register drawer function that accepts purchase price as the first argument, payment as the second argument, and cash-in-drawer (cid) as the third argument.", "cid is a 2d array listing available currency.", "Return the string \"Insufficient Funds\" if cash-in-drawer is less than the change due. Return the string \"Closed\" if cash-in-drawer is equal to the change due.", "Otherwise, return change in coin and bills, sorted in highest to lowest order."
|
|
],
|
|
"challengeSeed": "function drawer(price, cash, cid) {\n var change;\r\n // Here is your change, ma'am.\r\n return change;\r\n}\r\n\r\n// Example cash-in-drawer array:\r\n// [['PENNY', 1.01],\r\n// ['NICKEL', 2.05],\r\n// ['DIME', 3.10],\r\n// ['QUARTER', 4.25],\r\n// ['ONE', 90.00],\r\n// ['FIVE', 55.00],\r\n// ['TEN', 20.00],\r\n// ['TWENTY', 60.00],\r\n// ['ONE HUNDRED', 100.00]]\n\ndrawer(19.50, 20.00, [['PENNY', 1.01], ['NICKEL', 2.05], ['DIME', 3.10], ['QUARTER', 4.25], ['ONE', 90.00], ['FIVE', 55.00], ['TEN', 20.00], ['TWENTY', 60.00], ['ONE HUNDRED', 100.00]]);",
|
|
"tests": [
|
|
"expect(drawer(19.50, 20.00, [['PENNY', 1.01], ['NICKEL', 2.05], ['DIME', 3.10], ['QUARTER', 4.25], ['ONE', 90.00], ['FIVE', 55.00], ['TEN', 20.00], ['TWENTY', 60.00], ['ONE HUNDRED', 100.00]])).to.be.a('array');",
|
|
"expect(drawer(19.50, 20.00, [['PENNY', 0.01], ['NICKEL', 0], ['DIME', 0], ['QUARTER', 0], ['ONE', 0], ['FIVE', 0], ['TEN', 0], ['TWENTY', 0], ['ONE HUNDRED', 0]])).to.be.a('string');",
|
|
"expect(drawer(19.50, 20.00, [['PENNY', 0.50], ['NICKEL', 0], ['DIME', 0], ['QUARTER', 0], ['ONE', 0], ['FIVE', 0], ['TEN', 0], ['TWENTY', 0], ['ONE HUNDRED', 0]])).to.be.a('string');",
|
|
"assert.deepEqual(drawer(19.50, 20.00, [['PENNY', 1.01], ['NICKEL', 2.05], ['DIME', 3.10], ['QUARTER', 4.25], ['ONE', 90.00], ['FIVE', 55.00], ['TEN', 20.00], ['TWENTY', 60.00], ['ONE HUNDRED', 100.00]]), [['QUARTER', 0.50]], 'return correct change');",
|
|
"assert.deepEqual(drawer(3.26, 100.00, [['PENNY', 1.01], ['NICKEL', 2.05], ['DIME', 3.10], ['QUARTER', 4.25], ['ONE', 90.00], ['FIVE', 55.00], ['TEN', 20.00], ['TWENTY', 60.00], ['ONE HUNDRED', 100.00]]), [['TWENTY', 60.00], ['TEN', 20.00], ['FIVE', 15], ['ONE', 1], ['QUARTER', 0.50], ['DIME', 0.20], ['PENNY', 0.04] ], 'return correct change with multiple coins and bills');",
|
|
"assert.deepEqual(drawer(19.50, 20.00, [['PENNY', 0.01], ['NICKEL', 0], ['DIME', 0], ['QUARTER', 0], ['ONE', 0], ['FIVE', 0], ['TEN', 0], ['TWENTY', 0], ['ONE HUNDRED', 0]]), 'Insufficient Funds', 'insufficient funds');",
|
|
"assert.deepEqual(drawer(19.50, 20.00, [['PENNY', 0.50], ['NICKEL', 0], ['DIME', 0], ['QUARTER', 0], ['ONE', 0], ['FIVE', 0], ['TEN', 0], ['TWENTY', 0], ['ONE HUNDRED', 0]]), \"Closed\", 'cash-in-drawer equals change');"
|
|
]
|
|
},
|
|
{
|
|
"_id": "a56138aff60341a09ed6c480",
|
|
"name": "Inventory Update",
|
|
"difficulty": "4.03",
|
|
"description": [
|
|
"Compare and update inventory stored in a 2d array against a second 2d array of a fresh delivery. Update current inventory item quantity, and if an item cannot be found, add the new item and quantity into the inventory array in alphabetical order."
|
|
],
|
|
"challengeSeed": "function inventory(arr1, arr2) {\n // All inventory must be accounted for or you're fired!\r\n return arr1;\r\n}\n\n// Example inventory lists\r\nvar curInv = [\r\n [21, 'Bowling Ball'],\r\n [2, 'Dirty Sock'],\r\n [1, 'Hair Pin'],\r\n [5, 'Microphone']\r\n];\r\n\r\nvar newInv = [\r\n [2, 'Hair Pin'],\r\n [3, 'Half-Eaten Apple'],\r\n [67, 'Bowling Ball'],\r\n [7, 'Toothpaste']\r\n];\r\n\r\ninventory(curInv, newInv);",
|
|
"tests": [
|
|
"expect(inventory([[21, 'Bowling Ball'], [2, 'Dirty Sock'], [1, 'Hair Pin'], [5, 'Microphone']], [[2, 'Hair Pin'], [3, 'Half-Eaten Apple'], [67, 'Bowling Ball'], [7, 'Toothpaste']])).to.be.a('array');",
|
|
"assert.equal(inventory([[21, 'Bowling Ball'], [2, 'Dirty Sock'], [1, 'Hair Pin'], [5, 'Microphone']], [[2, 'Hair Pin'], [3, 'Half-Eaten Apple'], [67, 'Bowling Ball'], [7, 'Toothpaste']]).length, 6);",
|
|
"assert.deepEqual(inventory([[21, 'Bowling Ball'], [2, 'Dirty Sock'], [1, 'Hair Pin'], [5, 'Microphone']], [[2, 'Hair Pin'], [3, 'Half-Eaten Apple'], [67, 'Bowling Ball'], [7, 'Toothpaste']]), [[88, 'Bowling Ball'], [2, 'Dirty Sock'], [3, 'Hair Pin'], [3, 'Half-Eaten Apple'], [5, 'Microphone'], [7, 'Toothpaste']]);",
|
|
"assert.deepEqual(inventory([[21, 'Bowling Ball'], [2, 'Dirty Sock'], [1, 'Hair Pin'], [5, 'Microphone']], []), [[21, 'Bowling Ball'], [2, 'Dirty Sock'], [1, 'Hair Pin'], [5, 'Microphone']]);",
|
|
"assert.deepEqual(inventory([], [[2, 'Hair Pin'], [3, 'Half-Eaten Apple'], [67, 'Bowling Ball'], [7, 'Toothpaste']]), [[67, 'Bowling Ball'], [2, 'Hair Pin'], [3, 'Half-Eaten Apple'], [7, 'Toothpaste']]);",
|
|
"assert.deepEqual(inventory([[0, 'Bowling Ball'], [0, 'Dirty Sock'], [0, 'Hair Pin'], [0, 'Microphone']], [[1, 'Hair Pin'], [1, 'Half-Eaten Apple'], [1, 'Bowling Ball'], [1, 'Toothpaste']]), [[1, 'Bowling Ball'], [0, 'Dirty Sock'], [1, 'Hair Pin'], [1, 'Half-Eaten Apple'], [0, 'Microphone'], [1, 'Toothpaste']]);"
|
|
]
|
|
},
|
|
{
|
|
"_id": "a7bf700cd123b9a54eef01d5",
|
|
"name": "No repeats please",
|
|
"difficulty": "4.04",
|
|
"description": [
|
|
"Return the number of total permutations of the provided string that don't have repeated consecutive letters.",
|
|
"For example, 'aab' should return 2 because it has 6 total permutations, but only 2 of them don't have the same letter (in this case 'a') repeating."
|
|
],
|
|
"challengeSeed": "function permAlone(str) {\n return str;\n}\n\npermAlone('aab');",
|
|
"tests": [
|
|
"expect(permAlone('aab')).to.be.a.number;",
|
|
"expect(permAlone('aab')).to.equal(2);",
|
|
"expect(permAlone('aaa')).to.equal(0);",
|
|
"expect(permAlone('aabb')).to.equal(8);",
|
|
"expect(permAlone('abcdefa')).to.equal(3600);",
|
|
"expect(permAlone('abfdefa')).to.equal(2640);",
|
|
"expect(permAlone('zzzzzzzz')).to.equal(0);"
|
|
]
|
|
},
|
|
{
|
|
"_id": "a19f0fbe1872186acd434d5a",
|
|
"name": "Friendly Date Ranges",
|
|
"difficulty": "4.05",
|
|
"description": [
|
|
"Implement a way of converting two dates into a more friendly date range that could be presented to a user.",
|
|
"It must not show any redundant information in the date range.",
|
|
"For example, if the year and month are the same then only the day range should be displayed.",
|
|
"Secondly, if the starting year is the current year, and the ending year can be inferred by the reader, the year should be omitted.",
|
|
"Input date is formatted as YYYY-MM-DD"
|
|
],
|
|
"challengeSeed": "function friendly(str) {\n return str;\n}\n\nfriendly(['2015-07-01', '2015-07-04']);",
|
|
"tests": [
|
|
"assert.deepEqual(friendly(['2015-07-01', '2015-07-04']), ['July 1st','4th'], 'ending month should be omitted since it is already mentioned');",
|
|
"assert.deepEqual(friendly(['2015-12-01', '2016-02-03']), ['December 1st','February 3rd'], 'one month apart can be inferred it is the next year');",
|
|
"assert.deepEqual(friendly(['2015-12-01', '2017-02-03']), ['December 1st, 2015','February 3rd, 2017']);",
|
|
"assert.deepEqual(friendly(['2016-03-01', '2016-05-05']), ['March 1st','May 5th, 2016']);",
|
|
"assert.deepEqual(friendly(['2017-01-01', '2017-01-01']), ['January 1st, 2017'], 'since we do not duplicate only return once');",
|
|
"assert.deepEqual(friendly(['2022-09-05', '2023-09-04']), ['September 5th, 2022','September 4th, 2023']);"
|
|
],
|
|
"MDNlinks" : ["String.split()", "String.substr()", "parseInt()"]
|
|
}
|
|
]
|