/biz/ - Business & Finance

[Anonymous No.10615497]

Hi I'm here for the job interview.

[Anonymous No.10615504]

Sorry I don't hire people who wear suits.

[Anonymous No.10615507]

>>10615504
rrrrroofflllll

[Anonymous No.10615524]

Hello son, this isn't really much of an interview more like an onboarding process. I just need these papers signed and I'll show you around the meat packing facility. You'll be able to start tomorrow morning.

[Anonymous No.10615525]

>>10615504
Is this better, boss?

[Anonymous No.10615534]

>>10615525
Yes son. You don't want your tie getting stuck in any of the machinery! *hearty chuckle*

[Anonymous No.10616312]

>>10615504
That's a nigger, not a person.

[Anonymous No.10616320]

>>10616312
/pol/, go

[Anonymous No.10616341]

>>10615497
*slides the white board in*

There exists a staircase with N steps, and you can climb up either 1 or 2 steps at a time.

Given N, write a function that returns the number of unique ways you can climb the staircase.
The order of the steps matters.

For example, if N is 4, then there are 5 unique ways:

1, 1, 1, 1
2, 1, 1
1, 2, 1
1, 1, 2
2, 2

What if, instead of being able to climb 1 or 2 steps at a time, you could climb any number from a set of positive integers X? For example, if X = {1, 3, 5}, you could climb 1, 3, or 5 steps at a time.

[Anonymous No.10616733]

>>10615497

i have called security and they are on their way. please leave immediately. also, CCTV is watching you.

[Anonymous No.10616753]

>>10616312

[Anonymous No.10616763]

>>10616341
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)

[Anonymous No.10616775]

>>10616753
North American Pavement Ape

[Anonymous No.10616781]

>>10616312
So edgy wow!

[Anonymous No.10617223]

>>10616763
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?

[Anonymous No.10617267]

>>10616763
>>10617223
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.

[Anonymous No.10617293]

>>10617223
>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.

[Anonymous No.10617310]

>>10616320
>>10616753
>>10616781
still so many normans and soys left

no wonder we still are in a bear market

[Anonymous No.10617309]

*unzips dick*

[Anonymous No.10617320]

>>10616781
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.

[Anonymous No.10617354]

>>10617293
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)

[Anonymous No.10617370]

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

[Anonymous No.10617410]

>>10617354
>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.

[Anonymous No.10617497]

>>10617410
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.

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

[Anonymous No.10617521]

>>10617497
thanks

[Anonymous No.10617580]

>>10617310
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.

[Anonymous No.10617910]

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

[Anonymous No.10618001]

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!

[Anonymous No.10618387]

>>10616341

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.

[Anonymous No.10618628]

>>10615497
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.

[Anonymous No.10618663]

>>10615504
Daz rasist

[Anonymous No.10618673]

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

[Anonymous No.10618707]

>>10618387
Pure gold anon. Made me laugh while waiting for my wagecuck breakfast to be done.

[Anonymous No.10618795]

>>10615497

burn alive you nigger

[Anonymous No.10618847]

>>10615497
Sorry we dont hire niggers

[Anonymous No.10618853]

>>10618387
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.

[Anonymous No.10619121]

>>10618847
then why'd you hire you?

[Anonymous No.10619132]

>>10618853
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."

[Anonymous No.10619480]

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

[Anonymous No.10619851]

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?

[Anonymous No.10620405]

>>10616753
>>10616781
>>10616320

[Anonymous No.10620806]

>>10615497
Sorry, I don't hire black people.

[Anonymous No.10620830]

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

[Anonymous No.10620857]

>>10615524
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.

[Anonymous No.10620916]

>>10620830
>subtle brag about using ctrl+F

[Anonymous No.10620918]

>>10616341
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

[Anonymous No.10620938]

>>10620918
>python
you have to go back

[Anonymous No.10620944]

>>10620938
>implying python is a bad language to know.
NiggeR

[Anonymous No.10621000]

>>10618387
Based and redpilled

[Anonymous No.10621014]

>>10620938
Python doesn't have brackets { }

[Anonymous No.10621025]

>>10615497
Finally someone without a face tattoo

When can you start

[Anonymous No.10621026]

>>10621014
they are called curly brackets.

[Anonymous No.10621028]

>>10621014
you're right, but 4chan doesn't let me indent comments. Might as well be pseudocode though

[Anonymous No.10621063]

>>10621028
What is space bar?

[Anonymous No.10621071]

>>10615497

Have a seat!

*interviews*

[Anonymous No.10621105]

>>10616341
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)

[Anonymous No.10621127]

>>10621071
This was really funny for some reason

[Anonymous No.10621131]

>>10615497
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.

[Anonymous No.10621193]

>>10618853
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?" ?

[Anonymous No.10621222]

>>10621131
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.

[Anonymous No.10621326]

>>10616341
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 ?

[Anonymous No.10621719]

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

[Anonymous No.10621969]

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

[Anonymous No.10622099]

>>10621969
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.

[Anonymous No.10622122]

>>10621326
1

[Anonymous No.10622209]

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

>>10622122
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.

[Anonymous No.10622257]

>>10622209
Yes nothing better than hard work Anon.

[Anonymous No.10622289]

>>10617580
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.