Hey guys, I'm wondering if you could help me. I'm trying to iterate through objects, and I'm not sure how to do a nested forEach inside of a map, (I think(.I need to be able to render the name, etc. Of the things inside of JS objects. FreeCodeCamp is a donor-supported tax-exempt 501(c)(3) nonprofit organization (United States Federal Tax Identification Number: ) Our mission: to help people learn to code for free. We accomplish this by creating thousands of videos, articles, and interactive coding lessons - all freely available to the public. Don't know how much it's due to free code camp, but I did get a job developing websites after I had nearly completed the first part of free code camp. It took me a long time but I have personally created my own videos with solutions for freeCodeCamp and I would like to share it with you. I hope you like it! Help Reddit App Reddit coins. Mar 24, 2016 A friend of mine showed me www.freecodecamp.com and I was thinking maybe it could be a good idea to use in combination with Treehouse - It even have real-life-projects which I'm looking forward to try out. My question is: Have anyone in here used freecodecamp before? And was is your thoughts about this website?
freeCodeCamp Guide
This website is full of articles about all things related to programming. You can use the search bar above to find something you would like to learn about, or use the navigation to explore the content.
There are articles on:
- SQL
- Mathematics
- JavaScript
- Bootstrap
- Git
- and a whole lot more
Not sure where to start?
If you want to learn programming but you're not sure where to start, check out freeCodeCamp.org. It has a curriculum that starts from zero and helps you learn to code.
Contribute to the Guide
This site and the articles on it are open source. Your help in making it better is greatly appreciated!
Happy coding!
fcc_scm.js
functionsmallestCommons(arr){ |
arr.sort(); |
functionlcm(num1,num2){//function to find the lowest common multiple. based on the euclidean algorithm (first finds gcd) |
vara=num1;//variable to store num1 for gcd calc |
varb=num2; |
vararr1=[];//array to store lcd, gcm |
while(a != 0&&b !=0){//this while statement to first find the gcd is the meat of the euclidean alg |
if(a <= b){ |
b=b % a; |
} |
else{ |
a=a % b; |
} |
} |
varx;//variable to store GCD |
if(a>0){ |
x=a; |
}else{ |
x=b; |
} |
varz;//variable to store LCM. |
z=(num1*num2)/x; |
returnz; |
} |
varc=arr[0]; |
vard=arr[1]; |
vary=lcm(arr[0],arr[1]); |
for(i=arr[0];i<=arr[1];i++){ |
y=lcm(c,y); |
c++; |
} |
returny; |
} |
smallestCommons([13,1]); |
index.html
Free Code Camp Java
<h2></h2>My solution to Bonfire: Smallest Common Multiple (of Range)</h2> |
<p></p>This was the most difficult bonfire for me to date. I found happiness by applying the Euclidean Algorithm to first find the greatest common divisor (GCD). Going from the GCD to the LCM is a cinch because the LCM of two numbers equals the product of those two numbers divided by the GCD. View the codepen Javascript to see solution.<p></p> |
commented Sep 22, 2015
My solution to Bonfire: Smallest Common Multiple (of Range) This was the most difficult bonfire for me to date. I found happiness by applying the Euclidean Algorithm to first find the greatest common divisor (GCD). Going from the GCD to the LCM is a cinch because the LCM of two numbers equals the product of those two numbers divided by the GCD. View the codepen Javascript to see solution. |
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment