Missing Brian Kernighan's algorithm for counting set bits in the binary equivalent of a number, i.e. the number of 1 in the binary form of a number.

Implementation of CycleDetection.js seems inappropriate. Weird function name main() and its invocation can cause the program to crash. Tests are missing. Not exported, Hence not resuable. Can be optimized further (Optional)

Given reference to head of singly linked list, find the middle node of linked list.

Hi, As I can see, the current implementation of calculating the factorial of a number returns a string like "The factorial of 5 is 120" instead this function must return an integer value of 120, so that we can use this function in other algorithms to calculate factorial without having to write logic...

Hi, I have not seen any implementation of Möbius function in this repo. Could you please assign this issue to me? Regards, Akshay

Is their anything related to Number theory??

love it so far. this would be great for beginners as well.

This file uses Numbers at the matrix algorithm to compute the nth number in the Fibonacci sequence. My reasons to recommend BigInt are these: BigInts can't use Binet's Formula, nor the rounded and simpler variant because that requires arbitrary-precision floating-point computation The repeated-addi...

for the array [-1, -2, -3, -4] it returns 0