Some small algorithm exercises to keep my skills sharp 💡
-
Updated
Jun 25, 2018 - JavaScript
Some small algorithm exercises to keep my skills sharp 💡
freeCodeCamp algorithms, projects, and examples.
Make a function that looks through an array of objects (first argument) and returns an array of all objects that have matching name and value pairs (second argument). Each name and value pair of the source object has to be present in the object from the collection if it is to be included in the returned array.
Return an English translated sentence of the passed binary string. The binary string will be space separated.
Given a positive integer num, return the sum of all odd Fibonacci numbers that are less than or equal to num.
Write a function that takes two or more arrays and returns a new array of unique values in the order of the original provided arrays. In other words, all values present from all arrays should be included in their original order, but with no duplicates in the final array.
A repository containing all the FreeCodeCamp Curriculum's projects made by myself.
My solutions for freeCodeCamp tasks. Use it as a reference and don't cheat yourself.
Write a function that splits an array (first argument) into groups the length of size (second argument) and returns them as a two-dimensional array.
You will be provided with an initial array (the first argument in the destroyer function), followed by one or more arguments. Remove all elements from the initial array that are of the same value as these arguments. Note: You have to use the arguments object.
My Solutions to (Basic, Intermediate, Advanced) FreeCodeCamp Algorithm Scripting.
Various freeCodeCamp Solutions
Algorithm implementation for Caesar's Cipher that utilizes ROT13 encryption
Free Code Camp_Intermediate and Advanced Algorithm Solutions
A JavaScript Algorithms and Data Structures Project
Pig Latin is a way of altering English Words. The rules are as follows: - If a word begins with a consonant, take the first consonant or consonant cluster, move it to the end of the word, and add ay to it. - If a word begins with a vowel, just add way at the end.
Check if the predicate (second argument) is truthy on all elements of a collection (first argument).
Return true if the passed string looks like a valid US phone number.
Pairs of DNA strands consist of nucleobase pairs. Base pairs are represented by the characters AT and CG, which form building blocks of the DNA double helix.
Add a description, image, and links to the freecodecamp-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the freecodecamp-algorithms topic, visit your repo's landing page and select "manage topics."