I would really like to see how the Python Solutions that pass comfortably look like. If I understood things correctly, the solutions in this thread which pass just pass barely (with 13 secs out of 15 secs), and the whole question is not so complicated that there is a lot of room for improvement.
I just thought that it might be possible to look for the "h" using binary search, which might speed up things a bit. But then the list in which we are searching has at most 140 entries so it can't make things that much better. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/c02068b6-cf2f-470e-8a9b-6884b91c2404%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
