Dec. 17, 2018, 9:34 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: Well, new traceback I don't understand. |
Dec. 17, 2018, 8:01 a.m. |
+5 |
Experience for appreciated comment raDom: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 17, 2018, 8:01 a.m. |
+1 |
Experience for voted comment raDom: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 16, 2018, 4:27 p.m. |
+4 |
Experience for voted solution svisho1983: 1 on v2: using slicing, sets, generator and translation of punctuation =)-Phil15 |
Dec. 16, 2018, 3:48 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: Well, "new" mission solved. :-) checkio = lambda n: 2 * old_checkio(n) if n else float('infinity') I... |
Dec. 15, 2018, 4:29 p.m. |
+2 |
Experience for voted solution alanj.harris14: 2 on two solutions-Phil15 |
Dec. 15, 2018, 2:24 p.m. |
+1 |
Experience for voted comment Morph: 1 on Phil15: def checkio(words: str) -> bool: count = 0 wordlist = words.split() for word in wordlist: if word.is... |
Dec. 15, 2018, 2:24 p.m. |
+5 |
Experience for appreciated comment Morph: 1 on Phil15: def checkio(words: str) -> bool: count = 0 wordlist = words.split() for word in wordlist: if word.is... |
Dec. 15, 2018, 11:55 a.m. |
+1 |
Experience for voted comment colinmcnicholl: 1 on Phil15: There is also the "comprehension thing": n for start, stop in items for n in range(start, stop + 1) |
Dec. 15, 2018, 11:55 a.m. |
+5 |
Experience for appreciated comment colinmcnicholl: 1 on Phil15: There is also the "comprehension thing": n for start, stop in items for n in range(start, stop + 1) |
Dec. 15, 2018, 11:37 a.m. |
+5 |
Experience for appreciated comment colinmcnicholl: 1 on Phil15: I started to think I would not see `list.extend(range(...))`. But you can unpack tuples from items b... |
Dec. 15, 2018, 11:37 a.m. |
+2 |
Experience for voted comment colinmcnicholl: 1 on Phil15: I started to think I would not see `list.extend(range(...))`. But you can unpack tuples from items b... |
Dec. 15, 2018, 7:30 a.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 15, 2018, 7:30 a.m. |
+5 |
Experience for appreciated comment Merzix: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 14, 2018, 9:49 p.m. |
+2 |
Experience for voted solution Pavel_Osipenko: 1 on 1-liner: join and replace-Phil15 |
Dec. 14, 2018, 9:24 a.m. |
+5 |
Experience for voted solution eugene100372: 2 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Dec. 14, 2018, 7:25 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: "lol" appears then 1 (no matter how many times it appears) "olo" appears then 1 total of given words... |
Dec. 13, 2018, 4:15 a.m. |
+5 |
Experience for appreciated comment veky: 1 on Phil15: Yeah, I saw it. I'm happy you didn't tell me to make it with `functools.partial` at first because I ... |
Dec. 13, 2018, 4:15 a.m. |
+1 |
Experience for voted comment veky: 1 on Phil15: Yeah, I saw it. I'm happy you didn't tell me to make it with `functools.partial` at first because I ... |
Dec. 13, 2018, 4:15 a.m. |
+5 |
Experience for appreciated comment veky: 1 on Phil15: It's about "composition of functions" so I don't see how to solve it (no matter how partial is aweso... |
Dec. 13, 2018, 4:15 a.m. |
+1 |
Experience for voted comment veky: 1 on Phil15: It's about "composition of functions" so I don't see how to solve it (no matter how partial is aweso... |
Dec. 12, 2018, 6:12 p.m. |
+8 |
Experience for voted solution fed.kz: 2 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Dec. 12, 2018, 3:22 p.m. |
+3 |
Experience for voted solution vmiimu: 3 on yield from reversed(ascending list)-Phil15 |
Dec. 12, 2018, 12:43 p.m. |
+5 |
Experience for appreciated comment Sillte: 1 on Phil15: Just `median` is also ok :-) |
Dec. 12, 2018, 12:43 p.m. |
+2 |
Experience for voted comment Sillte: 1 on Phil15: Just `median` is also ok :-) |
Dec. 12, 2018, 10:22 a.m. |
+15 |
Experience for solved mission Expand Intervals |
Dec. 12, 2018, 9:36 a.m. |
+8 |
Experience for solved mission Caps Lock |
Dec. 12, 2018, 9:14 a.m. |
+15 |
Experience for solved mission Can Balance |
Dec. 11, 2018, 9:19 p.m. |
+2 |
Experience for voted comment suic: 1 on Phil15: I did use yield from too but I prefered `yield from reversed(run)` to slicing making a copy. I quibb... |
Dec. 11, 2018, 9:19 p.m. |
+5 |
Experience for appreciated comment suic: 1 on Phil15: I did use yield from too but I prefered `yield from reversed(run)` to slicing making a copy. I quibb... |
Dec. 11, 2018, 1:55 p.m. |
+21 |
Experience for voted solution vit.aborigen: 4 on [200th mission] DFS and great neighbors function-Phil15 |
Dec. 11, 2018, 10:20 a.m. |
+3 |
Experience for voted solution jtowler: 3 on morse_decoder lambda function-Phil15 |
Dec. 11, 2018, 8:58 a.m. |
+1 |
Experience for voted comment tigerhu3180: 1 on Phil15: It's not mistakes but I like pythonic things. If I summarize: * dict method `.keys()` is nearly usel... |
Dec. 11, 2018, 8:58 a.m. |
+5 |
Experience for appreciated comment tigerhu3180: 1 on Phil15: It's not mistakes but I like pythonic things. If I summarize: * dict method `.keys()` is nearly usel... |
Dec. 11, 2018, 6:11 a.m. |
-2 |
Experience for voted solution timetraveler_0: -1 on two solutions-Phil15 |
Dec. 10, 2018, 10:05 p.m. |
+1 |
Experience for voted solution redlumek: 1 on lambda d: max(d, key=d.get)-Phil15 |
Dec. 10, 2018, 8:58 p.m. |
+4 |
Experience for voted solution antth: 2 on lambda with counter.most_common-Phil15 |
Dec. 10, 2018, 5:54 p.m. |
+2 |
Experience for voted solution zamberg42: 1 on lambda reduce mul-Phil15 |
Dec. 10, 2018, 11:34 a.m. |
+13 |
Experience for voted solution yoichi: 2 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Dec. 10, 2018, 7:23 a.m. |
+13 |
Experience for voted solution przemyslaw.daniel: 2 on [4th version] fast (and limited memory)-Phil15 |
Dec. 10, 2018, 3:44 a.m. |
+1 |
Experience for voted comment tigerhu3180: 1 on Phil15: I didn't have any issue with these functions. Usually, I write # just after imports MOVES = (-1, 0),... |
Dec. 10, 2018, 3:44 a.m. |
+1 |
Experience for voted comment tigerhu3180: 1 on Phil15: Almost all my neighbors functions are written this way (with some adaptation according to the situat... |
Dec. 10, 2018, 1:46 a.m. |
+1 |
Experience for voted solution chunshar: 1 on Try to remove from deck with sorted hand-Phil15 |
Dec. 9, 2018, 8:40 a.m. |
+4 |
Experience for voted solution fed.kz: 1 on v2 (from flpo veky and myself): Party(Named, set), Friends(str) with lambda show_invite-Phil15 |
Dec. 9, 2018, 6:35 a.m. |
+1 |
Experience for voted comment veky: 1 on Phil15: I already have homework you know. I did backtracking for magic dominoes (this one take me a while...... |
Dec. 9, 2018, 6:35 a.m. |
+5 |
Experience for appreciated comment veky: 1 on Phil15: I already have homework you know. I did backtracking for magic dominoes (this one take me a while...... |
Dec. 8, 2018, 8:45 p.m. |
+5 |
Experience for voted solution TheShu: 4 on 1-liner: itertools.groupby-Phil15 |
Dec. 8, 2018, 5:30 p.m. |
+20 |
Experience for solved mission Crossword Solver |
Dec. 8, 2018, 1 p.m. |
+15 |
Experience for solved mission Sudoku Solver |
Dec. 8, 2018, 11 a.m. |
+6 |
Experience for voted solution nickgryg: 1 on With Ngone class-Phil15 |
Dec. 8, 2018, 10:08 a.m. |
+1 |
Experience for voted comment fokusd: 1 on Phil15: I totally understand since it's your first yield thing. I use `yield` much more than `yield from` bu... |
Dec. 8, 2018, 10:08 a.m. |
+5 |
Experience for appreciated comment fokusd: 1 on Phil15: I totally understand since it's your first yield thing. I use `yield` much more than `yield from` bu... |
Dec. 8, 2018, 7:34 a.m. |
+2 |
Experience for voted comment fokusd: 1 on Phil15: Like it!! Probably because it's nearly mine and I already like it. Three comments * Good name `stack... |
Dec. 8, 2018, 7:34 a.m. |
+5 |
Experience for appreciated comment fokusd: 1 on Phil15: Like it!! Probably because it's nearly mine and I already like it. Three comments * Good name `stack... |
Dec. 8, 2018, 4:41 a.m. |
+5 |
Experience for appreciated comment veky: 1 on Phil15: I did use yield from too but I prefered `yield from reversed(run)` to slicing making a copy. I quibb... |
Dec. 8, 2018, 4:41 a.m. |
+2 |
Experience for voted comment veky: 1 on Phil15: I did use yield from too but I prefered `yield from reversed(run)` to slicing making a copy. I quibb... |
Dec. 8, 2018, 12:07 a.m. |
+2 |
Experience for voted solution yoichi: 2 on yield from reversed(ascending list)-Phil15 |
Dec. 7, 2018, 7:46 p.m. |
+4 |
Experience for voted solution quarkov: 2 on yield from reversed(ascending list)-Phil15 |
Dec. 7, 2018, 6:23 p.m. |
+2 |
Experience for voted solution BrianMcleod: 1 on 1-liner: itertools.groupby-Phil15 |
Dec. 7, 2018, 6:16 p.m. |
+2 |
Experience for voted solution BrianMcleod: 1 on Basic loop-Phil15 |
Dec. 7, 2018, 6:12 p.m. |
+2 |
Experience for voted solution BrianMcleod: 1 on 3-lines: zips and slices-Phil15 |
Dec. 7, 2018, 2:12 p.m. |
+20 |
Experience for solved mission Magic Domino |
Dec. 6, 2018, 8:51 a.m. |
+3 |
Experience for voted solution Leno4ka: 2 on First-Phil15 |
Dec. 6, 2018, 5:18 a.m. |
+8 |
Experience for voted solution timothy.nilsson: 2 on DFS on colored network graph without crashed nodes-Phil15 |
Dec. 5, 2018, 8:27 p.m. |
+2 |
Experience for voted solution belokr: 1 on First-Phil15 |
Dec. 5, 2018, 1:52 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: Personally, I only need hashable elements. |
Dec. 5, 2018, 1:52 p.m. |
+5 |
Experience for appreciated comment Merzix: 1 on Phil15: Personally, I only need hashable elements. |
Dec. 5, 2018, 1:48 p.m. |
+5 |
Experience for appreciated comment oduvan: 1 on Phil15: Personally, I only need hashable elements. |
Dec. 5, 2018, 1:48 p.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: Personally, I only need hashable elements. |
Dec. 5, 2018, 1:31 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: You can write `set1 & set2` instead of `set1.intersection(set2)` if you want, it's the same thing. |
Dec. 5, 2018, 1 p.m. |
+8 |
Experience for solved mission Reverse Every Ascending |
Dec. 5, 2018, 11:35 a.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: Maybe you should delete the message with the code of a solution. I won't read it I promise. |
Dec. 5, 2018, 9:09 a.m. |
+1 |
Experience for voted comment vit.aborigen: 1 on Phil15: I suppose `[['bob', 'bob', 'carl', 'alex', 'bob']]` input should be `['bob', 'bob', 'carl', 'alex', ... |
Dec. 5, 2018, 8:32 a.m. |
+15 |
Experience for solved mission Count Consecutive Summers |
Dec. 5, 2018, 8:19 a.m. |
+8 |
Experience for solved mission Sort Array by Element Frequency |
Dec. 4, 2018, 8:51 p.m. |
+29 |
Experience for voted solution vit.aborigen: 4 on 8-liner: Even-odd rule with origin point simplifications-Phil15 |
Dec. 4, 2018, 9:22 a.m. |
+1 |
Experience for voted solution Lemmi: 1 on lambda next zip-Phil15 |
Dec. 3, 2018, 6:05 p.m. |
-4 |
Experience for voted solution BleX: -2 on Sets of friends-Phil15 |
Dec. 2, 2018, 4:18 p.m. |
+15 |
Experience for solved mission Auto Painting |
Dec. 2, 2018, 1:39 p.m. |
+30 |
Experience for solved mission Cipher Crossword |
Dec. 2, 2018, 11:19 a.m. |
+14 |
Experience for voted solution niilz: 3 on My "flat dictionary" program-Phil15 |
Dec. 2, 2018, 10:29 a.m. |
+18 |
Experience for voted solution fed.kz: 2 on BFS-Phil15 |
Dec. 2, 2018, 9:38 a.m. |
+2 |
Experience for voted solution vilenka06: 1 on two solutions-Phil15 |
Dec. 2, 2018, 5:22 a.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: We are all ready to help people here but we need a few things. The first of all is to tag your post ... |
Dec. 1, 2018, 3:12 p.m. |
+20 |
Experience for solved mission The Lantern Festival |
Dec. 1, 2018, 9:44 a.m. |
+8 |
Experience for solved mission Parity Bit Generator |
Dec. 1, 2018, 9:21 a.m. |
+5 |
Experience for solved mission Multiply (Intro) |
Dec. 1, 2018, 7:15 a.m. |
+2 |
Experience for voted solution veky: 2 on 1-liner: quick naming and weird slicing-Phil15 |
Nov. 30, 2018, 9:06 p.m. |
+15 |
Experience for solved mission Unfair Districts |
Nov. 30, 2018, 8:50 p.m. |
+10 |
Experience for voted solution BrianMcleod: 2 on union set of intervals, zip for union, enumerate(op, 1)-Phil15 |
Nov. 30, 2018, 8:27 p.m. |
+5 |
Experience for appreciated comment BrianMcleod: 1 on Phil15: About `next`, I don't have code to show you. And considering you are new to generators, I was a bit ... |
Nov. 30, 2018, 8:27 p.m. |
+1 |
Experience for voted comment BrianMcleod: 1 on Phil15: About `next`, I don't have code to show you. And considering you are new to generators, I was a bit ... |
Nov. 30, 2018, 4:03 p.m. |
+1 |
Experience for voted comment BrianMcleod: 1 on Phil15: First, **congratulations on making your first generator!** I think you understand how this works now... |
Nov. 30, 2018, 4:03 p.m. |
+5 |
Experience for appreciated comment BrianMcleod: 1 on Phil15: First, **congratulations on making your first generator!** I think you understand how this works now... |
Nov. 30, 2018, 3:23 p.m. |
+7 |
Experience for voted solution fokusd: 1 on union set of intervals, zip for union, enumerate(op, 1)-Phil15 |
Nov. 30, 2018, 3:05 p.m. |
+20 |
Experience for solved mission Painting Wall |
Nov. 30, 2018, 2:01 p.m. |
+5 |
Experience for appreciated comment Merzix: 1 on Phil15: Well here, use a key for sorting here is complicated. You have two things a and b and want to know i... |
Nov. 30, 2018, 2:01 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: Well here, use a key for sorting here is complicated. You have two things a and b and want to know i... |
Nov. 30, 2018, 1:21 p.m. |
+5 |
Experience for appreciated comment fed.kz: 1 on Phil15: Well here, use a key for sorting here is complicated. You have two things a and b and want to know i... |
Nov. 30, 2018, 1:21 p.m. |
+1 |
Experience for voted comment fed.kz: 1 on Phil15: Well here, use a key for sorting here is complicated. You have two things a and b and want to know i... |