Execute multiple functions successively on a value
Write a generic function chainer that takes a starting value, and an array of functions to execute on it. Return the final value after execution is complete.
Example
function add(num) {
return num + 1
}
function mult(num) {
return num * 30
}
chain(2, [add, mult]); // returns 90;
Arithmetic list
Function accept three parameters :
first the first term in the sequencel the number of terms that should be returnedSequence in wikipedia: Sequence
Example
seqlist(0, 1, 5); // must return [0, 1, 2, 3, 4]
Reverse String
Reverse String
reverse("Your String") => gnirtS ruoY
Even or Odd
Create a function that takes an integer as an argument and returns “Even” or “Odd”.
Array Appender
You are the greatest chef on earth. No one boils eggs like you! Your restaurant is always full of guests, who love your boiled eggs. But when there is a greater order of boiled eggs, you need some time, because you have only one pot for your job. How much time do you need?
Write a function called appendArrays that appends the items from array 2 onto array 1, returning the newly formed array.
For example if your 2 arrays were:
var array1 = [a,b,c]
var array2 = [1,2,3]After using your appendArrays function, the result should be[a,b,c,1,2,3]
Your function should also be able to handle nested arrays.
For example, combining array [['x','x'],'B'] with array['c','D'] should return [['x','x'],'B','c','D'].
Your solution should account for a situation for either the first or second inputs aren’t actually arrays.
// basic test
Test.assertSimilar(appendArrays(['this'],['that']), ['this','that'])
// second input is not an array
Test.assertSimilar(appendArrays([1,2], [1]), [1,2,1])
// first input is not an array
Test.assertSimilar(appendArrays([2], [1,1,1]), [2,1,1,1])Sum of two array elements equals to target
Write a function that takes an array of numbers (integers for the tests) and a target number. It should find two different items in the array that, when added together, give the target value. The indices of these items should then be returned in an array like so: [index1, index2].
The input will always be valid (numbers will be an array of length 2 or greater, and all of the items will be numbers; target will always be the sum of two different items from that array).
twosum([1,2,3], 4); // must return [0, 2]Good news and bad news !
Thank you all my follower and the audience !
The good news is that I have opened a new site jspractice.com for all the exercices, demos and tips about javascript.
The bad new is that this blog will have less and less update until … I don’t know when but I hope never 🙂
Thank you all again !
Adjacent pairs in a string
Supplied with a single string, return the number of all adjacent pairs in that string.
The words within the string are separated by whitespace.
The function should be case-insensitive (i.e., the input string “orange OrAnGe” is a match).
Some example input/output:
//returns 0
countAdjacentPairs('')
// returns 1
countAdjacentPairs('cat dog dog')
// returns 1 (The first pair has been matched, and will be ignored from then on).
countAdjacentPairs('dog dog dog')
// returns 2
countAdjacentPairs('cat cat dog dog cat')Get key/value pairs as arrays
Complete the keysAndValues function so that it takes in an object and returns the keys and values as separate arrays.
Example:
keysAndValues({a: 1, b: 2, c: 3}) // should return [['a', 'b', 'c'], [1, 2, 3]]Anagram Detection
According to wikipedia :
An anagram is a type of word play, the result of rearranging the letters of a word or phrase to produce a new word or phrase, using all the original letters exactly once; for example Doctor Who can be rearranged into Torchwood.
An anagram is the result of rearranging the letters of a word to produce a new word. (Ref wikipedia).
Note: anagrams are case insensitive
Examples
The challenge is to write the function isAnagram to return true if the word test is an anagram of the word original and false otherwise.
My Daily Techs 