sAVItar02

/**
 * @param {number} n
 * @return {string[]}
 */
var generateParenthesis = function(n) {
    let res = [];

    function rec(open, close, string = "") {
        if((open == close) && (open + close == 2*n)) {
            res.push(string);

sAVItar02

/**
 * @param {number[]} nums
 * @return {number[][]}
 */
var permute = function(nums, res = [], temp = []) {
    if(nums.length === 0) res.push([...temp]);

    for(let i=0; i<nums.length; i++) {
        // Choose
        temp.push(nums[i]);

sAVItar02

/**
 * @param {number[]} nums
 * @return {number[][]}
 */
var subsets = function(nums) {
    let temp = [];
    let res = [];

    function rec(nums, i = 0) {
        if(i === nums.length ) return res.push([...temp]);

sAVItar02

/**
 * @param {number} x
 * @return {boolean}
 */
var isPalindrome = function(x) {
    if(x < 0) return false;
    
    function rec(num, rev = 0) {
        if(num == 0) return rev;
        return rec(Math.floor(num / 10), (rev * 10 + (num % 10)))

sAVItar02

/**
 * @param {number[]} nums
 * @return {string[]}
 */
var summaryRanges = function(nums) {
    let arr = [];
    let start  = nums[0];

    for(let i=0; i<nums.length; i++) {
        if(nums[i+1] - nums[i] == 1) continue;

sAVItar02

/**
 * @param {number} n
 * @return {number}
 */
var trailingZeroes = function(n) {
    let x = 5;
    let zeroes = 0;
    while((n/x) >= 1) {
        zeroes += Math.floor(n / x);
        x = x * 5;

sAVItar02

/**
 * @param {number} n
 * @return {number}
 */
var fib = function(n) {
    if(n == 0) return 0;
    if(n == 1) return 1;

    return fib(n - 1) + fib(n - 2);
};

sAVItar02

/**
 * @param {string} s
 * @return {number}
 */
var lengthOfLongestSubstring = function(s) {
    let verifier = {};
    let i = 0;
    let j = i+1;
    let max = 1;

sAVItar02

/**
 * @param {string} s
 * @return {number}
 */
var myAtoi = function(s) {
    let num = 0;
    let isNegative = false;
    let numString = "";
    let hasEncountered = false;
    let hasBeenPositive = false;

sAVItar02

/**
 * @param {string[]} strs
 * @return {string}
 */
var longestCommonPrefix = function(strs) {
    if(strs.length == 0) return "";
    if(strs.length == 1) return strs[0];

    let prefix = strs[0];
    let prefixLen = prefix.length;