Warmup - Greatest Common Divisor

Write a JavaScript function to find the GCD (greatest common divisor) of more than 2 integers. Test Data: console.log(gcd_more_than_two_numbers([3,15,27])); console.log(gcd_more_than_two_numbers([5,10,15,25])); Output : 3 5

Draw a Circle

Write a JavaScript program to draw a circle: Expected Output:

Filter Search

Create an Angular or HTML app that has an search box (input box). You will have an array stored somewhere that has at least 20 words. You can use this array and add/subtract from it as you wish: ['change', 'rack', 'world', 'file', 'cat', 'car', 'baccarat', 'dog', 'window', 'drink', 'computer',

First Non Repeat

Write a JavaScript function to find the first non-adjacently-repeated character in a given string. Examples: * "abbbbc" returns "a" because it's the first instance of a character that doesn't repeat adjacently. * "aaaabcd" returns "b". * "aacccddeefg" returns "c".

Factorials

Write a JavaScript program to calculate the factorial of a number. In mathematics, the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n. For example, 5! = 5 x 4 x 3 x 2 x 1 = 120