ClimbStair

by sandfresh

JavaScript

function climbStairs(n) {
  if (n <= 2)
    return n;
  let steps = [];

  steps[1 - 1] = 1
  steps[2 - 1] = 2;
  console.log(steps);
  for (let i = 3; i <= n; i++) {
    steps[i - 1] = steps[i - 1 - 1] + steps[i - 2 - 1];
  }
  console.log(steps);
  return steps[n - 1];
}

function fibonacci(n){
	if(n <= 1)
    return n;
   let fibs =[];
   fibs[0] = 0;
   fibs[1] = 1;
   
   let s1 = 0; 
   let s2 = 1;
   for(let i = 2 ; i <= n; i++){
    // fibs[i] = fibs[i-1] + fibs[i-2];
     let temp = s2;
     s2 = s2+s1;
     s1 = temp; 
     
   }
 
   return s2; 
}

function reverseString(str){
	return str.split("").reverse().join("");
}
let value = reverseString("HelloWorld");


console.log(value);