Conversation

Notices

1. La Fée Verte (absinthe@qoto.org)'s status on Monday, 04-Nov-2019 04:47:28 UTC La Fée Verte

   okay, this is not exactly a #toyprogrammingchallenge but I hope you hate this problem as much as I did...

   The problem is not just getting the right solution, but getting it in under the running timeout of 12000 ms. Good luck.

   https://www.codewars.com/kata/54d81488b981293527000c8f

   • 🎓 Dr. Freemo :jpf: 🇳🇱 repeated this.
   • 🎓 Dr. Freemo :jpf: 🇳🇱 (freemo@qoto.org)'s status on Monday, 04-Nov-2019 07:41:15 UTC 🎓 Dr. Freemo :jpf: 🇳🇱

     in reply to

     @Absinthe getting it under 12 seconds if the list is small is trivial, doing it on large enough lists might get tricky but to make the challenge useful youd have to specify the list of numbers that must be worked in under 12 seconds.

     Obviously this also assume we all do the task on relatively similarly powered computers.

   • 🎓 Dr. Freemo :jpf: 🇳🇱 (freemo@qoto.org)'s status on Monday, 04-Nov-2019 08:23:18 UTC 🎓 Dr. Freemo :jpf: 🇳🇱

     in reply to

     @Absinthe Im similarly confused by the wording.. in the following example whats the answer:

     [1,2,5,8,9,10,11,12,13,6] sum: 7

     I guess 1,6 it only counts the left most?

   • 🎓 Dr. Freemo :jpf: 🇳🇱 (freemo@qoto.org)'s status on Monday, 04-Nov-2019 18:53:49 UTC 🎓 Dr. Freemo :jpf: 🇳🇱

     @Absinthe hmm interesting

   • 🎓 Dr. Freemo :jpf: 🇳🇱 (freemo@qoto.org)'s status on Tuesday, 05-Nov-2019 06:27:21 UTC 🎓 Dr. Freemo :jpf: 🇳🇱

     @Absinthe Yea not knowing how to optimize in this case is just not enough info IMO

   • 🎓 Dr. Freemo :jpf: 🇳🇱 (freemo@qoto.org)'s status on Tuesday, 05-Nov-2019 15:47:11 UTC 🎓 Dr. Freemo :jpf: 🇳🇱

     @Absinthe Oh I already speculated a solution (and a few other tweaks). Just too bust to try it out. In the middle of writing a specification and trying to learn bikeshed at the same time