FCC Algorithm

Réussis tes devoirs et examens dès maintenant avec Quizwiz!

Make a Person Fill in the object constructor with the following methods below: getFirstName() getLastName() getFullName() setFirstName(first) setLastName(last) setFullName(firstAndLast) Run the tests to see the expected output for each method. The methods that take an argument must accept only one argument and it has to be a string. These methods must be the only available means of interacting with the object.

Exact Change Design a cash register drawer function checkCashRegister() that accepts purchase price as the first argument (price), payment as the second argument (cash), 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 function checkCashRegister(price, cash, cid) { } checkCashRegister(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]]) ;

Map the Debris intermidiate colution function orbitalPeriod(arr) { var GM = 398600.4418; var earthRadius = 6367.4447; //loop through each key in array object for(var prop in arr) { //rouding off the orbital period value var orbitalPer = Math.round(2 * Math.PI * Math.sqrt(Math.pow(arr[prop].avgAlt + earchRadius,3) /GM)); // deleting the avgAlt property delete arr[prop].avgAlt; //adding orbitalPeriod property arr[prop].orbitalPeriod = orbitalPer; } return arr; } // test here orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}]);

Map the Debris advanced solution function orbitalPeriod(arr) { var GM = 398600.4418; var earthRadius = 6367.4447; arr.forEach(function(item){ var tmp = Math.round(2* Math.PI * Math.sqrt(Math.pow(earthRadius + item.avgAlt,3)/GM)); delete item.avgAlt; item.orbitalPeriod = tmp; }); return arr; } // test here orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}]);

No repeats please

freecode camp solution // create a regex var regex = /(.)\1+/g; //split the string into an array var arr = str.split(''); var permutations = []; var tmp; //return 0 if str contains same character if(str.match(regex)! == null && str.match(regex)[0] === str) return 0; //function to swap variable content. function swap(index1, index2){ temp = arr[index1]; arr[index1] = arr[index2]; arr[index2] = temp; } //generate arrays of permutations using the algorithm function generate(int) { if(int ===1) { //make sure to join the characters aw we create the permutation arrays permutations.push(arr.join(''); } else { for(var i=0; i!=int; ++i){ generate(int-1); swap(int%2?0:i,int-1); } } } generate(arr.length); //filter the array of repeated permutations var filterd = permutations.filter(function(string) { return !string.match(regex); }); return filtered.length; }

Arguments Optional Create a function that sums two arguments together. If only one argument is provided, then return a function that expects one argument and returns the sum. For example, addTogether(2, 3) should return 5, and addTogether(2) should return a function. Calling this returned function with a single argument will then return the sum: var sumTwoAnd = addTogether(2); sumTwoAnd(3) returns 5. If either argument isn't a valid number, return undefined.

Binary Agents Return an English translated sentence of the passed binary string. The binary string will be space separated. function binaryAgent(str) { } binaryAgent("01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111");

Falsy Bouncer Remove all falsy values from an array. Falsy values in JavaScript are false, null, 0, "", undefined, and NaN. function bouncer(arr) { } bouncer([7, "ate", "", false, 9]);

function bouncer(arr) { return arr.filter(Boolean); } bouncer([7, "ate", "", false, 9]);

Chunky Monkey Write a function that splits an array (first argument) into groups the length of size (second argument) and returns them as a two-dimensional array. function chunkArrayInGroups(arr, size) { } chunkArrayInGroups(["a", "b", "c", "d"], 2);

function chunckArrayInGroups(arr,size) { var newArray = []; for(var i = 0; i < arr.length; i+= size) { newArray.push(arr.slice( i, size+i)); } return newArray; } chunkArrayInGroups(["a", "b", "c", "d"], 2);

Confirm the Ending Check if a string (first argument, str) ends with the given target string (second argument, target). This challenge can be solved with the .endsWith() method, which was introduced in ES2015. But for the purpose of this challenge, we would like you to use one of the JavaScript substring methods instead. function confirmEnding(str, target) { } confirmEnding("Bastian", "n");

function confirmEnding(str , target) { if(str.substr(-target.length) == target) { return true; } else { return false; } } confirmEnding("Bastian", "n");

Convert HTML Entities Convert the characters &, <, >, " (double quote), and ' (apostrophe), in a string to their corresponding HTML entities. function convertHTML(str) { // &colon;) var result = str.split(''); for (var i=0; i<result.length; i++){ } convertHTML("Dolce & Gabbana");

Seek and Destroy You will be provided with an initial array (the first argument in the destroyer function), followed by one or more arguments. Remove all elements from the initial array that are of the same value as these arguments. function destroyer(arr) { } destroyer([1, 2, 3, 1, 2, 3], 2, 3);

function destroyer(arr) { var args = Array.prototype.slice.call(arguments); args.splice(0,1); return arr.filter(function(element) { return args.indexOf(element) === -1; }); } destroyer([1, 2, 3, 1, 2, 3], 2, 3);

Compare two arrays and return a new array with any items only found in one of the two given arrays, but not both. In other words, return the symmetric difference of the two arrays. function diffArray(arr1, arr2) { var newArr = []; return newArr; } diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]);

