challenges

my solutions to various "programming challenge" problems
git clone https://wehaveforgeathome.hates.computer/challenges.git
Log | Files | Refs | LICENSE

README.md (2271B)


      1     Source: http://challenge.greplin.com/
      2 
      3     The Greplin Programming Challenge
      4 
      5     So it begins...
      6 
      7     ----------------------------------------
      8 
      9     Welcome to the Greplin Programming Challenge.  You should try to complete all
     10     three levels in a single sitting.  It should take anywhere from 20 minutes to
     11     2 hours.
     12 
     13     Level 1
     14 
     15     ----------------------------------------
     16 
     17     Embedded in this block of text is the password for level 2.
     18     The password is the longest substring that is the same in reverse.
     19 
     20     As an example, if the input was "I like racecars that go fast"
     21     the password would be "racecar".
     22 
     23     Level 2
     24 
     25     ----------------------------------------
     26 
     27     Congratulations.  You have reached level 2.
     28 
     29     To get the password for level 3, write code to find the first prime
     30     fibonacci number larger than a given minimum.  For example, the first
     31     prime fibonacci number larger than 10 is 13.
     32 
     33     Step 1. Use your code to compute the smallest prime fibonacci number
     34     greater than 227,000.  Call this number X.
     35 
     36     Step 2. The password for level 3 is the sum of prime divisors of X + 1.
     37 
     38     For the second portion of this task, note that for the number 12 we consider the
     39     sum of the prime divisors to be 2 + 3 = 5.  We do not include 2 twice even
     40     though it divides 12 twice.
     41 
     42     Level 3
     43 
     44     ----------------------------------------
     45 
     46     Congratulations.  You have reached the final level.
     47 
     48     For the final task, you must find all subsets of an array
     49     where the largest number is the sum of the remaining numbers.
     50     For example, for an input of:
     51 
     52     (1, 2, 3, 4, 6)
     53 
     54     the subsets would be
     55 
     56     1 + 2 = 3
     57     1 + 3 = 4
     58     2 + 4 = 6
     59     1 + 2 + 3 = 6
     60 
     61     Here is the list of numbers you should run your code on.
     62     The password is the number of subsets.  In the above case the
     63     answer would be 4.
     64 
     65     The End
     66 
     67     ----------------------------------------
     68 
     69     Congratulations.  You completed the challenge.  Your completion code is.
     70 
     71     We'd love to talk to you - send your completion code, the code you wrote
     72     during the challenge, and your resume to
     73 
     74     jobs+i+solved+the+challenge@greplin.com
     75 
     76     Even if you're not looking for a job, we'd love to hear what you thought
     77     about the challenge.