MCPcopy Create free account

hub / github.com/appacademy/Module-1-Resources / functions

Functions306 in github.com/appacademy/Module-1-Resources

↓ 24 callersFunctioncb
(num)
w2/d3/callbacks.js:64
↓ 17 callersFunctionadvancedExponent
(b, n)
w3/d3/solutions/recursion-pt2/problems/08-advanced-exponent.js:59
↓ 11 callersFunctiondeepIncludes
(subs, arr)
w3/d3/solutions/recursion-pt4/test/util/deep-includes.js:4
↓ 10 callersFunctionmostFrequentVowel
(words, counter = {})
w3/d5/aa03-assessment-practice-01-most-frequent-vowel/problems/01-most-frequent-vowel.js:74
↓ 8 callersFunctionfibonacci
Write a recursive function called `fibonacci` that takes an integer, `n`, and returns the `n`th number in the Fibonacci sequence. Not familiar with t
w3/d3/solutions/recursion-pt3/problems/09-fibonacci.js:22
↓ 7 callersFunctionexponent
Write a recursive function called `exponent` that takes two integers, `num` and `power`, and returns `num` raised to the `power`th power. Your functio
w3/d3/solutions/recursion-pt2/problems/07-exponent.js:23
↓ 7 callersFunctionflatten
(arr, result = [])
w3/d3/solutions/recursion-pt3/problems/11-flatten.js:45
↓ 7 callersFunctionsumArray
Write a recursive function called `sumArray` that takes an array of integers and returns the value of all the integers added together. Your array may
w3/d3/solutions/recursion-pt1/problems/02-sum-array.js:13
↓ 6 callersFunctionatMost
Write a function `atMost` that accepts an array, a max number, and a callback as arguments. The function should return a boolean indicating whether or
w2/solutions/callbacks/try-out-callbacks/problems/21-at-most.js:23
↓ 6 callersFunctionevenNumberRange
(num1, num2)
w3/d5/solutions/bonus-practices/additional-practice/problems/03-even-number-range.js:11
↓ 6 callersFunctionfactorial
Write a recursive function called `factorial` that takes an integer, `num`, and returns the factorial of `num`. Assume the value of `num` is greater
w3/d3/solutions/recursion-pt3/problems/10-factorial.js:19
↓ 6 callersFunctionfibonacciSequence
(num)
w1/d3/eod.js:101
↓ 6 callersFunctionmostExpensiveGroceries
(groceriesList)
w1/d5/maica-santos-aa01-assessment-practice-coding-problems-temp/problems/03-most-expensive-groceries.js:80
↓ 6 callersFunctionone
Write a function `one` that accepts an array and a callback as arguments. The function should call the callback for each element of the array, passing
w2/solutions/callbacks/try-out-callbacks/problems/18-one.js:40
↓ 6 callersFunctionreverse
Write a recursive function reverse(string) that takes in a string and returns it reversed. Examples: reverse("house"); // "esuoh" reverse("dog"); //
w3/d3/solutions/recursion-pt2/problems/05-reverse.js:16
↓ 6 callersFunctionsort
Write a recursive function called `sort` that takes an array of integers, `nums` and returns an array containing those integers sorted from least to g
w3/d3/solutions/recursion-pt4/problems/13-sort.js:24
↓ 6 callersFunctionsort
(nums)
w3/d5/solutions/bonus-practices/additional-practice/problems/02-recursive-sort.js:12
↓ 6 callersFunctionsubsets
(arr)
w3/d3/solutions/recursion-pt4/problems/15-bonus-subsets.js:19
↓ 5 callersFunctionaddToTwelve
Write a recursive function called `addToTwelve` that will return true if there are two adjacent numbers in the input array that can sum up to 12. Othe
w3/d3/solutions/recursion-pt2/problems/06-add-to-twelve.js:16
↓ 5 callersFunctionchainMap
Write a function `chainMap` that accepts a value and any number of callbacks as arguments. The function should return the final result of passing the
w2/solutions/callbacks/try-out-callbacks/problems/09-chain-map.js:32
↓ 5 callersFunctionchooseyEndings
(words, suffix)
w2/solutions/advanced-array-methods/advanced-array/problems/05-choosey-endings-filter.js:28
↓ 5 callersFunctioncostOfGroceries
(groceries)
w1/d5/maica-santos-aa01-assessment-practice-coding-problems-temp/problems/03-most-expensive-groceries.js:35
↓ 5 callersFunctiondynamicIntervalCount
Write a function, `dynamicIntervalCount`, that accepts a callback, a delay in milliseconds, and an optional amount as arguments. The function should
w3/d4/solutions/timeout-pt2/problems/06-dynamic-interval-count.js:27
↓ 5 callersFunctiondynamicSlice
(start, end)
w3/d5/solutions/bonus-practices/additional-practice/problems/04-dynamic-slice.js:22
↓ 5 callersFunctionhasThreeVowels
(string)
w2/solutions/advanced-array-methods/advanced-array/problems/11-has-three-vowels.js:19
↓ 5 callersFunctionhasThreeVowels
(string)
w1/d4/eod.js:78
↓ 5 callersFunctioniceCreamShop
Write a recursive function `iceCreamShop(flavors, favorite)` that takes in an array of ice cream flavors available at the ice cream shop, as well as t
w3/d3/solutions/recursion-pt1/problems/03-ice-cream-shop.js:16
↓ 5 callersFunctionmakeBetterChange
* BONUS PROBLEM ************************************************************************ Write a recursive function that will find the best way to mak
w3/d3/solutions/recursion-pt4/problems/18-bonus-make-change.js:58
↓ 5 callersFunctionmyEvery
Write a function `myEvery` that accepts an array and a callback as arguments. The function should return a boolean indicating whether or not all eleme
w2/solutions/callbacks/try-out-callbacks/problems/10-my-every.js:24
↓ 5 callersFunctionpermutations
(array)
w3/d3/solutions/recursion-pt4/problems/17-bonus-permutations.js:17
↓ 5 callersFunctionpreserveTypes
Write a function called `preserveTypes` which takes in an array of elements that could be of any type and returns a function. The return function shou
w3/d5/solutions/bonus-practices/additional-practice/problems/05-preserve-types.js:28
↓ 5 callersFunctionstringChanger
(word, operation)
w1/d5/maica-santos-aa01-assessment-practice-coding-problems-temp/problems/01-string-changer.js:31
↓ 5 callersFunctionsum
(numbers)
w1/d3/function-expressions.js:36
↓ 4 callersFunctionappleCounter
Write a function `appleCounter(appleObj)` that takes in an object containing a number of keys that have the word 'apple' contained within them. The `
w2/solutions/pojo-practice/pojo-basics/problems/08-apple-counter.js:31
↓ 4 callersFunctioncount
Write a function `count` that accepts an array and a callback as arguments. The function should return the number of elements of the array that return
w2/solutions/callbacks/try-out-callbacks/problems/08-count.js:29
↓ 4 callersFunctioncountDownTimer
Write a function named: countDownTimer(n). This function will represent a count down of days till the New Year. The countDownTimer function will take
w2/solutions/scope-problems-without-context/problems/10-count-down.js:30
↓ 4 callersFunctioncreateCounter
()
w2/d4/closure.js:157
↓ 4 callersFunctiondoubleNumbers
(numbers, cb)
w2/d3/callbacks.js:93
↓ 4 callersFunctiondynamicDivide
Write a function named `dynamicDivide(divisor)`. The dynamicDivide function will return a new function that when invoked will divide the argument numb
w2/solutions/scope-problems-without-context/problems/13-dynamic-divide.js:21
↓ 4 callersFunctioneliminateType
Write a function called `eliminateType` which takes in an array of elements that could be of any type and returns a function. The return function shou
w3/d5/aa03-assessment-practice-03-eliminate-type/problems/03-eliminate-type.js:51
↓ 4 callersFunctionexactly
Write a function `exactly` that accepts an array, a number, and a callback as arguments. The function should return a boolean indicating whether or no
w2/solutions/callbacks/try-out-callbacks/problems/12-exactly.js:30
↓ 4 callersFunctionincludesEqual
(arr1, arr2)
w3/d3/solutions/recursion-pt4/test/18-make-change-spec.js:5
↓ 4 callersFunctionisSorted
(nums)
w1/d5/maica-santos-aa01-assessment-practice-coding-problems-temp/test/utils/02-debugging-is-sorted-original.js:1
↓ 4 callersFunctionisSorted
(nums)
w1/d5/maica-santos-aa01-assessment-practice-coding-problems-temp/problems/02-debugging-is-sorted.js:8
↓ 4 callersFunctionisSorted
Write a recursive solution called `isSorted` to determine if the input array is sorted in ascending order. Examples: isSorted([1, 2, 3, 4, 5]); // t
w3/d3/solutions/recursion-pt3/problems/12-is-sorted.js:14
↓ 4 callersFunctionmySome
Write a function `mySome` that accepts an array and a callback as an argument. The function should call the callback for each element of the array, pa
w2/solutions/callbacks/try-out-callbacks/problems/07-my-some.js:26
↓ 4 callersFunctionnone
Write a function `none` that accepts an array and a callback as arguments. The function should call the callback for each element of the array, passin
w2/solutions/callbacks/try-out-callbacks/problems/20-none.js:31
↓ 4 callersFunctionprintAndPause
Given a list of positive integers, print each integer and pause for that many milliseconds before printing the next one. Make sure you use a recursive
w3/d5/aa03-assessment-practice-04-print-and-pause/problems/04-print-and-pause.js:20
↓ 4 callersFunctionrecVolume
For this problem you will be writing a function capable of finding the volume for a rectangle (height * width * length). In order to enter the require
w2/solutions/scope-problems-without-context/problems/12-volume.js:26
↓ 4 callersFunctionrepeatingTranslate
(sentence)
w2/solutions/advanced-array-methods/advanced-array/problems/17-repeating-translate.js:31
↓ 4 callersFunctionsetSecondsTimeoutArgs
The `setSecondsTimeout` you wrote was cool, but it's missing some functionality. The built-in `setTimeout` can also accept any additional number of ar
w3/d4/solutions/timeout-pt1/problems/02-set-seconds-timeout-args.js:25
↓ 4 callersFunctionsmoothieMachine
(...ingredients)
w2/solutions/scope-problems-without-context/problems/14-smoothie-machine.js:26
↓ 4 callersFunctionsnakeToCamel
(str)
w2/solutions/advanced-array-methods/advanced-array/problems/09-snake-to-camel-map.js:18
↓ 4 callersFunctionsnakeToCamel
(string)
w1/d4/snakeToCamel.js:15
↓ 4 callersFunctionsumToN
Write a recursive function called `sumToN` that takes in a number and returns the sum of all the numbers from 0 to that number. Return null for any in
w3/d3/solutions/recursion-pt1/problems/01-sum-to-n.js:15
↓ 4 callersFunctionsumToN
Write a recursive function called `sumToN` that takes in a number and returns the sum of all the numbers from 0 to that number. Return null for any in
w3/d2/sum-to-n.js:15
↓ 4 callersFunctionthreeIncreasing
(numbers)
w1/d3/hw-review.js:126
↓ 4 callersFunctionvalInObject
(obj, value)
w2/d1/pojo_demos/pojo_iteration/05-check_if_value_is_in_obj.js:14
↓ 3 callersFunctionaddFive
(num)
w2/solutions/scope-problems-without-context/problems/00-arrow-addfive.js:19
↓ 3 callersFunctionarrayConverter
Write a function `arrayConverter(array)` that will intake an array as an argument and returns an object representing the count of each value in the ar
w2/solutions/pojo-practice/pojo-basics/problems/09-array-converter.js:14
↓ 3 callersFunctionarrowAvgValue
w2/solutions/scope-problems-without-context/problems/04-arrow-average-value.js:13
↓ 3 callersFunctionarrowMyMap
(array, cb)
w2/solutions/scope-problems-without-context/problems/02-arrow-my-map.js:21
↓ 3 callersFunctionarrowRestSum
(...otherNums)
w2/solutions/scope-problems-without-context/problems/03-arrow-rest-sum.js:13
↓ 3 callersFunctionavgVal
(arr)
w2/solutions/advanced-array-methods/advanced-array/problems/01-avg-val-forEach.js:16
↓ 3 callersFunctioncoinCollector
Write a function named: coinCollector(numCoins). The coinCollector function will accept a number of coins (greater that 0) to collect when it is first
w2/solutions/scope-problems-without-context/problems/19-coin-collector.js:27
↓ 3 callersFunctiondynamicMultiply
Let's practice writing closures by creating a method called `dynamicMultiply(num)`. The dynamicMultiply function will return a new function that will
w2/solutions/scope-problems-without-context/problems/15-closure-dynamic-multi.js:21
↓ 3 callersFunctionfirstFruitObject
(fruits)
w2/solutions/pojo-fruits/problems/01-fruit-data-structure.js:12
↓ 3 callersFunctionfirstIndex
Write a function `firstIndex` that accepts an array and a callback as arguments. The function should return the index of the first element of the arra
w2/solutions/callbacks/try-out-callbacks/problems/22-first-index.js:25
↓ 3 callersFunctionformatFile
(cb)
w1/d5/maica-santos-aa01-assessment-practice-coding-problems-temp/test/03-most-expensive-groceries-spec.js:61
↓ 3 callersFunctiongreaterCallbackValue
Write a function `greaterCallbackValue` that accepts a value and two callbacks as arguments. The function should pass the value to both callbacks and
w2/solutions/callbacks/try-out-callbacks/problems/19-greater-callback-value.js:21
↓ 3 callersFunctionhipsterfy
(sentence)
w2/solutions/advanced-array-methods/advanced-array/problems/16-hipsterfy.js:31
↓ 3 callersFunctionincludedInObject
(obj, key)
w2/d1/pojo_demos/pojo_basics/06-check_if_key_is_in_object.js:13
↓ 3 callersFunctionintervalCount
Write a function, `intervalCount`, that accepts a callback, a delay in milliseconds, and an amount. The function should set an interval with the giv
w3/d4/solutions/timeout-pt1/problems/04-interval-count.js:19
↓ 3 callersFunctionkeyInObjectArray
Write a function `keyInObjectArray(objArray, keyString)` that takes in an array of objects as the first parameter and a string as the second. The `ke
w2/solutions/pojo-practice/pojo-basics/problems/06-key-in-object-array.js:22
↓ 3 callersFunctionlongestWord
(sentence)
w2/solutions/advanced-array-methods/advanced-array/problems/12-longest-word.js:18
↓ 3 callersFunctionmultiMap
Write a function `multiMap` that accepts a value, a number n, and a callback. The function should return the new value that results from running the o
w2/solutions/callbacks/try-out-callbacks/problems/03-multi-map.js:24
↓ 3 callersFunctionmyFilter
Write a function `myFilter` that accepts an array and a callback as arguments. The function should call the callback on each element of the array, pas
w2/solutions/callbacks/try-out-callbacks/problems/04-my-filter.js:22
↓ 3 callersFunctionmyFunc
()
w1/d3/function-expressions.js:24
↓ 3 callersFunctionmyMap
Write a function `myMap` that accepts an array and a callback as arguments. The function return an array of new elements obtained by calling the callb
w2/solutions/callbacks/try-out-callbacks/problems/02-my-map.js:19
↓ 3 callersFunctionmySimpleReduce
Write a function `mySimpleReduce` that accepts an array and a callback as arguments. The function should mimic the behavior of the built in Array.redu
w2/solutions/callbacks/try-out-callbacks/problems/24-my-simple-reduce.js:33
↓ 3 callersFunctionplannedIntersect
Write a function named plannedIntersect(firstArr) that takes in an array and returns a function. When the function returned by plannedIntersect is inv
w2/solutions/scope-problems-without-context/problems/18-planned-intersection.js:18
↓ 3 callersFunctionpostponeWithArgs
Write a function, `postponeWithArgs`, that accepts a callback and a delay in milliseconds as arguments. `postponeWithArgs` should return a new functi
w3/d4/solutions/timeout-pt2/problems/07-postpone-with-args.js:25
↓ 3 callersFunctionr2d2Speaks
(code)
w3/d5/solutions/bonus-practices/additional-practice/problems/01-r2d2-speaks.js:17
↓ 3 callersFunctionrange
Write a recursive function, `range`, that takes a start and an end and returns an array of all numbers in that range, exclusive. If the end number is
w3/d3/solutions/recursion-pt1/problems/04-range.js:14
↓ 3 callersFunctionrecursivePreserveType
Write a recursive function `recursivePreserveType` which takes in an array of elements that could be of any type and returns a function. The return fu
w3/d5/solutions/bonus-practices/additional-practice/problems/06-recursive-preserve-type.js:29
↓ 3 callersFunctionreverseStr
(str)
w2/solutions/scope-problems-without-context/problems/17-arrow-reverse.js:16
↓ 3 callersFunctionselectiveMap
Write a function `selectiveMap` that accepts an array and two callbacks as arguments. The function should return a new array where elements are replac
w2/solutions/callbacks/try-out-callbacks/problems/05-selective-map.js:39
↓ 3 callersFunctionshortestWord
(sentence)
w2/solutions/advanced-array-methods/advanced-array/problems/14-shortest-word.js:17
↓ 3 callersFunctionstringConverter
Write a function `stringConverter(string)` that will intake a string as an argument and returns an object representing the count of each character in
w2/solutions/pojo-practice/pojo-basics/problems/10-string-converter.js:14
↓ 3 callersFunctionsumForEach
(arr)
w2/solutions/advanced-array-methods/advanced-array/problems/00-sum-forEach.js:14
↓ 3 callersFunctiontest
()
w1/d4/mostVowels.js:70
↓ 3 callersFunctiontripler
(nums)
w2/solutions/advanced-array-methods/advanced-array/problems/02-tripler-map.js:14
↓ 3 callersFunctionunique
(array)
w2/solutions/advanced-array-methods/advanced-array/problems/13-unique.js:13
↓ 2 callersFunctionaddKeyAndValueToAll
(array, key, value)
w2/solutions/pojo-fruits/problems/02-manipulate-fruit-objects.js:11
↓ 2 callersFunctionaddKeyAndValueToOne
(array, key, value, index)
w2/solutions/pojo-fruits/problems/02-manipulate-fruit-objects.js:27
↓ 2 callersFunctionalternatingMap
Write a function `alternatingMap` that accepts an array and two callbacks as arguments. The function should return a new array containing the results
w2/solutions/callbacks/try-out-callbacks/problems/23-alternating-map.js:37
↓ 2 callersFunctionandSelect
Write a function `andSelect` that accepts an array and two callbacks. The function should return a new array containing elements of the original array
w2/solutions/callbacks/try-out-callbacks/problems/11-and-select.js:31
↓ 2 callersFunctionarrowGetFullName
(person)
w2/solutions/scope-problems-without-context/problems/01-arrow-full-name.js:18
↓ 2 callersFunctionbatchTimeouts
Write a function, `batchTimeouts`, that accepts an array of callbacks and an array of delays in milliseconds. The function should set a timeout for ea
w3/d4/solutions/timeout-pt1/problems/03-batch-timeouts.js:35
↓ 2 callersFunctioncallback
()
w3/d4/solutions/timeout-pt1/test/01-set-seconds-timeout-spec.js:21
next →1–100 of 306, ranked by callers