Solution for "Counting Valleys" in Hackerrank

Counting Valleys | Solution | JavaScript.js

let path = [
  'DDUDUDDUDDUDDUUUUDUDDDUUDDUUDDDUUDDUUUUUUDUDDDDUDDUUDUUDUDUUUDUUUUUDDUDDDDUDDUDDDDUUUUDUUDUUDUUDUDDD']
  const cat = [1, 2, 3];
const steps = 8;

function countingValleys(steps, path) {
  let count = 0;
  let val = 0;
  let distance = steps;
  const arr = path[0]
    .split("")
    .map((el) =>
      el === "U" ? count++ && (count === 0 ? val++ : val) : count--
    );

    ////////////OR  
    
  // for (let i = 0; i < arr.length; i++) {
  //   if (arr[i] === "U") {
  //     count++;
  //     if (count === 0) {
  //       val++;
  //     }
  //   } else {
  //     count--;
  //   }
  // }

  return val;
}

console.log(countingValleys(steps, path));