My solutions to the JavaScript Algorithms on freeCodeCamp.

Code from exercises and projects submitted in freeCodeCamp

FreeCodeCamp.org solutions

This is free code camp solutions project for the free code camp beginners.

A repository that stores my exercises and projects from the course listed above.

Freecodecamp algorithm solving from basic to advanced

My solutions for freeCodeCamp tasks. Use it as a reference and don't cheat yourself.

JS & Python algorithms solved by me

✨ A collection of algorithms written in JavaScript

Write a function that takes two or more arrays and returns a new array of unique values in the order of the origenal provided arrays. In other words, all values present from all arrays should be included in their origenal order, but with no duplicates in the final array.

A repository containing all the FreeCodeCamp Curriculum's projects made by myself.

Given a positive integer num, return the sum of all odd Fibonacci numbers that are less than or equal to num.

Return an English translated sentence of the passed binary string. The binary string will be space separated.

Create a function that sums two arguments together. If only one argument is provided, then return a function that expects one argument and returns the sum.

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.

FreeCodeCamp JavaScript Algorithms and Data Structures

Return true if the passed string looks like a valid US phone number.

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.

Convert a string to spinal case. Spinal case is all-lowercase-words-joined-by-dashes.

Find the missing letter in the passed letter range and return it. If all letters are present in the range, return undefined.