15
Last seen 2 years ago
Member for 10 years, 2 months, 20 days
Difficulty Normal
| June 29, 2023, 12:50 p.m. | +5 | Experience for voted solution maelnor: 5 on Math formula-odwl |
| Sept. 20, 2022, 1:23 p.m. | +6 | Experience for voted solution mithilkotak: 4 on Recursive with Generator Expression-odwl |
| Sept. 12, 2022, 9:26 p.m. | +1 | Experience for voted comment mu_py: 1 on odwl: I do agree though that I prefer the equivalent def checkio(n): return bin(n).count('1') to the lamda... |
| Sept. 26, 2021, 8:28 p.m. | +5 | Experience for voted solution 24esun: 3 on Pretty clear-odwl |
| Sept. 21, 2021, 6:24 p.m. | +21 | Experience for voted solution parfenov1976: 4 on Second-odwl |
| May 31, 2021, 2:56 p.m. | +1 | Experience for voted comment dorellaurent: 1 on odwl: Note that str.upper() is your friend here: def is_all_upper(txt): return txt == txt.upper() |
| May 29, 2021, 6:36 a.m. | +24 | Experience for voted solution _Chico__5d82cee4f5234e78a5c65e: 5 on First-odwl |
| May 8, 2021, 7:07 p.m. | +1 | Experience for voted comment hasanibnmansoor: 1 on odwl: Note that str.upper() is your friend here: def is_all_upper(txt): return txt == txt.upper() |
| May 5, 2021, 12:18 a.m. | +6 | Experience for voted solution ku4in: 4 on Second-odwl |
| May 1, 2021, 3:24 a.m. | +20 | Experience for solved mission Completely Empty |
| May 1, 2021, 1:01 a.m. | +15 | Experience for solved mission Halloween Monsters |
| April 30, 2021, 6:47 a.m. | +8 | Experience for solved mission Pattern Recognition |
| April 30, 2021, 2:46 a.m. | +15 | Experience for solved mission Seven Segment |
| April 28, 2021, 1:35 p.m. | +8 | Experience for solved mission Reverse Every Ascending |
| April 28, 2021, 3:35 a.m. | +8 | Experience for solved mission First Word |
| April 25, 2021, 7:12 a.m. | +30 | Experience for solved mission YAML. Complex Structure |
| April 24, 2021, 1:25 p.m. | +8 | Experience for solved mission The Nearest Square Number |
| April 24, 2021, 1:14 p.m. | +20 | Experience for solved mission YAML. List and Comments |
| April 24, 2021, 1:44 a.m. | +5 | Experience for solved mission All Upper I |
| April 23, 2021, 7:56 a.m. | +20 | Experience for solved mission YAML. More Types |
| April 23, 2021, 7:15 a.m. | +15 | Experience for solved mission YAML. Simple Dict |
| April 23, 2021, 6:49 a.m. | +20 | Experience for solved mission Swap Nodes |
| April 22, 2021, 3 a.m. | +5 | Experience for solved mission Univocalic davasaan |
| April 22, 2021, 1:38 a.m. | +8 | Experience for solved mission Multiplication Table |
| April 19, 2021, 9:49 a.m. | +8 | Experience for solved mission Long Non Repeat |
| April 16, 2021, 7:53 a.m. | +30 | Experience for solved mission The Shortest Knight's Path |
| April 13, 2021, 4:58 p.m. | +8 | Experience for solved mission Middle Characters |
| April 13, 2021, 1:23 p.m. | +8 | Experience for solved mission Zigzag Array |
| April 13, 2021, 1:03 p.m. | +8 | Experience for solved mission When is Friday? |
| April 12, 2021, 6:12 a.m. | +8 | Experience for solved mission Sum Consecutives |
| April 11, 2021, 11:09 p.m. | +6 | Experience for voted solution d.s.sidorenkov: 4 on First-odwl |
| April 11, 2021, 9:53 p.m. | +8 | Experience for solved mission The Cheapest Flight |
| April 11, 2021, 9:52 p.m. | +20 | Experience for solved mission Useless Flights |
| April 11, 2021, 9:38 p.m. | +8 | Experience for solved mission Morse Encoder |
| April 11, 2021, 9:33 p.m. | +15 | Experience for solved mission Clock Angle |
| April 11, 2021, 8:42 p.m. | +8 | Experience for solved mission Long Repeat |
| April 11, 2021, 8:33 p.m. | +5 | Experience for solved mission Index Power |
| April 11, 2021, 8:29 p.m. | +5 | Experience for solved mission Replace Last |
| April 11, 2021, 8:23 p.m. | +5 | Experience for solved mission Multiply (Intro) |
| April 9, 2021, 7:32 p.m. | +7 | Experience for voted solution kerimlcr: 5 on First-odwl |
| April 8, 2021, 10:01 a.m. | +2 | Experience for voted comment drill3r92: 1 on odwl: 1. You don't need the [] around the " 2. you can use () to select the words without the quotes 3. th... |
| April 8, 2021, 10:01 a.m. | +5 | Experience for appreciated comment drill3r92: 1 on odwl: 1. You don't need the [] around the " 2. you can use () to select the words without the quotes 3. th... |
| April 7, 2021, 5:39 p.m. | +20 | Experience for solved mission Straight Fight |
| April 7, 2021, 3:53 p.m. | +20 | Experience for solved mission The Healers |
| April 7, 2021, 3:35 p.m. | +20 | Experience for solved mission The Lancers |
| April 7, 2021, 11:23 a.m. | +8 | Experience for solved mission Largest Rectangle in a Histogram |
| April 7, 2021, 11:07 a.m. | +8 | Experience for solved mission Find Quotes |
| April 7, 2021, 8:54 a.m. | +8 | Experience for solved mission The Vampires |
| April 7, 2021, 8:41 a.m. | +15 | Experience for solved mission The Defenders |
| April 7, 2021, 7:28 a.m. | +15 | Experience for solved mission Army Battles |
| April 4, 2021, 12:38 p.m. | +15 | Experience for solved mission The Warriors |
| April 4, 2021, 3:53 a.m. | +5 | Experience for solved mission Easy Unpack |
| April 3, 2021, 6:20 p.m. | +15 | Experience for solved mission Keywords Finder |
| Oct. 4, 2020, 3:12 p.m. | +1 | Experience for voted comment GurvanKervern: 1 on odwl: Not efficient at all |
| Aug. 25, 2020, 6:46 a.m. | +1 | Experience for voted comment stezak96: 1 on odwl: Not efficient at all |
| Aug. 17, 2020, 7:02 p.m. | +1 | Experience for voted comment armandolios: 1 on odwl: Not efficient at all |
| Sept. 17, 2019, 4:46 p.m. | +1 | Experience for voted comment diego.fernandes.aguiar: 1 on odwl: Not efficient at all |
| July 5, 2019, 7:54 p.m. | +1 | Experience for voted comment alitvin: 1 on odwl: Not efficient at all |
| May 23, 2019, 6:49 p.m. | +1 | Experience for voted comment Mario_sk83: 1 on odwl: Not efficient at all |
| March 21, 2019, 4:45 a.m. | +1 | Experience for voted comment PiaFraus: 1 on odwl: Not efficient at all |
| Sept. 30, 2018, 4:50 p.m. | +1 | Experience for voted comment Merzix: 1 on odwl: And could it be possible to add a manual trigger on all solution pages. The user could enter an inpu... |
| Aug. 10, 2018, 3:23 p.m. | +1 | Experience for voted comment pdo: 1 on odwl: Not efficient at all |
| May 10, 2018, 1 p.m. | +1 | Experience for voted comment Robert_Li: 1 on odwl: I was sure you would have found something in l.4:) I do agree with the comment that treating boolean... |
| May 1, 2018, 10:09 a.m. | +1 | Experience for voted comment alexander.gorelyshev: 1 on odwl: Not efficient at all |
| Jan. 6, 2018, 10:36 p.m. | +1 | Experience for voted comment cheshirysh: 1 on odwl: It is unreadable but wow, not even a loop. Did you applied a known math formula? |
| Nov. 23, 2017, 1:46 p.m. | -1 | Experience for voted comment LostxinthexMusic: -1 on odwl: So you mean return bin(number).count() That is the easiest I have seen so far |
| Nov. 23, 2017, 1:45 p.m. | +1 | Experience for voted comment johndrunner: 1 on odwl: I just timed it it: with a long input: checkio(123123123123123453425364748472365263748) on 100000 ru... |
| Nov. 23, 2017, 1:44 p.m. | +1 | Experience for voted comment MatthiasWiesmann: 1 on odwl: You can avoid the histogram with collections.Counter. |
| Nov. 23, 2017, 1:44 p.m. | +5 | Experience for appreciated comment MatthiasWiesmann: 1 on odwl: You can avoid the histogram with collections.Counter. |
| Nov. 23, 2017, 1:43 p.m. | +1 | Experience for voted comment htamas: 1 on odwl: sum(array[-1:] is an interesting way to avoid the empty array. This is probably the shortest readabl... |
| Nov. 23, 2017, 1:43 p.m. | +5 | Experience for appreciated comment htamas: 1 on odwl: sum(array[-1:] is an interesting way to avoid the empty array. This is probably the shortest readabl... |
| Nov. 23, 2017, 1:43 p.m. | +5 | Experience for appreciated comment Gennady: 1 on odwl: You can use endswith Sorting before by len allow you to avoid the len comparison. Note that by sorti... |
| Nov. 23, 2017, 1:43 p.m. | +1 | Experience for voted comment Gennady: 1 on odwl: You can use endswith Sorting before by len allow you to avoid the len comparison. Note that by sorti... |
| Nov. 23, 2017, 1:43 p.m. | +1 | Experience for voted comment MatthiasWiesmann: 1 on odwl: return bin(n ^ m).count('1') This one seems unbeatable no? |
| Nov. 23, 2017, 1:43 p.m. | +5 | Experience for appreciated comment MatthiasWiesmann: 1 on odwl: return bin(n ^ m).count('1') This one seems unbeatable no? |
| Nov. 23, 2017, 1:32 p.m. | +1 | Experience for voted comment Cjkjvfnby: 1 on odwl: So you mean return bin(number).count() That is the easiest I have seen so far |
| Nov. 10, 2017, 11:48 a.m. | +1 | Experience for voted comment snordhausen: 1 on odwl: Not efficient at all |
| Oct. 31, 2017, 5:45 p.m. | +1 | Experience for voted solution lsk45: 1 on Math formula-odwl |
| Oct. 18, 2017, 11:34 a.m. | +1 | Experience for voted comment Vyacheslav: 1 on odwl: Not efficient at all |
| Oct. 10, 2017, 10:36 a.m. | +1 | Experience for voted comment oduvan: 1 on odwl: I just timed it it: with a long input: checkio(123123123123123453425364748472365263748) on 100000 ru... |
| April 30, 2017, 11:42 p.m. | +1 | Experience for voted solution chris.porter.413: 1 on Math formula-odwl |
| April 16, 2017, 6:22 a.m. | +1 | Experience for voted comment GreyGreyman: 1 on odwl: Not efficient at all |
| Jan. 22, 2017, 10:18 p.m. | +1 | Experience for voted comment CamRodriguez: 1 on odwl: I do agree though that I prefer the equivalent def checkio(n): return bin(n).count('1') to the lamda... |
| Jan. 3, 2017, 2:38 p.m. | +2 | Experience for voted solution Danteg23: 2 on Math formula-odwl |
| July 29, 2016, 7:05 p.m. | +4 | Experience for voted solution tivvit: 4 on The simplest ever-odwl |
| July 8, 2016, 7:56 a.m. | +2 | Experience for voted solution tommy6073: 2 on Math formula-odwl |
| May 11, 2016, 7:33 a.m. | -1 | Experience for voted comment jaguhan: -1 on odwl: Not efficient at all |
| Jan. 11, 2016, 9:39 a.m. | +5 | Experience for appreciated comment showmeyourhits: 1 on odwl: I think that list(zip(*matr)) is enough. |
| Jan. 11, 2016, 9:39 a.m. | +1 | Experience for voted comment showmeyourhits: 1 on odwl: I think that list(zip(*matr)) is enough. |
| Dec. 31, 2015, 4:29 a.m. | +2 | Experience for voted solution Nupe: 2 on Math formula-odwl |
| Nov. 5, 2015, 8:32 p.m. | -1 | Experience for voted comment tarjeii: -1 on odwl: Not efficient at all |
| Oct. 29, 2015, 9:46 p.m. | +1 | Experience for voted solution HeyTech: 1 on A simple loop-odwl |
| Oct. 20, 2015, 8:48 a.m. | +1 | Experience for voted solution rainyPaddle: 1 on Math formula-odwl |
| Sept. 14, 2015, 5:43 p.m. | +1 | Experience for voted comment arekrob: 1 on odwl: I do agree though that I prefer the equivalent def checkio(n): return bin(n).count('1') to the lamda... |
| Aug. 30, 2015, 10:29 a.m. | +1 | Experience for voted comment arekrob: 1 on odwl: I was sure you would have found something in l.4:) I do agree with the comment that treating boolean... |
| July 30, 2015, 10:09 a.m. | +1 | Experience for voted solution hoge555: 1 on The simplest ever-odwl |
| April 24, 2015, 10:10 p.m. | +1 | Experience for voted comment tommycarstensen: 1 on odwl: Is that really faster than bin(number).count(1) ? |
| April 24, 2015, 10:03 p.m. | +1 | Experience for voted comment tommycarstensen: 1 on odwl: I do agree though that I prefer the equivalent def checkio(n): return bin(n).count('1') to the lamda... |
| April 16, 2015, 8:35 p.m. | +1 | Experience for voted solution lsk45: 1 on join sorted set intersection-odwl |
| April 11, 2015, 1:15 p.m. | +1 | Experience for voted solution lsk45: 1 on A simple loop-odwl |
