Blocks your path

>Blocks your path
What do you do?

Perform Fizzbuzz

I don't get it

shoot it in a continuous stream of bullets making it spin wildly.

Delete this thread because we had it yesterday.

draw the projection of an icosahedron.

write an O(log n) algorithm for the TSP in Whitespace on it

I'll knock it down. Just give me 30 minutes and I'll be here.

>install gentoo

Draw offensive graffiti on the other side.
Wrap yourself around with smugness as normies are unaware of your passive-agressive arty act of resistance.

Draw a reverse binary search tree that sorts the sums of primes below each prime thats less than 2 million

Sum up all fizzes up to 2 bubbles and then invert it.

Just like you won't get the job.

turn 360 degrees and walk away

Invert the binary sum of all primes under 2 millions printed by fizzbuzz.
Sample code:
exit

Write a dumb blog post on how solving math problems for a UX job is completely unnecessary

Write a "hello world" algorithm in the most convoluted way possible.

do epic swastika

>be in charge of hiring at my company
>female applicant
>pull out the whiteboard
>ask her to write bubble sort
>she starts writing an android app manifest
>ask her what she's doing
>she thought bubble sort was a mobile game

Devise a final solution to the eternal whiteboard behind every failed interview.

Draw a dick.

Inverse a binary tree, tell the interviewer I'll be expecting a corner office, tip my fedora and teleport away

constant time fizzbuzz

quantum monkey sort in constant time in a single line of assembly

question

why is the sieve of muhammed or some shit the best way to do the thingy of primes under n?

i wrote a c program but it takes longer for what is basically bruteforcing the primes. running some pajeet example of a sieve, it takes ten times less.

what sorcery is this?

>sieve of muhammed or some shit
I laughed