Skip to content

add another solution to array chunking #70

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Lalitkumar4 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

add another solution to array chunking #70

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
90 changes: 43 additions & 47 deletions session2/index_extra.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,33 +17,38 @@ function longestWord(sen) {}
// ex. chunkArray([1, 2, 3, 4, 5, 6, 7], 2) === [[1, 2],[3, 4],[5, 6],[7]]

function chunkArray(arr, len) {
// SOLUTION BY Jawad Mohammad
// return arr.reduce((acc, cv, ci, array) => {
// if (ci % len === 0 ) {
// acc.push(array.slice(ci, ci+len));
// }
// return acc;
// }, []);

// ----- SOLUTION BY Jon Bodnar ----- //
// const chunked = [];
// while (arr.length) {
// chunked.push(arr.splice(0, len));
// }
// return chunked;
// ----- END ----- //
// SOLUTION BY Jawad Mohammad
// return arr.reduce((acc, cv, ci, array) => {
// if (ci % len === 0 ) {
// acc.push(array.slice(ci, ci+len));
// }
// return acc;
// }, []);
// ----- SOLUTION BY Jon Bodnar ----- //
// const chunked = [];
// while (arr.length) {
// chunked.push(arr.splice(0, len));
// }
// return chunked;
// ----- END ----- //
// Solution by Lalit Kumar
// const chunkedArr = [];
// for (let i = 0; i < arr.length; i += len) {
// chunkedArr.push(arr.slice(i, i + len));
// }
// return chunkedArr;
}

// CHALLENGE 3: FLATTEN ARRAY
// Take an array of arrays and flatten to a single array
// ex. [[1, 2], [3, 4], [5, 6], [7]] = [1, 2, 3, 4, 5, 6, 7]

function flattenArray(arrays) {
// SOLUTION BY Jawad Mohammad
// return arrays.reduce((acc, cv) => {
// acc.push(...cv);
// return acc;
// }, []);
// SOLUTION BY Jawad Mohammad
// return arrays.reduce((acc, cv) => {
// acc.push(...cv);
// return acc;
// }, []);
}

// CHALLENGE 4: ANAGRAM
Expand All @@ -61,9 +66,9 @@ function isAnagram(str1, str2) {}
function letterChanges(str) {}

// Call Function
const output = longestWord("Hello there, my name is Brad");
const output = longestWord("Hello there, my name is Brad")

console.log(output);
console.log(output)
////// INSTRUCTIONS /////
// ADD YOUR SOLUTIONS HERE
// COMMENT YOUR SOLUTION OUT BEFORE YOU MAKE A PULL REQUEST
Expand Down Expand Up @@ -117,10 +122,8 @@ function chunkArray(arr, len) {
// return Array.from({ length: Math.ceil(arr.length / len) }, (v, i) =>
// arr.slice(i * len, i * len + len)
// );

// SOLUTION BY @jerryakpera
// const chunks = []

// while (arr.length >= len) {
// chunks.push(arr.splice(0, len))
// }
Expand Down Expand Up @@ -165,30 +168,23 @@ function letterChanges(str) {
// return str.toLowerCase().replace(/[a-z]/g, char => (
// char == 'z' ? 'A' : String.fromCharCode(char.charCodeAt() + 1)
// )).replace(/[aeiou]/g, vowel => vowel.toUpperCase());

// SOLUTION BY @m0nm
// const alphabet = 'AbcdEfghIjklmnOpqrstUvwxyz'.split('') /* too lazy to split it myself */
// const charArr = str.toLowerCase().replace(/[^a-z]/g, "").split('')

// charArr.forEach((char, charIndex) => {

// if (char === 'z') {
// charArr[charIndex] = "A"
// }

// else {
// const index = alphabet.findIndex(alp => char === alp)

// charArr[charIndex] = alphabet[index + 1]
// }
// })

// const newStr = charArr.join('').replace(/([aeiou])/g, match => match.toUpperCase())

// return charArr.join('')
// SOLUTION BY @m0nm
// const alphabet = 'AbcdEfghIjklmnOpqrstUvwxyz'.split('') /* too lazy to split it myself */
// const charArr = str.toLowerCase().replace(/[^a-z]/g, "").split('')
// charArr.forEach((char, charIndex) => {
// if (char === 'z') {
// charArr[charIndex] = "A"
// }
// else {
// const index = alphabet.findIndex(alp => char === alp)
// charArr[charIndex] = alphabet[index + 1]
// }
// })
// const newStr = charArr.join('').replace(/([aeiou])/g, match => match.toUpperCase())
// return charArr.join('')
}

// Call Function
const output = longestWord("Hello there, my name is Brad");
const output = longestWord("Hello there, my name is Brad")

console.log(output);
console.log(output)