freecodecamp slack

Diff two Arrays (compare two arrays)1. Requirements Compares two arrays and returns a new array The elements of the array are two of all unique array elements in a given array. In other words, returns the difference of two arrays. 2. Ideas Defines a new array variable that joins the two arrays entered with. Concat () to assign to it Defines a check function that returns all the unique array elements in a given array of two Filter out the eligible elements of a

Reverse a string (flip string) Title Requirements: Convert a string to an array Flipping the array order with the reverse method of the array Convert an array to a string Ideas: Use. Split (") to convert a string into an array of single letters Use. Reverse () to invert the array Concatenate array elements into strings using. Join (') The code is as follows: 　　 1 function reversestring (str) { 2 // Please write y

Freecodecamp Advanced algorithm address stamp here.Freecodecamp Elementary and intermediate algorithm, basic to a thought can be completed, and advanced algorithm a little trouble, so I will own the solution to write clearly, if there are errors or better solution, welcome message.Validate US Telephone NumbersIf the incoming string is a valid US phone number, it is returned true .In short, the rule of the U.S. number is that the country code (must be

1. 2. Bootstrap Jumbotron PropertiesSuper large screen (Jumbotron). As the name implies, the component can increase the size of the caption and add more margin (margin) to the landing page content. The steps for using the oversized screen (Jumbotron) are as follows: Create a class . Jumbotron. In addition to the larger font-weight is reduced to 200px. 3. Bootstrap Container PropertiesContainer: Use the. Container to wrap the content on the page to achieve center alignment. The

arguments to array;Array.prototype.slice.call (arguments);Calculates the factorial of an integerfunction factorialize (num) { if(num==0)return 1; return num*factorialize (num-1);}Remove the number specified in the arrayfunction Destroyer (arr) { var args = array.from (arguments). Slice (1); return arr.filter (function(val) { return ! ) Args.includes (val); });} Deestroyer ([1,2,3,1,2,4,7,8,6],1,2,3);Remove the object containing the second argument from the first argumentfunctionvar key

to number2 in arr to form a new array and return without changing the original array;arr. Filter (Callbackfunction () {}) returns an array of values that are tested by Callbackfunction in Arr, returned as an array;Arr.indexof (item) finds item in ARR, returns the index value corresponding to item, does not find return-1;arr. concat (ARR2 or numbers) merges arr2 or numbers with the original array arr to return the new array. The previous query is heavy, so consider using the previous function he

Arguments Optional 1. Requirements Create a function that calculates the sum of two parameters. If there is only one argument, a function is returned, and the function requests a parameter and then returns the result of the sum. If none of the two parameters is a valid number, the undefined is returned. 2. Ideas Determine the number of input data The number of data is 1, the data type is judged, Type is a number: Assign this data to a, return a fun

Spinal Tap case1. Requirements Converts a string to a spinal case. Spinal case is all-lowercase-words-joined-by-dashes in this form, that is, connecting all lowercase words with hyphens. 2. Ideas Use. Replace () and regular expressions to separate lowercase letters and capitals with a space Again 3. Replace the space with a '-' and finally lowercase.function spinalCase(str) { var regex = /\s+|_+/g; str = str.replace(/([a-z])([A-Z])/g, ‘$1 $2‘); return str.replace(regex,

Falsy Bouncer (filter array false values) Requirements Deletes all false values in the array. (in JavaScript, false values are,,,, false null 0 "" , undefined and NaN .) ） Ideas Use. Filter () to reject false values in an array Use Boolea to set callback function to encounter true value return Code 1 function bouncer (arr) { 2 // Please write your code here 3 function Res (val) { 4 return Boolean (val); 5 } 6 return

Where Art Thou1. Requirements Write a function that iterates through an array of objects (the first parameter) and returns an array of all objects that contain matching property-value pairs (the second argument). If the returned array contains property-value pairs for the source object, then each property-value pair of this object must exist in the collection object. 2. Ideas Remove the property of source with Object.keys (source) Use Object.keys () to iterate thro

Sum all Odd Fibonacci Numbers 1. Requirements To a positive integer num, returns the sum of the Fibonacci Ponacic numbers less than or equal to Num. The first few numbers in the Fibonacci sequence are 1, 1, 2, 3, 5, and 8, and each subsequent number is the sum of the first two digits. It is not possible to implement the Fibonacci sequence with a recursive return. Because memory overflows when NUM is large, it is recommended to use an array to implement it. 2. Ideas

Sum All Primes 1. Requirements Sum of prime numbers less than or equal to a given number. Only 1 and its own two approximate numbers are called prime numbers. For example, 2 is a prime number, because it can only be divisible by 1 and 2. 1 is not a prime number because it can only be divisible by itself. 2. Ideas To define the mark variable in a loop starting from 3 to no more than NUM, initially true Determines whether I is a prime number in a two-layer cycl

Make a person 1. Requirements Constructs an object using the method given below: Getfirstname (), Getlastname (), Getfullname (), Setfirstname (first), Setlastname (last), and Setfullname (Firstandlast). All methods that have parameters accept only one string parameter. All methods interact with the entity object only. 2. Ideas Based on the relevant links, an object is constructed using the method given in the topic. Constructing objects 3. Codevar Perso

DNA Pairing1. Requirements The DNA Strand lacks a paired base. Based on each base, the matching base is found, and the result is returned as a second array. Base pairs (base pair) is a pair of at and CG that matches the missing base for a given letter. The letters and the letters to which they are paired are inside an array, and then all the arrays are organized and encapsulated into an array. 2. Ideas Use. Split (") to divide the entered letter string into an alph

, 39], [1000, 1001, 857, 1]];//back to [5,27,39,1001]We add a min and Max method to the array's prototype to determine the maximum and minimum values of the current array.Min Method:function () { varThis [0]; for (var i=0;ithis. length;i++) { if(This [i]// If the current value is less than the previous one, it is treated as the minimum value min= this [i];} } return min; }The Max method is the same:function (

Objective The Slackware Linux operating system is a powerful platform on the Intel architecture computer. It is designed to be stable, secure, and as a high-end server and a powerful workstation. The purpose of this book is to guide how you start

1. Get the time of the day: SELECT from_unixtime (Unix_timestamp (), ' yyyy-mm-dd HH:mm:ss '); 2. Calculation time difference: SELECT datediff (' 2016-12-07 ', ' 2016-12-08 '); The previous time minus the time that follows. 3. When calculating the

Freecodecamp's JavaScript basic algorithm challengeHttps://www.freecodecamp.com2016-07-03JavaScript is not very familiar with the knowledge to solve these problems, it is estimated that some algorithms will be very stupid.1. Invert stringsStr.split (

We recommend the Slackware desktop system which is very useful to everyone, for example, to let everyone know about the Slackware desktop system, and then to give a comprehensive introduction to the Slackware desktop system, hoping to help everyone start the Slackware desktop, xen virtual Slackware desktop officially started; After creating the/etc/xen/slack configuration file, we will use it to start the Slackware desktop operating system. The Xen vi

The optimal matching of a bipartite graph. Find the minimum billing flow. The minimum cost for matching all vertices is required. simply apply the KM algorithm .. The following is the 1853 AC code:[Cpp]# Include # Include Using namespace std;Const int maxn = 305;Const int INF = (1 Int g [maxn] [maxn];Int lx [maxn], ly [maxn];Int match [maxn];Bool visx [maxn], visy [maxn];Int slack [maxn];Int n;Bool dfs (int cur ){Visx [cur] = true;For (int y = 1; y If