get help in general - we have more specialized help rooms here: https://gitter.im/FreeCodeCamp/home
Do I really need to go thru all chrome dev tools at such an early stage? besides, the interface is TERRIBLY buggy...
@avremel What bugs are you running into?
@avremel I did, it doesn't take that long. Yeah it is buggy but just do what you can.
1) challenges being automatically completed upon loading 2) not responding to some edits in console/dev tools...
oh, you mean the Codeschool aspect is buggy?
yeah
Even though it isn’t the best experience, getting a good foundation in Chrome Dev Tools is going to help a lot once you get further into development.
i feel inundated :)
Don’t get hung up on the codeschool bugginess though.
thanks i shall recover
If it isn’t responding to edits and you get the basic idea, just skip along if you have to.
The content in the codeschool dev tools is what is most important, not whether or not you can get the extension to interact correctly with codeschool!
btw how many FCC conversations/chatrooms are there here. I know of FCC, FCC/help and FCC/letspair
You’ve got them covered. That’s it.
Dunno, they have one for the projects
great
They also have a private room for the FCC devs
projects are after completion of all the challenges?
@cameronchong very true. We just keep that one for the volunteer camp counselors though.
@avremel Yep
@avremel The nonprofit projects start after completion of all of the challenges. Then there are trello boards and other ways that the project is tracked.
is there a simple way to chat with others going through the same challenges?
@avremel There will be a better way soon. Not chat; but we’re about to revamp the FCC Forum and will include a good section and threads for all of the challenges.
Everyone goes at different paces, that the general FCC chat or this help area are the best place to go for help.
ok great, long road ahead..
It may come along faster than you think. How much time are you able to put into the challenges each week?
right now I try to get in 3 hours a day
2-3 challenges a day
So about 20 hours a week? You’ll be done with the 100 hours of challenges in no time. And at that pace you’ll be done with the additional 900 hours of nonprofit work in less than a year!
900 is the magic number!!!
I hope I get there...
If you put in the time, you will. There is plenty of support here to help you through.
Anyone available to help me understand something in Python 2?
Oh my god, I am about to dispair on the Bonfire http://www.freecodecamp.com/bonfires/sum-all-odd-fibonacci-numbers
anyone can help me find my error in my code?
function sumFibs(num) {
//Initialize variables
var fibs = [0,1];
var oddIndex = [0,1];
var tmp = 0;
var sum = 0;
var index = 0;
//Create Fibonacci Number and checks if odd. Saves oddIndex.
for(var i = 1; i <=num; i++){
tmp = fibs[i]+fibs[i-1];
if(tmp%2!==0){
oddIndex.push(i+1);
}
fibs.push(tmp);
}
//Sum odd Fibonacci Numbers
for(var j = 0; j<oddIndex.length; j++){
index = oddIndex[j];
sum += fibs[index];
}
return sum;
}
sumFibs(6);
the first three test are passing. the test for bigger numbers fail.
Double check what you're pushing onto oddIndex
oddIndex.push(i+1); <--- not a fibonacci number
nono, i know. i want to save the index of each fib number in that array
why not summing right there if it's an odd number
Anyways, double check the tests, I've heard many people complaining about that bonfire, don't know if they changed the instructions or fixed the tests.
mh ok...
I havent beel able to get past that bonfire either @DeXtr0niC
I either pass the larger numbers test or the smaller ones
=/
*been
yeah i had a chat with Nathan about this yesterday. He says it`s working as intended
hmm
then i'll have to revisit it
@DeXtr0niC can you print your fibs and oddindex arrays for a given input? let's say 100
no then it crashes. Because the tests will fire in big numbers anyway
had this problem yesterday
also
take into consideration that fib series is 0,1,1,2,3.... (2 1's at start)
yeah i have. my "fib-factory" is running right
I think it's taken into account but many failed at that
:P
anyways, I find the 2nd loop unnecessary
you could just sum right away
also omitting the index array
Let`s see if i can get rid of this
function sumFibs(num) {
//Initialize variables
var fibs = [0,1];
var tmp = 0;
var sum = 1;
//Create Fibonacci Number and checks if odd.
for(var i = 1; i <=num; i++){
tmp = fibs[i]+fibs[i-1];
if(tmp%2!==0){
sum += tmp;
}
fibs.push(tmp);
}
return sum;
}
sumFibs(4);
...now I am confused
cause I got something to pass the unit test for that
but I had to kludge it
what is kludge @alicekamada
oh nevermind i googled it :sweat_smile:
duh
just read the instructions
you got it wrong
fibs are up to passed number
not first N numbers
no, the test have the wrong values
but it expects 10 when you insert 4
I just did the calculations
when it would be "up to" then it would expect 0+1+1+3 = 5
^ @crisberrios
the more info box specifies the extra one is out
so whatever algorithm calculated the test values added the last Fibonacci number under the ceiling into the total twice
plus the extra leading one, which shouldn't be there
ahhhh
so i can`t solve it ^^
You probably have solved it.
or i could do what the algo does, too. It would pass the tests i guess^^
Just can't pass the tests unless you account for the mistakes
strange, yesterday Nathan said the bonfire is working as intended ... :-/
The bonfire, maybe.
and the challenge^^
The testing for that particular challenge, no.
thanks @alicekamada
NP, anyone know where I put the bug report?
I don't think its a testing issue
its more of directions not clear issue
it took me a while to get it but this was my solution
Definitely wrong values in the testing suite
function sumFibs(num) {
//Initialize variables
var fibs = [0,1];
var tmp = 0;
var sum = 1;
//Create Fibonacci Number and checks if odd.
for(var i = 1; i <=num; i++){
tmp = fibs[i]+fibs[i-1];
if(tmp%2!==0){
sum += tmp;
}
if(tmp >= num){
return sum
}
fibs.push(tmp);
}
}
You can open issue through github
It's not the Fib under ceiling, it's the Fib right over ceiling
@hk99 Let me try running this. Looking at it, it should never go past 1.
What do you mean?
wait, nevermind
I misread
well... your solution works, but i don`t know exactly why... @hk99
I see it now
@DeXtr0niC
@hk99 Add a console.log(tmp); right above your return statement
you sum it up. then you check if the last fibonacci number is greater than your passed one. so you are summing the one above your passed number, too
and you'll see the issue
^ that
i think it`s just not clear from the task. Or it is simply wrong^^ should be reviewed
I'll talk to @terakilobyte next time he's on
it's a mix of 1st N fibs + fibs up to N
2 conditions
@crisberrios That is definitely not what the instructions say
Also.... tmp can be > num
so instructions are all wrong
thanks everyone :)
Mathwise, we're using a filtering function on a series, then summing the series.
@DeXtr0niC No problem, figuring out stuff like this is fun for me.
@alicekamada nice to hear haha. it`s not for me :D
but that`s why we are a community, right? :)
Yup
I see the issues with the fib challenge, I'll be changing the description shortly
the fibonacci problem had the right values in the testing suite but the wrong description
I've changed the testing suite to match the description
they'll take hold shortly
hang tight!
build pushed
challenge fixed
thanks tkb
np
the description should now be inline with the updated tests
let me know if there are any more difficulties
Quick question here.
I have two statments that are intended to accomplish the same purpose.
I'm not getting why sample 1 returns a full string and sample 2 returns am error. (If I put a return in either of the if statements, it returns the first letter of the string.)
function swap(str) {
var list = "";
for(var i = 0; i < str.length; i++) {
if(str.charAt(i).match(/[A-Z]/g)) {
list += str[i].toLowerCase();
//list[i].toLowerCase();
}
if(str.charAt(i).match(/[a-z]/g)) {
list += str[i].toUpperCase();
}
}
return list;
}
swap("The");
function swap(str) {
var list = "";
for(var i = 0; i < str.length; i++) {
if(str[i].charCodeAt() >= 65 || str[i].charcodeAt() <= 90) {
list += String.fromCharCode(str[i].charCodeAt(0) + 32);
}
if(str[i].charCodeAt() >= 97 || str[i].charcodeAt() <= 122) {
list += String.fromCharCode(str[i].charCodeAt(0) - 32);
}
}
return list;
}
swap("The");
@davisec52 you're not using charCodeAt correctly
@BenClist Thank you. Could you explain?
@BenClist Never mind. Thanks. Just slap me.
haha no worries
you need to give it a number ;)
Jeez!
By the way
str.charCodeAt(i);is going to be more efficient than
str[i].charCodeAt(0);
Right. Thank you.