The first task of this year qualification round of google code jam was only the problem: “check if a given tic-tac-toe game field has won by player “X” or “O” or it is a draw or “is not finished”. Read the complete description on the google code jam dashboard.
One change: There is a field “T” used as joker (for both player).
+----+ |XOOX| # The "\"-line with XXTX won! |OXXO| |OOTX| |OOOX| +----+
This year qualification round of google code jam has easy-to-understand problems. I will offer my solution for the second problem with a short solution (20 lines, no 1-liner) in python.
This is a small post to prepare for the google code jam and the small data set. Some coding questions can be solved (in short time) by iterating over all variants. I solved some problems of project euler with the python itertools.
Coding fast and solve it with the brute force variant.
The united-coders.com blog migration was my motivation to update a non-technical, german blog from a serendipity blog (short s9y) base to wordpress. The reason of switching to wordpress are different and will be reported here only from the technical view: Regularly updates, many themes and an active development community – but php.
First step for a blog migration (content and hosting) is a clean new installation on the target host. Use a dummy domain (and not a sub-folder) and configure a theme and some necessary plugins.
Google Code Jam 2012 started this weekend and this years qualification round was simpler than other years.
The first exercise is a character mapping problem. You will get some gibberish input and have to encode it to normal english sentences.
gibberish: ejp mysljylc kd kxveddknmc re jsicpdrysi ready: our language is impossible to understand
And there was only the small data set (with many tries to solve it) available. Ok, looks like a classical problem and I start thinking to build a solution with counting common english characters or iterate over all permutation to find words (from an english dictionary).
Continue reading
The first round of the facebook hackercup 2012 had three problems. All problems have to be solved in 24 hours and coders with three successful solved entries goes to round 2.
The problem “Recover the Sequence” can be solved in two lines of code (+ some lines for input and output).
Merge sort is one of the classic sorting algorithms. Conceptually, a merge sort works as follows. Divide the unsorted list into n sublists (n is 2 in the example), each containing 1 element (a list of 1 element is considered sorted). Repeatedly Merge sublists to produce new sublists until there is only 1 sublist remaining. (This will be the sorted list.)
The problem description starts with the pseudo code – I translated into a python class.
The second problem from this year facebook hackercup sound like the classic knapsack problem. But the solution is much easier (words are in fixed sort order). Feel free to find a smarter algorithm or comment my python solution.
We are starting preparations for Hacker Cup 2013 really early. Our first step is to prepare billboards to advertise the contest. We have text for hundreds of billboards, but we need your help to design them.
The billboards are of different sizes, but are all rectangular. The billboard widths and heights are all integers. We will supply you with the size in inches and the text we want printed. We want you to tell us how large we can print the text, such that it fits on the billboard without splitting any words across lines. Since this is to attract hackers like yourself, we will use a monospace font, meaning that all characters are of the same width (e.g.. ‘l’ and ‘m’ take up the same horizontal space, as do space characters). The characters in our font are of equal width and height, and there will be no additional spacing between adjacent characters or adjacent rows. If you print a word on one line and print the next word on the next line, you do not need to print a space between them.
Let’s say we want to print the text “Facebook Hacker Cup 2013″ on a 350×100″ billboard. If we use a font size of 33” per character, then we can print “Facebook” on the first line, “Hacker Cup” on the second and “2013” on the third. The widest of the three lines is “Hacker Cup”, which is 330″ wide. There are three lines, so the total height is 99″. We cannot go any larger.
This year qualification round had three problem. The easy one was Alphabet Soup – classic character counting problem.
Alfredo Spaghetti really likes soup, especially when it contains alphabet pasta. Every day he constructs a sentence from letters, places the letters into a bowl of broth and enjoys delicious alphabet soup.
Today, after constructing the sentence, Alfredo remembered that the Facebook Hacker Cup starts today! Thus, he decided to construct the phrase “HACKERCUP”. As he already added the letters to the broth, he is stuck with the letters he originally selected. Help Alfredo determine how many times he can place the word “HACKERCUP” side-by-side using the letters in his soup.
The facebook hacker cup is a google-code-jam like coding contest – starting with the 2012 qualification round this weekend. Try to solve the 2011 practice round. If you can submit your solution (the spinner after submit dont stops) try to check the result response with HTTPFox (it shows the correct / incorrect response) – hoping this will be fixed for this weekend.
All solutions can be testet with codejammer.com – a fine javascript solution for running code contests like facebook hacker cup or google code jam.
This is a short coding puzzle with q*bert (who is q*bert?) and an chrismas tree.
The task: Our 2011 q*bert can only jump down. He start from the top and has to find the path to the bottom of the chrismas tree with collecting the most points available (while jumping left-or-right down). Find the way with the highest sum.
Input:
chrismasTree = [[75],
[95,64],
[17,47,82],
[18,35,87,10],
[20, 4,82,47,65],
[19, 1,23,75, 3,34] ]
print qbertRun(chrismasTree)
The sum is 465 – try to solve it with a little program. The brute force method will be possible with this small tree.
Continue reading
By continuing to use the site, you agree to the use of cookies. more information
The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.