Function name

Where to implement

src/binarySum.js

Description (optional)

Sum two integers (a + b) represented as binary numbers and return decimal value

Next Largest Prime

Where to implement

src/nextPrime.js

isEven()

Where to implement

src/isEven.cpp

Description

Given a number check if it is even.

Function name

Where to implement

src/sumOfPrimes.js

Description (optional)

Calculate the sum of primes upto a given number

Factorial

Where to implement

src/factorial.js

Description (optional)

Input :- An integer (n)
Output :- Factorial of n

For Eg : Input :- 5 . Output :- 120

Function name

Where to implement

src/primeOrComposite.js

Description (optional)

Find if a given number is prime or composite

isIPAddress

Where to implement

src/isIPAddress.js

Description (optional)

Given a string verify whether it is an ipAddress

Function name

Where to implement

src/binToHex.js

Description (optional)

Convert a binary number into hexadecimal.

CoprimePairs

Where to implement

src/CorimePairs.js

Description (optional)

Given a number N. Find the number of coprime pairs of numbers less than or equal to N.

arraySum

Where to implement

src/arraySum.js

Description (optional)

Sum the elements of an array

Function name

areTwinPrimes

Where to implement

src/areTwinPrimes.js

Description (optional)

check whether the input numbers are twin primes

EvenOrOdd

Where to implement

src/EvenOrOdd.your_wish

Description (optional)

Check whether an integer is even or odd

nextPerfectSquare

Where to implement

src/nextPerfectSquare.js

Description (optional)

Write a function that takes in a number and returns the next perfect square.
For example: Given an input 4 the function should return 9 which is the next perfect square.

perfectSquaresLessThanInput

Where to implement

src/perfectSquaresLessThanInput.py

Description (optional)

find all perfect squares less than a given input

Function name

Where to implement

src/isLeapyear.py

Description (optional)

write a function to check whether the given year is a leap year.

Function name

Where to implement

src/charToAscii.js

Description (optional)

Given a char return it's ascii code

Function name

Where to implement

src/asciiToChar.js

Description (optional)

Description of the function

digitSum

Where to implement

src/digitSum.js

Description (optional)

find out digitSum of number

prefixSum

Where to implement

src/prefixSum.js

Description (optional)

Implement prefix sum, with an optional argument being the commutative sum function.
For example, the prefix sum of [1, 2, 3, 4] is [1, 1+2, 1+2+3, 1+2+3+4] or [1, 3, 6, 10], but with the multiplication operator as its sum function, it's [1, 1*2, 1*2*3, 1*2*3*4] or [1, 2, 6, 24].

isCircularPrime

Where to implement

src/isCircularPrime.js

Description (optional)

A circular prime is a prime number with the property that the number generated at each intermediate step when cyclically permuting its (base 10) digits will be prime. (source)

Example: The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.

Function name

Where to implement

src/fahrenheitToCelsius.js

Description (optional)

Changing given temperature from Fahrenheit to celsius

Function name

Where to implement

src/Factorial.js

Description (optional)

Find factorial of a number

Function name

Where to implement

src/addPrime.js

Description (optional)

Add all the prime values in an array and return the sum.

revsereString

Where to implement

src/revsereString.js

Description (optional)

Should reverse a string

"abcd" => "dcba"

Function name

Where to implement

src/arraysum.js

Description (optional)

Find and return the sum of integer array

Function name

Where to implement

src/maxsumsubarray.cpp

Description (optional)

Description of the function

Function name

Where to implement

src/findaverage.js

Description (optional)

Find average of the array

Function name

Where to implement

src/calPerimeterPolygon.js

Description (optional)

Take number of sides of polygon, input the length of sides and calculate the perimeter of the polygon.

Function name

Where to implement

src/isPerfectSquare.js

Description (optional)

to check whether a number is perfect square or not

celsiusToFahrenheit

Where to implement

src/celsiusToFahrenheit.js

Description (optional)

If the function is complex enough to warrant a description, add it here...

areAnagrams

Where to implement

src/areAnagrams.js

Description (optional)

Given two strings, find whether the two strings are anagrams of each other

Function name

Where to implement

src/transpose_matrix.cpp

Description (optional)

Description of the function

Function Name - count_even_numbers

Where to implement

src/countEvenNumbers.js

Description

Return the number of even numbers in an integer array

Function name

Where to implement

src/asciiToChar.js

Description (optional)

From ascii value return the character

ArraySum

Where to implement

src/arraySum.cpp

Description (optional)

write a function to compute and print the sum of elements of a given array.

Function name

Where to implement

src/isArmStrongNumber.js

Description (optional)

input 153
output true
This is because 111 + 333 + 555 = 153

Function name

Where to implement

src/isMatrixSquare.js

Description (optional)

Tell me if a matrix is square

isPrime

Where to implement

src/isPrime.js

Description (optional)

check whether the number is a prime number

Function name

Where to implement

src/luckyNumber.js

Description (optional)

Program to check if a given number is Lucky (all digits are different)
Input: n = 983
Output: true
All digits are different

Input: n = 9838
Output: false
8 appears twice

Number Of Prime Factors

Where to implement

src/factorsPrimeNumber.cpp

Description (optional)

Calculate the total number of prime factors of a given number

Function name

Where to implement

doubleArrayElements.js

Description (optional)

given an array containing positive integers, double these integers and return a new array

Function name

toUpper

Where to implement

src/toUpper.js

Description (optional)

convert lower case characters to upper case characters

Decimal to Binary

Where to implement

src/decToBin.js

Description (optional)

Convert a given decimal number to binary

Function name

Where to implement

src/isPalindromeString.js

Description (optional)

Check if the given string is Palindrome

Function name

Where to implement

src/X_and_O.js

Description (optional)

X_and_O takes a string and checks if it has the same number of 'x's and 'o's...

Function name

Where to implement

src/revNumber.js

Description (optional)

Reverse a number

Function name

Where to implement

src/nextPrime.js

Description (optional)

Description of the function

Function name

Where to implement

src/addOdd.js

Description (optional)

Add all the odd values in an array and return the sum.

nextFibonacci

Where to implement

src/nextFibonacci.js

Description (optional)

Given a number, find the smallest Fibonacci number strictly greater than the given number.

Function name

Where to implement

src/addEven.js

Description (optional)

Add all the even values in an array and return the sum.