Ostad-Recurrassion

Task 1:
function palindrome(input) {
  var length = input.length;
  if (length == 1) return true;

  if (input[0] != input[length - 1]) return false;
  var subStr = input.slice(1, length - 1);
  return palindrome(subStr);
}

console.log(palindrome("madam"));

Time complexity: O(n/2) = O(n)
Space complexity: O(1)


Task 2:
function add(a, b) {
  if (a === 1) return b;

  return b + add(a - 1, b);
}

console.log(add(4, 5));

Time complexity: O(n)
Space complexity: O(n)