Interview Programs

// N number of people are standing in a circle and 1st have knife, he kill 2nd then
3rd have knife, he kill 4th and so on then who will safe last

var a = 100;

var arr = [];

for (i = 1; i <= a; i++) {

    arr.push(i);

}

var i = 1;

while (arr.length > 1) {

    if (i > arr.length)

        i = 1;

    else if (i == arr.length)

        i = 0;

     //console.log(i,"lll",arr[i]);

    arr.splice(i, 1)

    i = i + 1;

}

console.log(arr[0]);

//Given a number N. The task is to find the largest factor of that number which is a perfect square.

function isNumberPerfectSquare(num) {

i = 1;

square = i * i;

while (num > square) {

i++;

square = i * i;

}

if (num == square)

return true;

return false;

}

function largestPerfectSquare(num, reminder, diviser, factor) {

if (isNumberPerfectSquare(factor)) {

return factor;

}

else {

while (reminder > 0) {

diviser++;

reminder = num % diviser;

}

return largestPerfectSquare(num, 1, diviser, num / diviser)

}

}

console.log("Largest Perfect square of 420 is:", largestPerfectSquare(420, 1, 1, 420));