Author Archives: Tilps

As is usual with SRM I didn’t do this one.  However, I figure I might keep writing up blogs until next years TCO. Q1) Given a boolean rectangular array which maps to a hexagonal grid by shifting every second row … Continue reading →

So, as predicted by the odds I am out . I did at least score some points, so I came 125th. The question structure didn’t favour me, an easy first question jumping to a hard second question.  A fast time … Continue reading →

Q1) Given a dictionary and a mapping of numbers to sets of letters, and an input sequence consisting of numbers, ‘try alternate’ button pushes and ‘spaces’, determine the output.  Assume dictionary is processed in alphabetical order. A1) Easy enough, make … Continue reading →

Q1) Given a n rows of m seats, and a list of specific taken seats, return how many ways 2 people can sit next to each other. Limits: n and m up to 1 billion and number of taken seats … Continue reading →

Q1) Given a line of n (up to 51) rooms  separated by gates of up to 16 different types, a game is to be played.  One of the (non-end) rooms is the ‘target’ room, where both player 1 and player … Continue reading →

This SRM was cancelled due to some issues, but the questions are still there, so here I go… Q1) Determine the largest prime less than or equal to n, which when divided by 2 (each time rounding down) D-1 times, … Continue reading →

Q1) 2 people take turns to remove powers of 4 from a number which starts with n. Where each player tries to be the last person to remove a number determine who succeeds.  n is up to 1 billion. A1) … Continue reading →

Q1) Given a sequence of step, turn left and turn right commands, which are repeated infinitely, determine whether you will stay in a constrained (but not specified) area, or drift off in to the distance.  Maximum command sequence length is … Continue reading →

Q1) Given a set of unit steps in N dimensional space, each in a specific direction of a specific dimension, determine if the path ever self intersects.  N is up to 1 billion and there are up to 50 steps. … Continue reading →

Another past SRM. Q1) Given a list of n spots, where each spot is one of 3 types, and k markers, which are initially randomly placed such that no 2 markers are on the same spot, follow the rules where … Continue reading →