Notes

//Common ADD function- FUNCTION CURRYING

function curry(func){
debugger;
return function curried(...args){
debugger;
if(args.length >= func.length){
return func.apply(this, args)
} else{
return function(...args2){
return curried.apply(this, args.concat(args2));
}
}
}

}

function sum(a,b,c){
return a + b + c;
}
var curriedSum= curry(sum);

//curriedSum(1,3,4)
curriedSum(1,3)(2)

===========================================================
//PRIME NUMBER
function isPrime(num){
for(i = 2; i<num; i++){
if(num % i === 0) return 'No';

}
if(num !== 1 && num !==0){
return 'YES';
}
}
console.log(isPrime(7))
=============================================================

//LARGEST CONTAGIOUS SUM

var arr = [-1, 2, 3, -1, 3, -1]

function largestSum(arr){
let sum = 0;
let nextSum = 0;

for(let i = 0; i < arr.length; i++){
nextSum = nextSum + arr[i];

if(nextSum > sum){
sum = nextSum;
}

if(nextSum < 0){
nextSum = 0;
}

}
return sum;
}

largestSum(arr);
==================================================

//SORT ONES AND TWOS

function zeroonesort(arr1){
let arr = arr1;
let left = 0;
let right = arr.length - 1;

while(left <= right){
if(arr[left] === 1){
var temp = arr[right];
arr[right] = arr[left];
arr[left] = temp;
right--;
} else {
left++;
}
}
return arr;
}

zeroonesort([1,1,0,1,1,0,0,1])

======================================

//FIRST NON REPEATING CHARACTER
function firstNonRepeatingChar(str) {
var newArr = str.split('');
var newObj = {};
for (var num of newArr){
if(!newObj.hasOwnProperty(num)){
return newObj[num] = num;
}

}
return newObj;
}
firstNonRepeatingChar("abcdabad");