DEV Community: Houssn

string to array

Houssn — Thu, 05 Oct 2023 13:18:39 +0000

const firstLater = "please";
const succondLater ="plezse";

const comparerString = (firstLater,succondLater)=>{
    let ArrayFirstLater = firstLater.split('')
    let ArraySuccondLater = succondLater.split('')
    let n1 = ArrayFirstLater.length
    let n2 = ArraySuccondLater.length
    if(n1==n2){
        for(let i = 0;i<n1;i++){
            if(ArrayFirstLater[i] = ArraySuccondLater[i]){
                 console.log(`${ArrayFirstLater[i]}=>${i}`)
            }else{
                console.log(`${ArrayFirstLater[i]} =>${i}`)
            }
        }
    }else{
       return 'not equel'
    }
}


comparerString(firstLater,succondLater)

write a function, chunk(arr, n), that returns chunked array of size n at the least. Look at

Houssn — Thu, 05 Oct 2023 11:05:24 +0000

exampleGiven: [1, 4, 12, 3, 2, 6, -9, 0], n=3
Return: [[1,4,12], [3,2,6], [-9, 0]]
Given: [1, 4, 12, 3, 2, 6, -9, 0], n=4
Return: [[1,4,12,3], [2,6,-9,0]]
Given: [1, 4, 12, 3, 2, 6, -9, 0], n=7
Return: [[1,4,12,3,2,6,-9], [0] ]

const input = [656, 756, 5345, 67, 43, 76, 54, 768, 34];
const divideArray = (arr, size) => {
   return arr.reduce((acc, val, ind) => {
      const subIndex = ind % size;
      if(!Array.isArray(acc[subIndex])){
          acc[subIndex] = [val];
      }else{
          acc[subIndex].push(val);
      }
      return acc;
   }, []);
};
console.log(divideArray(input, 3));

bob's score alice's score

Houssn — Thu, 28 Sep 2023 09:49:19 +0000

let a = [12, 20, 11, 22];
let b = [20, 30, 12, 23];

let scores = a.reduce((result, currentValue, index) => {
    if (currentValue > b[index]) {
        result[0]++;
    } else if (b[index] > currentValue) {
        result[1]++;
    }
    return result;
}, [0, 0]);

console.log("Bob's Score:", scores[0]);
console.log("Alice's Score:", scores[1]);