When your question is answered use !solved to mark the question as resolved.
Remember to ask specific questions, provide necessary details, and reduce your question to its simplest form. For tips on how to ask a good question use !howto ask.
#Help with coding problem
teal lakeBOT
wind spoke
Well what do you have so far?
iron sage
Well what do you have so far?
i used recursion
but i am sure that its not the most efficient
wind spoke
well for an iterative method you only need to keep track of the nth and n+1th iteration and update them in a for loop
subtracting them from 1000 shouldnt be the hard part in that solution
tbf theres other solutions as well but those are more math than coding
paper meteor
Wtf type of description is this
iron sage
Wtf type of description is this
little jimmy has problems, and they are not limited to coding
paper meteor
iron sage
well for an iterative method you only need to keep track of the nth and n+1th it...
wdym
fib(n) = fib(n-1) + f(n-2)
definition of fibonacci right
yeah, but you are not limited to recursion for generating fibonacci numbers.
you can use an iterative approach which stores the previously computed value in an array
iron sage
but i am sure that its not the most efficient
for values 1 <= t <= 10 you might as well do a switch case ðŸ˜
iron sage
for values 1 <= t <= 10 you might as well do a switch case ðŸ˜
yea lmao
but aint do that
iron sage
you can use an iterative approach which stores the previously computed value in ...
yea just found it
iron sage
but aint do that
why not 
yanderedev code is amazing
i have another problem
just wanna make sure if my thought is correct
okay fine :(
iron sage
why not <:nooo:893467357148753920>
cuz its not efficient
if else...
switch case
yea
but yeah i actually think the iterative approach is easier
yea
this is just summation right?
SIR!!!!
ðŸ˜
yeah
reading the input is probably the challenge here
k
what about this
looks like a graph problem
dfs bfs
okay you might be cooked for this one
where are ytou even getting these @iron sage
from sm1
what's sm1
oh
someone
yea
robust root
the scary bit is how superiority is represented by capital N vs lowercase j
is this from a website dedicated to macabre C++ or just your ordinary KKK university course?
iron sage
the scary bit is how superiority is represented by capital N vs lowercase j
is t...
he said someone was supplying these questions
teal lakeBOT