Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit f245d5f

Browse files
author
Rohit Dandnayak
committed
more alogs added
1 parent 829e1bc commit f245d5f

File tree

11 files changed

+125
-1
lines changed

11 files changed

+125
-1
lines changed
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
function armstrong(n) {
2+
let sum = 0,
3+
num = n;
4+
while (num > 0) {
5+
rem = num % 10;
6+
sum = sum + rem * rem * rem;
7+
num = Math.trunc(num / 10);
8+
}
9+
if (sum === n) return 'armstrong';
10+
else return 'not armstrong';
11+
}
12+
13+
console.log(armstrong(153));

‎src/data-structures/array/array-rotation.js‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,4 +15,4 @@ function rotateArrayBy(arr, d) {
1515
return arr;
1616
}
1717

18-
console.log(rotateArrayBy([1, 2, 3, 4, 5], 2));
18+
console.log(rotLeft([1, 2, 3, 4, 5], 3));
Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
function decimalToBinary(n) {
2+
let a = [];
3+
for (let i = 0; n > 0; i++) {
4+
a[i] = n % 2;
5+
n = Math.trunc(n / 2);
6+
}
7+
return a.reverse().join('');
8+
}
9+
console.log(decimalToBinary(8));
Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
function factorial(n) {
2+
let fact = n;
3+
while (n > 1) {
4+
fact = fact * (n - 1);
5+
n = n - 1;
6+
}
7+
return fact;
8+
}
9+
10+
console.log(factorial(5));
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
function fibonacci(number) {
2+
let n1 = 0,
3+
n2 = 1,
4+
n3;
5+
console.log(n1);
6+
console.log(n2);
7+
for (let i = 2; i < number; ++i) {
8+
n3 = n1 + n2;
9+
console.log(n3);
10+
n1 = n2;
11+
n2 = n3;
12+
}
13+
}
14+
15+
console.log(fibonacci(9));
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
let n = 9,
2+
ar = [10, 20, 20, 10, 10, 30, 50, 10, 20];
3+
function sockMerchant(n, ar) {
4+
let length = 0;
5+
ar = ar.sort((a, b) => {
6+
return a - b;
7+
});
8+
for (let i = 0; i < n; i++) {
9+
if (ar.slice(i + 1, n).indexOf(ar[i]) > -1) {
10+
length++, i++;
11+
}
12+
}
13+
return length;
14+
}
15+
console.log(sockMerchant(n, ar));
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
function isPalindrome(n) {
2+
let revString = 0,
3+
rem,
4+
temp;
5+
temp = n;
6+
while (n > 0) {
7+
rem = n % 10;
8+
revString = revString * 10 + rem;
9+
n = Math.trunc(n / 10);
10+
}
11+
if (temp !== revString) return 'not palindrome';
12+
else return 'is palindrome';
13+
}
14+
15+
console.log(isPalindrome(1231));
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
function ifPrime(n) {
2+
let flag = 0;
3+
for (let i = 2; i < n; i++) {
4+
if (n % i === 0) {
5+
flag = 1;
6+
}
7+
}
8+
if (flag == 0) return 'Is Prime';
9+
else return 'not prime';
10+
}
11+
12+
console.log(ifPrime(9));
Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
function reverseNumber(num) {
2+
var reverse = 0,
3+
rem;
4+
while (num !== 0) {
5+
rem = num % 10;
6+
// console.warn(num);
7+
reverse = reverse * 10 + rem;
8+
num = Math.trunc(num / 10);
9+
}
10+
return reverse;
11+
}
12+
13+
// reverseNumber(123);
14+
console.log(reverseNumber(12345));
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
function sumOfDigits(num) {
2+
var sum = 0,
3+
rem;
4+
while (num > 0) {
5+
rem = num % 10;
6+
sum = sum + rem;
7+
num = Math.trunc(num / 10);
8+
}
9+
return sum;
10+
}
11+
12+
// reverseNumber(123);
13+
console.log(sumOfDigits(126));

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /