From 98a62ae898b82e05c5b42467011e5249bccf2eee Mon Sep 17 00:00:00 2001 From: John Prado Date: Thu, 29 Sep 2022 21:47:48 -0400 Subject: [PATCH] MBDTF --- solution.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) diff --git a/solution.js b/solution.js index 049257f..27e1073 100644 --- a/solution.js +++ b/solution.js @@ -3,70 +3,85 @@ const { nums, words } = require("./data/data.js"); // Every const isEveryNumGreaterThan2 = () => { // + return nums.every(num => num > 2) }; const isEveryWordShorterThan7 = () => { // + return words.every(word => word.length < 7) }; // Filter const arrayLessThan5 = () => { // + return nums.filter(num => num < 5) }; const arrayOddLengthWords = () => { // + return words.filter(word => word.length % 2 === 1) }; // Find const firstValDivisibleBy4 = () => { // + return nums.find(num => num % 4 === 0) }; const firstWordLongerThan4Char = () => { // + return words.find(word => word.length > 4) }; // Find Index const firstNumIndexDivisibleBy3 = () => { // + return nums.findIndex(num => num % 3 === 0) + }; const firstWordIndexLessThan2Char = () => { // + return words.findIndex(num => num.length < 2) }; // For Each const logValuesTimes3 = () => { // + return nums.forEach(num => num * 3) }; const logWordsWithExclamation = () => { // + return words.forEach(word => word + "!") }; // Map const arrayValuesSquaredTimesIndex = () => { // + return nums.map((num, i) => (num ** 2) * i ) }; const arrayWordsUpcased = () => { // + return words.map(word => word.toUpperCase()) }; // Some const areSomeNumsDivisibleBy7 = () => { // + return nums.some(num => num % 7 === 0) }; const doSomeWordsHaveAnA = () => { // + return words.some(word => word.includes("a")) }; module.exports = {