Coding Interview Prep: Project Euler - Ten Thousand First Prime Number (freeCodeCamp)
Problem 7: 10001st prime By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is …
Problem 7: 10001st prime By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is …
Implement Merge Sort Another common intermediate sorting algorithm is merge sort. Like quick sort, merge sort also uses …
Implement Quick Sort Here we will move on to an intermediate sorting algorithm: quick sort. Quick sort is an efficient, re…
Implement Insertion Sort The next sorting method we'll look at is insertion sort. This method works by building up a s…
Implement Selection Sort Here we will implement selection sort. Selection sort works by selecting the minimum value in a l…
Implement Bubble Sort This is the first of several challenges on sorting algorithms. Given an array of unsorted items, we …
Pairwise Given an array arr , find element pairs whose sum equal the second argument arg and return the sum of their in…
Inventory Update Compare and update the inventory stored in a 2D array against a second 2D array of a fresh delivery. Upda…
100 doors There are 100 doors in a row that are all initially closed. You make 100 passes by the doors. The first time thr…
Problem 6: Sum square difference The sum of the squares of the first ten natural numbers is, 1 2 + 2 2 + ... + 10 2 = 3…
Problem 5: Smallest multiple 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without a…
Problem 4: Largest palindrome product A palindromic number reads the same both ways. The largest palindrome made from the …
Our website uses cookies to improve your experience. Learn more
Ok