Algorithm Drop It Drop the elements of an array (first argument), starting from the front, until the predicate (second argument) returns true. The second argument, func, is a function you'll use to test the first elements of the array to decide if you should drop it or not. function dropElements(arr, func) { } return arr; } dropElements([1, 2, 3, 4], function(n) {return n > 5;});

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 = 120 function factorialize(num) { } factorialize(5);

function factorialize(num) { var factorial = 1; for ( var n = 2; n <=num; n++) { factorial = factorial *n;} return factorial; } factorialize(5);

Missing letters Find the missing letter in the passed letter range and return it. If all letters are present in the range, return undefined. function fearNotLetter(str) { for (var i=0; i<str.length; i++){ var code = str.charCodeAt(i); if (code !== str.charCodeAt(0) +i ){ return String.fromCharCode(code-1); } } return undefined; } fearNotLetter("abce");

Finders Keepers 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). function findElement(arr, func) { } findElement([1, 3, 5, 8, 9, 10,20], function(num){ return num % 5 === 0; });

function findElement(arr, func) { var num = 0; num = arr.filter(func); num.splice(1); return num[0]; } findElement([1, 3, 5, 8, 9, 10,20], function(num){ return num % 5 === 0; });

Return the length of the longest word in the provided sentence. Your response should be a number. function findLongestWord(str) { } findLongestWord("The quick brown fox jumped over the lazy dog");

Where do I belong Return the lowest index at which a value (second argument) should be inserted into an array (first argument) once it has been sorted. The returned value should be a number. For example, getIndexToIns([1,2,3,4], 1.5) should return 1 because it is greater than 1 (index 0), but less than 2 (index 1). Likewise, getIndexToIns([20,3,5], 19) should return 2 because once the array has been sorted it will look like [3,5,20] and 19 is less than 20 (index 2) and greater than 5 (index 1). function getIndexToIns(arr, num) { return arr.length; } getIndexToIns([2, 5, 10], 50);

