Select Page

# BLOG

## JavaScript Challenge Internship to CEO #14

Task of Challenge #14/54 Print the first 10 Fibonacci numbers without recursion. Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... Solution Explanation We start with the creation of the for loop. We have to define the loop is running from 2 to 10 in order to get...

## Template for The JavaScript Internship to CEO Challenge #00 – The Challenge Template

Introduction & Tutorial If you are new to the challenge or don't know how to start, this is the template you can download and take part in my coding challenge JavaScript - Internship to CEO. Template Challenge-TemplateHerunterladen Just download the template,...

## My Top 5 Latest Medium Articles

German software engineer who helps aspiring coders to learn software development enjoyably where fun & emotions come first to learn on the fly ðŸ˜‰

## JavaScript Internship to CEO Challenge #24/54

Task of Challenge #24 Â Create a function that will merge two arrays and return the result as a new array. The two arrays: [9, 8, 7, 6],Â  [1, 2, 3, 4] . Solution Explanation The function mergeArrays has two inputs (array1 and array2). It also does create an empty array...

## JavaScript Internship to CEO Challenge #23/54

Task of Challenge #23 Reverse a string. The string â€žJavaScript with ArnoldCode is the best!â€œ Solution Explanation The function reverseString creates an empty string string2 where the reversed string will be stored to. A simple for loop covers the tasks of reversing...

## JavaScript Internship to CEO Challenge #22/54

Task of Challenge #22 Rotate an array to the right 1 position. E.g. [1, 2, 3] -> [ 3, 1, 2 ] | [1, 2, 4, 6, 3] -> [ 3, 1, 2, 4, 6 ]. Solution Explanation The function reverseArray just creates an empty array ar2 where the reversed one gets into. A simple for...

## JavaScript Internship to CEO Challenge – Challenge #21/54

Task of Challenge #21 Rotate an array to the right 1 position. E.g. [1, 2, 3] -> [ 3, 1, 2 ] | [1, 2, 4, 6, 3] -> [ 3, 1, 2, 4, 6 ]. Solution Explanation You can achieve the challenge's goal quite easily by using the opposites of shift() and the push() method...

## JavaScript Internship to CEO Challenge – Challenge #20/54

Task of Challenge #20 Rotate an array to the left 1 position. E.g. [1, 2, 3, 4, 5] -> [ 2, 3, 4, 5, 1 ] | [1, 2, 4, 5] -> [ 2, 4, 5, 1 ]. Solution Explanation You can achieve the challenge's goal quite easily by using the shift() and the push() method for arrays. The...

## JavaScript Internship to CEO Challenge – Challenge #19/54

Task of Challange #19 Create a function that will return in an array the first "nPrimes" prime numbers greater than a particular number "startAt" Solution Explanation The function getPrimes has to accept two parameters. nPrimes which decides the number of prime...

## JavaScript Internship to CEO Challenge – Challenge #18/54

Task of Challange #18 Print the first 99 prime numbers Solution Explanation The function printPrimes(nPrimes) is our looping function that will print out the number of primes we pass in. We stick to 99 for this challenge. The next step is to set n to 0, because we...

## JavaScript Challenge Internship to CEO #17/54

Task of Challenge #17/54 Calculate the sum of digits of a positive integer number. The integer 1235321 Solution Explanation The solution is pretty straightforward. You need to separate the digits to loop over them and add them to a sum. You can do it by a conversion...

## JavaScript Challenge Internship to CEO #16/54

Task of Challenge #16/54 Create a function that will return a Boolean specifying if a number is prime. Test with 1,5,6,7,9,11,13 & 27. Solution Explanation What is a prime number in maths? Prime numbersÂ are specialÂ numbers, greater than 1, that have exactly two...

## ContactÂ

#### Wustbacher Str 13, 42929, Germany, EU

Monday-Friday: 8am – 5pm