wildernesscat: (dont_jump)
Okay, so in this story there are 3 players: yours truly, the hi-tech placement agency (let's call them WorkData), and a large employer in the north of the country (let's call them Slippy). So these WorkData people they are very professional, doing their job, and sending my CV to every firm that can possibly hire me. One of the firms is Slippy. Slippy invites me for an interview, I take the train north, go through the normal procedure (questions, riddles, code writing, the works) and leave with a good impression. And rightfully so, because I am invited for a second interview. This time things go really rough. I feel like the interviewer and I are speaking in different languages. I don't quite get what he wants, he is not impressed by my skills, and the interview ends quite miserably. Mentally I swear I am not going back there, and indeed after a few days I get one of these standard "unfortunately, you were not selected for this position" letters. Fine with me, I forget about that place. But not WorkData. They were not updated, and think that I'm still an applicant at Slippy's. As I am approaching the finish line with other workplaces, WorkData call Slippy and say something along the lines of "Danny is about to close the deal, would you like to hurry up and give him an offer?". Guess what Slippy HR answers...Read more... )

wildernesscat: (touristinfo)

Some are much tougher than others.

wildernesscat: (wildsip)
Some of these are pretty tough. Why is a manhole cover round?
wildernesscat: (Default)
Another riddle from a job interview (not mine this time :) -

You have a bit-buffer that holds N bits. Bits are being fed into the least significat end of the buffer, causing a shift-left, and come out from the other end (when the buffer becomes full). Write a program that observes this buffer, and tells at any time if the N bits are evenly divisible by 5.

Update: It's very simple actually. All you have to do is work in base 5 all the way. Keep track of the lowest digit, and disregard all the rest. Like this -
static int lsdigit = 0;
lsdigit = lsdigit << 1 | new_bit;
if (lsdigit >= 5)
   lsdigit -= 5;
if (lsdigit == 0)
   printf("NOT divisible\n");

Update2: I stand corrected. There are no N bits in the buffer. It is assumed to be infinitely large.
wildernesscat: (Default)
There you are, another computational riddle.

Suppose you have a network of N routers, numbered R1 .. RN. The routers are configured in such a way, that information can only flow in one direction, forwards. It's also known that Ri is connected only to Ri+1 and Ri+2. Compute the number of different routes from R1 to RN.
wildernesscat: (Default)
Another job-interview riddle. Nice and easy.

You have a computer that uses words which are N bits long. Given an arbitrary word on this machine, determine whether it's a power of 2 (that is 1, 2, 4, 8, etc). Make it O(1).
wildernesscat: (Default)
Another nice riddle for my collection. I didn't manage to solve it during the interview, but now I know the answer.

there goes the riddle )
wildernesscat: (Default)
I'll make this entry, to serve as a directory to all the riddles I encounter during the job search. I'll try to attribute them to specific companies when possible. Let's start with some old ones.

Robotic paratroopers (NLayers)
A+B pills; 8 glasses of water (Creo)
Sorted Matrix (Oblicore)
Powers of 2
N Routers in a Row
The Bit Machine
Microsoft Interview Questions
Reversi Riddle

wildernesscat: (Default)
(God, I'm becoming so smart, it's frightening...)

  1. You've got 2 kinds of pills, the "A" kind and the "B" kind (lots of them). If you don't take one of each every hour, you'll die. If you take two of a kind together, you'll die as well (life sucks, huh?). The funny part about the pills, is that they're indistinguishable. They look, taste, smell, feel, weigh (etc) the same. One day you took a mixing bowl and placed one "A" pill in the bowl. Then you wanted to put one "B" in the bowl, but you spilled 2 "B"s by accident. Now they're all mixed (1 "A" and 2 "B"s). You still want to take your medicine, but you've got too many pills in the bowl. You don't want to throw them away and start anew, because they're terribly expensive. You also don't want to chance dying. What do you do now?

  2. You've got 8 glasses of water. Every glass has a different amount of water in it. The only thing you're alowed to do is: take any 2 glasses, pour water back and forth, and make it reach the same level in both glasses. You may repeat this for any 2 glasses any number of times. Describe a sequence for making them all contain the same amount of water.
wildernesscat: (Default)
A very nice riddle that was presented to me in one of my job interviews.
Imagine two identical robotic paratroopers that land simultaneously on a one-dimensional plane (essentially, an endless line) which is divided into squares. Each paratrooper lands on a random square and stands on top of his parachute. Now comes the tough part. The two paratroopers have to meet, but they can't see each other and don't know where they are on the grid. Read more... )

Update: [livejournal.com profile] oblomov_jerusal already supplied the correct answer, so if you want to think about the problem a bit longer, don't scroll beyond the schematic drawing.


wildernesscat: (Default)
Danny Dorfman

January 2017

15161718 192021

Style Credit


RSS Atom
Page generated Jul. 22nd, 2017 06:53 am
Powered by Dreamwidth Studios

Expand Cut Tags

No cut tags

Most Popular Tags