Return Largest Numbers in Arrays 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] function largestOfFour(arr) { // You can do this! return longestWord; } largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);

Mutations Return true if the string in the first element of the array contains all of 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". Lastly, ["Alien", "line"], should return true because all of the letters in "line" are present in "Alien". function mutation(arr) { var test = arr[1].toLowerCase(); var target = arr[0].toLowerCase(); for (i=0; i<test.length; i++) { if (target.indexOf(test[i])< 0) return false; } return true; } mutation(["hello", "hey"]);

function mutation(arr) { var test = arr[1].toLowerCase(); var target = arr[0].toLowerCase(); for(i=0; i<test.length; i++) { if(target.indexOf(text[i]) < 0) return false; } return true; } mutation(["hello","hey"]);

Map the Debris Return a new array that transforms the element's average altitude into their orbital periods. The array will contain objects in the format {name: 'name', avgAlt: avgAlt}. You can read about orbital periods on wikipedia. 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 km3s-2.

Pairwise Given an array arr, find element pairs whose sum equal the second argument arg and return the sum of their indices. If multiple pairs are possible that have the same numeric elements but different indices, return the smallest sum of indices. Once an element has been used, it cannot be reused to pair with another. For example pairwise([7, 9, 11, 13, 15], 20) returns 6. The pairs that sum to 20 are [7, 13] and [9, 11]. We can then write out the array with their indices and values.

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. Note You'll need to remove all non-alphanumeric characters (punctuation, spaces and symbols) 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. We'll also pass strings with special symbols, such as "2A3*3a2", "2A3 3a2", and "2_A3*3#A2". function palindrome(str) { } palindrome("don");

No repeats please Return the number of total permutations of the provided string that don't have repeated consecutive letters. Assume that all characters in the provided string are each unique. For example, aab should return 2 because it has 6 total permutations (aab, aab, aba, aba, baa, baa), but only 2 of them (aba and aba) don't have the same letter (in this case a) repeating.

Repeat a string repeat a string Repeat a given string (first argument) num times (second argument). Return an empty string if num is not a positive number. function repeatStringNumTimes(str, num) { } repeatStringNumTimes("abc", 3);

function repeatStringNumTimes(str,num) { if (num > 0) { return str.repeat(num); } else { return "" ; } } repeatStringNumTimes("abc", 3);

You may need to turn the string into an array before you can reverse it. Your result must be a string. function reverseString(str) { } reverseString("hello");

function reverseString(str) { return str.split(' ').reverse().join(' '); reverseString("hello");

Caesars Cipher One of the simplest and most widely known ciphers is a Caesar cipher, also known as a shift cipher. In a shift cipher the meanings of the letters are shifted by some set amount. A common modern use is the ROT13 cipher, where the values of the letters are shifted by 13 places. Thus 'A' ↔ 'N', 'B' ↔ 'O' and so on. Write a function which takes a ROT13 encoded string as input and returns a decoded string. All letters will be uppercase. Do not transform any non-alphabetic character (i.e. spaces, punctuation), but do pass them on. function rot13(str) { // LBH QVQ VG! } // Change the inputs below to test rot13("SERR PBQR PNZC");

Slasher Flick Return the remaining elements of an array after chopping off n elements from the head. The head means the beginning of the array, or the zeroth index. function slasher(arr, howMany) { } slasher([1, 2, 3], 2);

function slasher(arr, howMany) { arr.splice(0,howMany); return arr; } slasher([1,2,3], 2);

Smallest Common Multiple Find the smallest common multiple of the provided parameters that can be evenly divided by both, as well as by all sequential numbers in the range between these parameters. The range will be an array of two numbers that will not necessarily be in numerical order. e.g. for 1 and 3 - find the smallest common multiple of both 1 and 3 that is evenly divisible by all numbers between 1 and 3. function smallestCommons(arr) { } smallestCommons([1,5]);

Spinal Tap Case Convert a string to spinal case. Spinal case is all-lowercase-words-joined-by-dashes. function spinalCase(str) { } spinalCase('This Is Spinal Tap');

function spinalCase(str) { // "It's such a fine line between stupid, and clever." // --David St. Hubbins var type = str.replace(/([a-z])([A-Z])/g, '$1 $2').replace(/\s/g,'-').replace(/_/g, '-'); var code = type.toLowerCase(); return code; } spinalCase('This Is Spinal Tap');

Steamroller Flatten a nested array. You must account for varying levels of nesting. function steamrollArray(arr) { // I'm a steamroller, bab var myNewArray = []; function nestedArray(arr){ for (var i=0; i<arr.length; i++){ if(Array.isArray(arr[i])){ nestedArray(arr[i]); } else { myNewArray.push(arr[i]); } } } nestedArray(arr); return myNewArray; } steamrollArray([1, [2], [3, [[4]]]]);

Sum All Odd Fibonacci Numbers Given a positive integer num, return the sum of all odd Fibonacci numbers that are less than or equal to num. The first two numbers in the Fibonacci sequence are 1 and 1. Every additional number in the sequence is the sum of the two previous numbers. The first six numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8. For example, sumFibs(10) should return 10 because all odd Fibonacci numbers less than 10 are 1, 1, 3, and 5. function sumFibs(num) { return result; } sumFibs(1);

Sum All Primes Sum all the prime numbers up to and including the provided number. A prime number is defined as a number greater than one and having only two divisors, one and itself. For example, 2 is a prime number because it's only divisible by one and two. The provided number may not be a prime. function sumPrimes(num) { } sumPrimes(10);

Symmetric Difference Given two sets (for example set A = {1, 2, 3} and set B = {2, 3, 4}), the mathematical term "symmetric difference" of two sets is the set of elements which are in either of the two sets, but not in both (A △ B = C = {1, 4}). For every additional symmetric difference you take (say on a set D = {2, 3}), you should get the set with elements which are in either of the two the sets but not both (C △ D = {1, 4} △ {2, 3} = {1, 2, 3, 4}). function sym(args) { return args; } sym([1, 2, 3], [5, 2, 1, 4]);

Return the provided string with the first letter of each word capitalized. Make sure the rest of the word is in lower case. For the purpose of this exercise, you should also capitalize connecting words like "the" and "of". function titleCase(str) { } titleCase("I'm a little tea pot");

function titleCase(str) { str = str.toLowerCase().split(' '); for (var i = 0; i < str.length; i ++){ str[i] = str[i].charAt(0).toUppderCase() + str[i].slice(1); } return str.join(' '); titleCase("I'm a little tea pot");

Title Case a Sentence Return the provided string with the first letter of each word capitalized. Make sure the rest of the word is in lower case. For the purpose of this exercise, you should also capitalize connecting words like "the" and "of". function titleCase(str) { } titleCase("I'm a little tea pot");

function titleCase(str){ str = str.toLowerCase().split(' '); for(var i=0; i<str.length; i++){ str[i] = str[i].charAt(0).toUpperCase() + str[i].slice(1); } return str.join(' '); } titleCase('I'm a little tea pot');

Truncate a string 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 inserting the three dots to the end will add to the string length. However, if the given maximum string length num is less than or equal to 3, then the addition of the three dots does not add to the string length in determining the truncated string. function truncateString(str, num) { } truncateString("A-tisket a-tasket A green and yellow basket", 50);

Everything Be True Check if the predicate (second argument) is truthy on all elements of a collection (first argument). Remember, you can access object properties through either dot notation or [] notation. function truthCheck(collection, pre) { } truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy", "sex": "male"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex");

Sorted Union 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. function uniteUnique(arr) { } } } return result; } uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]);

Inventory Update Compare and update the inventory stored in a 2D array against a second 2D array of a fresh delivery. Update the current existing inventory item quantities (in arr1). If an item cannot be found, add the new item and quantity into the inventory array. The returned inventory array should be in alphabetical order by item.

Wherefore art thou Make a function that looks through an array of objects (first argument) and returns an array of all objects that have matching property and value pairs (second argument). Each property and value pair of the source object has to be present in the object from the collection if it is to be included in the returned array. For example, if the first argument is [{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], and the second argument is { last: "Capulet" }, then you must return the third object from the array (the first argument), because it contains the property and its value, that was passed on as the second argument.

Voir tous les ensembles d'études

FCC Algorithm

Ensembles d'études connexes

Saunders - Lab Tests

Audit Chapter 12

MKTG 372 Chapter 10

Intro to Art 100 Exam 4

Personal Finance Chapter 2 - Money Management Skills

BCS 240 Exam #3

COM 103 CH.8 and 9 FE

Psychology Module 3 Chapter 3

Genetics Chp 12

Adverse Childhood Experiences

Cryptocurrency

NURA 1500 Renal Medications

Endocrine System, Part I

UNIT 4: THE GREEK WORLD

Capstone Quiz review

Ethics in Counseling EXAM 2

IT Labs 22

Physical Sensation Words (You can use these words to communicate with your limbic system. ^^)

Chapter 17 - Process Costing

CMU CPS 181 - Chapter 10 Review Questions