#challenge

💻 Array of Multiples | #easy

Create a function that takes two numbers as arguments (num, length) and returns an array of multiples of num until the array length reaches length.

Examples:

ArrayOfMultiples(7, 5) ➞ [7, 14, 21, 28, 35]
ArrayOfMultiples(12, 10) ➞ [12, 24, 36, 48, 60, 72, 84, 96, 108, 120]
ArrayOfMultiples(17, 6) ➞ [17, 34, 51, 68, 85, 102]

For your convenience: dotnetfiddle.

🏆 Leave your solutions in the comments. The solution will be posted below in a couple of hours 👇

#interview

✨ Here is a solution for the #challenge above

💬 Personally, I like the first solution more, it is much more expressive!

#challenge

💻 Check if a Number is Prime | #easy

Create a function that returns true if a number is prime, and false otherwise. A prime number is any positive integer that is evenly divisible by only two divisors: 1 and itself.

The first ten prime numbers are: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29

Examples:

isPrime(31) ➞ true
isPrime(18) ➞ false
isPrime(11) ➞ true

For your convenience: dotnetfiddle.

🏆 Leave your solutions in the comments. The solution will be posted below in a couple of hours 👇

#interview

✨ Here is a solution for the #challenge above

#challenge

💻 Capitalize the First Letter of Each Word | #easy

Create a function that takes a string as an argument and converts the first character of each word to uppercase. Return the newly formatted string.

Examples:

MakeTitle("This is a title") ➞ "This Is A Title"
MakeTitle("capitalize every word") ➞ "Capitalize Every Word"
MakeTitle("I Like Pizza") ➞ "I Like Pizza"
MakeTitle("PIZZA PIZZA PIZZA") ➞ "PIZZA PIZZA PIZZA"

For your convenience: dotnetfiddle.

🏆 Leave your solutions in the comments. The solution will be posted below in a couple of hours 👇

#interview

✨ Here is a solution for the #challenge above

💬 Actually, I vote for this solution to this #challenge instead.

Thx to Roman!

#challenge

💻 Perfect Number | #easy

Create a function that tests whether or not an integer is a perfect number. A perfect number is a number that can be written as the sum of its factors, (equal to sum of its proper divisors) excluding the number itself.

For example, 6 is a perfect number, since 1 + 2 + 3 = 6, where 1, 2, and 3 are all factors of 6. Similarly, 28 is a perfect number, since 1 + 2 + 4 + 7 + 14 = 28.

Examples:

CheckPerfect(6) ➞ true
CheckPerfect(28) ➞ true
CheckPerfect(496) ➞ true
CheckPerfect(12) ➞ false
CheckPerfect(97) ➞ false

🏆 Leave your solutions in the comments. The solution will be posted below in a couple of hours 👇

#interview

✨ Here is a solution for the #challenge above

#challenge

💻 Is the Input Factorial of an Integer? | #easy

Create a function that checks if a given integer is exactly the factorial of an integer or not. true if it is, false otherwise.

Examples:

isFactorial(2) ➞ true
// 2 = 2 * 1 = 2!

isFactorial(27) ➞ false

isFactorial(24) ➞ true
// 24 = 4 * 3 * 2 * 1 = 4!

🏆 Leave your solutions in the comments. The solution will be posted below in a couple of hours 👇

#interview

✨ Here is a solution for the #challenge above

#challenge

💻 Largest Gap | #easy

Given an array of integers, return the largest gap between elements of the sorted version of that array.

Here's an illustrative example. Consider the array:

9, 4, 26, 26, 0, 0, 5, 20, 6, 25, 5

... which, after sorting, becomes the array:

0, 0, 4, 5, 5, 6, 9, 20, 25, 26, 26

... so that we now see that the largest gap in the array is the gap of 11 between 9 and 20.

Examples:

LargestGap(new int[] { 9, 4, 26, 26, 0, 0, 5, 20, 6, 25, 5 }) ➞ 11
// After sorting get { 0, 0, 4, 5, 5, 6, 9, 20, 25, 26, 26 }
// Largest gap of 11 between 9 and 20

LargestGap(new int[] { 14, 13, 7, 1, 4, 12, 3, 7, 7, 12, 11, 5, 7 }) ➞ 4
// After sorting get { 1, 3, 4, 5, 7, 7, 7, 7, 11, 12, 12, 13, 14 }
// Largest gap of 4 between 7 and 11

🏆 Leave your solutions in the comments. The solution will be posted below in a couple of hours 👇

#interview

✨ Here is a solution for the #challenge above

💬 At first blush, it seems tricky but, in my opinion, this solution is really graceful

#challenge

💻 Compounding Letters | #easy

Create a function that takes a string and returns a new string with each new character accumulating by +1. Separate each set with a dash.

Capitalize the first letter of each set.

Examples:

Accum("abcd") ➞ "A-Bb-Ccc-Dddd"
Accum("RqaEzty") ➞ "R-Qq-Aaa-Eeee-Zzzzz-Tttttt-Yyyyyyy"
Accum("cwAt") ➞ "C-Ww-Aaa-Tttt"

🏆 Leave your solutions in the comments. The solution will be posted below in a couple of hours 👇

#interview

✨ Here is a solution for the #challenge above

#challenge

💻 Letter Distance | #easy

Given two words, the letter distance is calculated by taking the absolute value of the difference in character codes and summing up the difference.

If one word is longer than another, add the difference in lengths towards the score.

To illustrate:

 "fly") = dist("h", "f") + dist("o", "l") + dist("u", "y") + dist(house.Length, fly.Length)

= |104 - 102| + |111 - 108| + |117 - 121| + |5 - 3|
= 2 + 3 + 4 + 2
= 11

Examples:

LetterDistance("sharp", "sharq") ➞ 1
LetterDistance("abcde", "Abcde") ➞ 32
LetterDistance("abcde", "bcdef") ➞ 5

🏆 Leave your solutions in the comments. The solution will be posted below in a couple of hours 👇

#interview

✨ Here is a solution for the #challenge above

#challenge

💻 Pentagonal Number | #easy

Write a function that takes a positive integer num and calculates how many dots exist in a pentagonal shape around the center dot on the Nth iteration.

In the image below you can see the first iteration is only a single dot. On the second, there are 6 dots. On the third, there are 16 dots, and on the fourth there are 31 dots.

Return the number of dots that exist in the whole pentagon on the Nth iteration.

Examples:

pentagonal(1) ➞ 1
pentagonal(2) ➞ 6
pentagonal(3) ➞ 16
pentagonal(8) ➞ 141

🏆 Leave your solutions in the comments. The solution will be posted below in a couple of hours 👇

#interview

✨ Here is a solution for the #challenge above