Alien Language, Watersheds and Welcome to Code Jam - Qualification Round 2009 solutions | Code Jam Daemon



Alien Language, Watersheds and Welcome to Code Jam - Qualification Round 2009 solutions | Code Jam Daemon

Next in the choice problem list in Practice and Learn is Code Jam 2008, Round 1A: Minimum Scalar Product, that we skip since the problem itself is a bit too easy and the whole round is a bit too hard for now. So let's go to Google Code Jam 2009, Qualification Round.

First off, in this qualification round you only need to "score at least 33 points to advance to round 1" as you can read above the scoreboard. This means that all you need is to solve small and large inputs of just one problem. Now start the timer and go practice. Hopefully it'll take less than the 24 hour allowed for the round!

As this is a qualification round the problems are relatively simple, but they are a good opportunity to learn a few useful think and code patterns.

Alien Language

Alien Language is a pretty straightforward pattern matching problem. The brute force is clearly out of questions as it scales with 26 ^ D and the limit for D is 5000. There are a number of clever data structures and algorithms that good programmers could employ to reduce the complexity, but one of the advantage of using a high level language in a coding competition is that you have tons of high level libraries and you can happily cheat in cases like this one. Let's harness the power of the python re module.

Read full article from Alien Language, Watersheds and Welcome to Code Jam - Qualification Round 2009 solutions | Code Jam Daemon


No comments:

Post a Comment

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts