Hi I'm here for the job interview

Attached: 1520363403832.png (842x792, 88K)

I can only currently remember some stuff about Recursion, so only can answer first question. It'd be something based on this, right?

There are 4 steps.

-Go up 1 in first step, there are 3 steps left.

-Go up 2 in first step, there are 2 steps left.

ways up N steps = (ways up N-1 steps) + (ways up N-2 steps)

North American Pavement Ape

So edgy wow!

You also have to set up when to stop the recursion, but you get the idea.
But a recursion is slow, your answer is O(2^N). Can you do it faster?

Diversity is our strength so our policy is to provide hints to oppressed candidates :^)
ways_up(5) = ways_up(4) + ways_up(3) = ways_up(3) + ways_up(2) + ways_up(3) = ...
so you compute ways_up(k) several time.

>Can you do it faster
Would I have to not use Recursion, or would I just have to modify how I'm using Recursion? I haven't regularly programmed in years btw.

*unzips dick*

still so many normans and soys left

no wonder we still are in a bear market

Attached: 1533248535905.jpg (728x728, 50K)

Sorry I just dont hire fucking niggers okay?? Think about it, if I hired a nigger ai would also need to hire more security since they will be trying to steal shit.

As you've noticed, the first case is basically a "custom" fibonacci so you could escape recursion and do it iteratively.
But if you want to keep a recursive structure, what if you used dynamic programming? (you store the intermediate calculations instead of computing each time, if you don't know what dynamic programming is)

Nice to meed you Tyrone. We could use a minority hire

>ways_up(5) = ways_up(4) + ways_up(3) = ways_up(3) + ways_up(2) + ways_up(3)

Oh, so instead of going through ways_up(3) multiple times, you just store the value you get from doing the first time, improving algorithm efficiency? Not currently sure how I'd do that, but just figuring out the concept.

You get the idea.
You could implement it by setting up an array of size N and filling it up as you compute the values.
For example,
>Have I seen ways_up(3) before?
>No : compute it and store the value
>Yes : look up what ways_up(3) instead of computing it again.

en.wikipedia.org/wiki/Dynamic_programming
The solution for the problem dailycodingproblem.com/blog/staircase-problem/

thanks

You can do all you want after you GO BACK to europe. America belongs to Amerindians the same as europe belongs to europeans.

Time to get replaced, subhuman.

Unlike most people here and all of pol, I have no problem with respectable black people. If he seems intelligent, fulfills the required qualifications, and speaks English eloquently then Id have no problem hiring him. It's hood niggers and low IQ diversity hires whom I hate

Hello, Tyrone. You're hired!
And don't worry about all those white guys who came before you. Sure, maybe they do have more experience and all that, but...
You know what, forget about them. Welcome to the company!

Attached: van_patten.jpg (386x401, 27K)

I'm a programmer, I decide how I can get up those stairs faggot.

I choose teleportation. That is the only way you can bypass these stairs.

Let N be the number of stairs.
Let J be the enumeration of the ways you can get up the stairs. (0) Because the only way is Teleportation.
Let P be the amount of steps we climb.

Switch(J){case Teleportation: P=J; break;}

Climbstairs(P).

Done.

I do what I want faggot, boundaries in these little cuck word problems do not apply to me.

Your already hired. We have to meet our diversity quotas this month. Whats that you say? You have no skills? Doesnt matter. Congrats on being a nigger and welcome to the team.

Daz rasist

Hi Tyrone! Don't worry, there's no interview for prison workshops- you're already hired!

Pure gold user. Made me laugh while waiting for my wagecuck breakfast to be done.

burn alive you nigger

Sorry we dont hire niggers

Why do pajeets always try to be funny whenever mental effort is require?
>Question
How many ping pong balls can you fit in an bus?
>Typical interviewee
*Estimates the size of a ping pong ball, then its volume. Estimates the volume of a bus, taking in consideration the seats. Compute how many balls can fit in the bus and round up to the lower bound to take into account spheres packing loss*
>average pajeet
"a lot sir :)"

I have something simpler for you.
I draw 4 circles on the board, give you the marker and ask you to draw the needles corresponding to 06:00, 3:15, 9:45 and 18:30.

then why'd you hire you?

you mean
>Typical interviewee who's actually qualified for the job unlike 95% of candidates
"Look sir, if you're going to just give me stupid questions and not even tell me the fucking salary range I'm just going to leave."

Except 95% of candidate think they're top 5%

The hiring manager isn't int today, i'll pass along a message and get him to call you.

Oh yes, i'm here for interview. Not a lot of candidates around today, huh?

Attached: devilish.jpg (211x239, 11K)

Attached: 421566_110052819134743_1827862103_n.jpg (501x373, 39K)

Sorry, I don't hire black people.

>ctrl+f
>type "nig"
>6 results

Attached: 1488947213211.jpg (1024x576, 60K)

Funny thing is that I used to work in a meat packing facility. It was hard work, but at least I could say I earned it.

>subtle brag about using ctrl+F

branches = 0
while(set.length > 0):{
def recursiveClimb(N, set): {
while(N > 0):{
descendingSort(set)
if (set[0] > N): set.pop()
if (set[0] = N): {branches += 1; return}
else: recusiveClimb(N-set[0], set)
}
}
set.pop()
}
return branches

>python
you have to go back

>implying python is a bad language to know.
NiggeR

Based and redpilled

Python doesn't have brackets { }

Finally someone without a face tattoo

When can you start

they are called curly brackets.

you're right, but Jow Forums doesn't let me indent comments. Might as well be pseudocode though

What is space bar?

Have a seat!

*interviews*

Let f(N) be the Nth fibonnacci number where the fibonaccinumbers are given by fib(0) = 1
fib(1)=1
fib(2)=2
...
fib(G)= fib(G-1) + fib(G-2)

the function Nth fibonacci number can be written in a closed form.

given a set of positive integers X of the number of steps you could climb at a time, the number of ways up N steps would be given by via process of pure brilliant mathematical intuition and brilliance a modified Nth fibonacci number where instead of fib (G) = fib(G-1) + fib (G-2) we have fib(G) = fib(G-x1) + fib(G-x2)...+fib(G-xfinal)

This was really funny for some reason

Guy's well dressed and even if you're a racist you can recognize he's around 2/3 white. I'd hire him and apply for liberal state grants for diversity.

6 is a straight veritcal line , 3 15 is a horizontal line connected at teh left hand side line that is 7.5 degrees below it , 9:45 is a horizontal line connected at the right hand side to a line that is 22.5 degrees above it. 18:30 is a horizontal line that is connected at teh top to a line that 15 degrees to the left of it.

Surely the clock question is too easy for anything?

Don't you normally ask something like "at what time after 3 pm do the minute and hour hands next overlap?" ?

There's a formula for cacluating niggerness. You take the percentage of nigger and multiply it by 4. That equals the true value of nigger in the person. So 1/3 nigger would equal to about 133% nigger. So you would be hiring a full nigger deep down.

Fibonacci recurrence.

For the royal banquet, 100 bottle of wine have been delivered, however 1 of them is poisoned. Hopefully, there are monkeys available that you can use as tasters. How many monkeys would you need to find the bottle ?

Depends on how easily I can train a monkey to pour wine in my mouth, so to make it quick maybe 5 or 3?

Wow user, did you fall for the crypto meme and gave all your money to chinese "entrepreneurs" ?

Yes I fell for the Bitmex meme and many more.
But I admit I was powerless over memes and so on but now I need some money.

Attached: xXxfrogxXx.jpg (679x631, 142K)

1

Good luck, I hope your learned there is no shortcut to success

Death is not immediate so it would take too long with 1 monkey to wait after each bottle until poison took effect. Basically, you need to make them drink immediately and go back to preparing the buffet. You will come back later to see the result.

Yes nothing better than hard work user.

Well maybe if Cucking Bear and Drunk Eagle finally get their wino asses off the Navajo reservation maybe they can finally revolt against us and have their white genocide. Until then tough shit.