Jan. 6, 2023, 4:51 p.m. |
+1 |
Experience for voted comment Agrimwood: 1 on Peter.White: \D > [Matches any character which is not a Unicode decimal digit.](https://docs.python.org/3/library... |
June 19, 2022, 12:59 a.m. |
+1 |
Experience for voted solution RickTrager: 1 on Least likely first (lower())-Peter.White |
Jan. 21, 2022, 9:17 p.m. |
+1 |
Experience for voted comment slider.888.slider: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
Jan. 21, 2022, 9:17 p.m. |
+5 |
Experience for appreciated comment slider.888.slider: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
May 31, 2021, 9:45 p.m. |
+1 |
Experience for voted comment leggewie: 1 on Peter.White: If I have to scroll horizontally to read it, it is not clear. -1 for bad style. The approach I like.... |
May 22, 2021, 5:27 p.m. |
+1 |
Experience for voted comment leggewie: 1 on Peter.White: > 3. You can use else statements with for loops. They are executed when the for loop ends naturally ... |
Dec. 10, 2020, 1:19 a.m. |
+1 |
Experience for voted comment koborC: 1 on Peter.White: > 3. You can use else statements with for loops. They are executed when the for loop ends naturally ... |
Aug. 19, 2020, 11:52 p.m. |
-1 |
Experience for voted comment InfinitelyUncertain: -1 on Peter.White: chr(ord(pawn[0])-1)+str(int(pawn[1])-1) What is so hard to understand there? Those are buil-in funct... |
Aug. 8, 2020, 2:26 p.m. |
+1 |
Experience for voted solution Darkalkemy: 1 on Least likely first (lower())-Peter.White |
Jan. 9, 2019, 2:26 p.m. |
-1 |
Experience for voted comment skorski.anthony: -1 on Peter.White: chr(ord(pawn[0])-1)+str(int(pawn[1])-1) What is so hard to understand there? Those are buil-in funct... |
May 4, 2018, 6:35 a.m. |
+1 |
Experience for voted comment alexander.gorelyshev: 1 on Peter.White: If I have to scroll horizontally to read it, it is not clear. -1 for bad style. The approach I like.... |
May 4, 2018, 6:35 a.m. |
+1 |
Experience for voted comment alexander.gorelyshev: 1 on Peter.White: chr(ord(pawn[0])-1)+str(int(pawn[1])-1) What is so hard to understand there? Those are buil-in funct... |
Dec. 24, 2017, 10:25 p.m. |
+2 |
Experience for voted comment Kwentar: 1 on Peter.White: Line 6: __range(len(names_of_rel))__ would be more flexible, in case someone decided to put multi-le... |
Dec. 24, 2017, 10:25 p.m. |
+5 |
Experience for appreciated comment Kwentar: 1 on Peter.White: Line 6: __range(len(names_of_rel))__ would be more flexible, in case someone decided to put multi-le... |
July 19, 2017, 11:06 p.m. |
+1 |
Experience for voted comment Freiling: 1 on Peter.White: chr(ord(pawn[0])-1)+str(int(pawn[1])-1) What is so hard to understand there? Those are buil-in funct... |
July 19, 2017, 10:59 p.m. |
+5 |
Experience for appreciated comment Freiling: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
July 19, 2017, 10:59 p.m. |
+1 |
Experience for voted comment Freiling: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
July 1, 2017, 11:39 p.m. |
+1 |
Experience for voted comment Freiling: 1 on Peter.White: \D > [Matches any character which is not a Unicode decimal digit.](https://docs.python.org/3/library... |
July 1, 2017, 11:39 p.m. |
+1 |
Experience for voted comment Freiling: 1 on Peter.White: I second the question. From prior reading, I am under the impression that regex can be rather slow. ... |
Feb. 15, 2017, 1:07 a.m. |
+5 |
Experience for appreciated comment augustin.pro: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
Feb. 15, 2017, 1:07 a.m. |
+1 |
Experience for voted comment augustin.pro: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
Nov. 23, 2016, 9:39 p.m. |
+2 |
Experience for voted solution Johny9700: 1 on set intersection-Peter.White |
Nov. 20, 2016, 6:25 p.m. |
+7 |
Experience for voted solution rodka81: 1 on First-Peter.White |
Nov. 19, 2016, 2:35 a.m. |
+13 |
Experience for voted solution Thenbacker: 2 on eval and lambda-Peter.White |
Nov. 14, 2016, 11:15 a.m. |
+1 |
Experience for voted comment veky: 1 on Peter.White: > I won’t question your arguments, which are fair in general and, as we all know, can be used to rul... |
Oct. 13, 2016, 8:17 a.m. |
+1 |
Experience for voted comment yourcoke: 1 on Peter.White: Your RE is a bit repetitious. if re.search(r'([a-z]+\s){2}[a-z]+', words, re.IGNORECASE): is shorter... |
Sept. 11, 2016, 11:22 p.m. |
+2 |
Experience for voted solution CMParlett: 2 on Least likely first (lower())-Peter.White |
Jan. 19, 2016, 8:15 a.m. |
+1 |
Experience for voted solution sentenel: 1 on Least likely first (lower())-Peter.White |
Nov. 8, 2015, 8:01 a.m. |
+1 |
Experience for voted comment bryukh: 1 on Peter.White: Great, had a good laugh. |
Nov. 8, 2015, 8:01 a.m. |
+5 |
Experience for appreciated comment bryukh: 1 on Peter.White: Great, had a good laugh. |
Nov. 2, 2015, 2:53 p.m. |
+1 |
Experience for voted solution sajkatav: 1 on Least likely first (lower())-Peter.White |
Oct. 23, 2015, 9:25 p.m. |
+1 |
Experience for voted comment sashok.san: 1 on Peter.White: I don't think, this is particularly speedy. **text.lower()** is called for every letter in the alpha... |
Oct. 10, 2015, 6:38 p.m. |
+5 |
Experience for voted solution vikulin: 4 on Least likely first (lower())-Peter.White |
Sept. 18, 2015, 11:31 a.m. |
+5 |
Experience for appreciated comment fd2fd4ad: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
Sept. 18, 2015, 11:31 a.m. |
+1 |
Experience for voted comment fd2fd4ad: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
Sept. 1, 2015, 2:08 p.m. |
+1 |
Experience for voted comment zellily: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
Sept. 1, 2015, 2:08 p.m. |
+5 |
Experience for appreciated comment zellily: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
July 22, 2015, 11:47 p.m. |
+11 |
Experience for voted solution slevvio_8409ee3847064def837dc7: 3 on Sets-Peter.White |
July 20, 2015, 7 p.m. |
+2 |
Experience for voted solution philippeabraham: 1 on Speedy?-Peter.White |
July 9, 2015, 5:41 a.m. |
+4 |
Experience for voted solution siebenschlaefer: 2 on sorted([foo], key=func)-Peter.White |
May 25, 2015, 8:54 a.m. |
+5 |
Experience for appreciated comment oduvan: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
May 25, 2015, 8:54 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
May 12, 2015, 9:48 a.m. |
+2 |
Experience for voted solution lancelote: 1 on dictionary-Peter.White |
April 21, 2015, 3 p.m. |
+5 |
Experience for appreciated comment veky: 1 on Peter.White: > Lambda is (delayed) expression with holes. Ahh, now I get it. Now I have a mental image I can work... |
April 21, 2015, 3 p.m. |
+1 |
Experience for voted comment veky: 1 on Peter.White: > Lambda is (delayed) expression with holes. Ahh, now I get it. Now I have a mental image I can work... |
April 20, 2015, 7:44 p.m. |
+13 |
Experience for voted solution abaskm: 2 on Sets-Peter.White |
April 19, 2015, 5:02 p.m. |
+3 |
Experience for voted solution lukasso: 1 on List magic (cleaned)-Peter.White |
April 19, 2015, 10:50 a.m. |
+2 |
Experience for voted comment Arandomusername: 1 on Peter.White: Not very speedy. You are iterating over the whole text, which by definition must be at least as long... |
April 19, 2015, 10:50 a.m. |
+5 |
Experience for appreciated comment Arandomusername: 1 on Peter.White: Not very speedy. You are iterating over the whole text, which by definition must be at least as long... |
April 18, 2015, 10:12 p.m. |
+5 |
Experience for appreciated comment suic: 1 on Peter.White: Not very speedy. You are iterating over the whole text, which by definition must be at least as long... |
April 18, 2015, 10:12 p.m. |
+2 |
Experience for voted comment suic: 1 on Peter.White: Not very speedy. You are iterating over the whole text, which by definition must be at least as long... |
April 17, 2015, 6:12 p.m. |
+2 |
Experience for voted solution f-osorio: 1 on Dictionary of numbers-Peter.White |
April 15, 2015, 4:34 p.m. |
+7 |
Experience for voted solution Arandomusername: 1 on Sets (more efficient, cleaned)-Peter.White |
April 14, 2015, 7:30 p.m. |
+2 |
Experience for voted solution james.shade.3760: 1 on Speedy?-Peter.White |
April 13, 2015, 8:47 p.m. |
+2 |
Experience for voted comment SolDip: 1 on Peter.White: You can contract lines 3 and 4 to: return int(str_number,radix) |
April 13, 2015, 8:05 p.m. |
+2 |
Experience for voted solution lsk45: 1 on Least likely first (lower())-Peter.White |
April 11, 2015, 1:15 p.m. |
+2 |
Experience for voted solution lsk45: 1 on only 1st hit counts-Peter.White |
April 11, 2015, 10:29 a.m. |
+7 |
Experience for voted solution lsk45: 1 on isupper-Peter.White |
April 11, 2015, 7:54 a.m. |
+2 |
Experience for voted solution lsk45: 1 on First-Peter.White |
April 7, 2015, 8:45 p.m. |
+15 |
Experience for solved mission Roman Numerals |
April 7, 2015, 2:27 p.m. |
+8 |
Experience for solved mission Feed Pigeons |
April 6, 2015, 6:52 p.m. |
+15 |
Experience for solved mission How to Find Friends |
April 6, 2015, 3:01 a.m. |
+2 |
Experience for voted comment makernaren: 1 on Peter.White: Oh dear! There is not a single iteration in there. I hope your fingers hurt after typing that. ;) |
April 6, 2015, 3:01 a.m. |
+5 |
Experience for appreciated comment makernaren: 1 on Peter.White: Oh dear! There is not a single iteration in there. I hope your fingers hurt after typing that. ;) |
April 5, 2015, 2 p.m. |
+4 |
Experience for voted solution bartouv: 1 on List magic (cleaned)-Peter.White |
April 3, 2015, 5:02 a.m. |
+5 |
Experience for appreciated comment veky: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
April 3, 2015, 5:02 a.m. |
+1 |
Experience for voted comment veky: 1 on Peter.White: How do you not get headaches when writing something like this? I get them just from _reading_ it. ;) |
April 3, 2015, 4:36 a.m. |
+5 |
Experience for appreciated comment veky: 1 on Peter.White: Too late, I have looked. ;) I think I never would have guessed that, but I see how it works now. I a... |
April 3, 2015, 4:36 a.m. |
+1 |
Experience for voted comment veky: 1 on Peter.White: Too late, I have looked. ;) I think I never would have guessed that, but I see how it works now. I a... |
April 3, 2015, 2:39 a.m. |
+1 |
Experience for voted comment panaro32: 1 on Peter.White: And maybe do away with the 'XXX' and 'OOO'. If it weren't for these that code would still run with a... |
April 3, 2015, 2:39 a.m. |
+5 |
Experience for appreciated comment panaro32: 1 on Peter.White: And maybe do away with the 'XXX' and 'OOO'. If it weren't for these that code would still run with a... |
April 2, 2015, 11:42 p.m. |
+2 |
Experience for voted solution antimarvin: 1 on First-Peter.White |
April 2, 2015, 6:16 p.m. |
+1 |
Experience for voted comment veky: 1 on Peter.White: Lol, I also had the idea to use a dictionary and enumeration. But somehow it didn't cross my mind to... |
April 2, 2015, 6:16 p.m. |
+5 |
Experience for appreciated comment veky: 1 on Peter.White: Lol, I also had the idea to use a dictionary and enumeration. But somehow it didn't cross my mind to... |
April 2, 2015, 5:33 p.m. |
+15 |
Experience for solved mission Pawn Brotherhood |
April 2, 2015, 4:43 p.m. |
+20 |
Experience for solved mission The Flat Dictionary |
April 1, 2015, 10:32 p.m. |
+8 |
Experience for solved mission Speech Module |
April 1, 2015, 8:37 p.m. |
+5 |
Experience for appreciated comment lukas.linhart: 1 on Peter.White: Nice approach. But it took me a while to grasp what's happening. I'd say that makes it a little less... |
April 1, 2015, 8:37 p.m. |
+2 |
Experience for voted comment lukas.linhart: 1 on Peter.White: Nice approach. But it took me a while to grasp what's happening. I'd say that makes it a little less... |
March 31, 2015, 2:01 p.m. |
+5 |
Experience for appreciated comment bryukh: 1 on Peter.White: What the...? ;) Just great. Wish I had thought of that. |
March 31, 2015, 2:01 p.m. |
+1 |
Experience for voted comment bryukh: 1 on Peter.White: What the...? ;) Just great. Wish I had thought of that. |
March 31, 2015, 1:08 p.m. |
+12 |
Experience for solved mission Xs and Os Referee |
March 31, 2015, 8:13 a.m. |
+8 |
Experience for solved mission The Most Wanted Letter |
March 30, 2015, 7:39 p.m. |
+5 |
Experience for appreciated comment denisbalyko: 1 on Peter.White: I like the **union** idea. But your list is waste of space, when there are duplicate connections in ... |
March 30, 2015, 7:39 p.m. |
+2 |
Experience for voted comment denisbalyko: 1 on Peter.White: I like the **union** idea. But your list is waste of space, when there are duplicate connections in ... |
March 30, 2015, 1:24 p.m. |
+8 |
Experience for solved mission Moore Neighbourhood |
March 30, 2015, 12:30 p.m. |
+2 |
Experience for voted comment fantakeshi: 1 on Peter.White: Could have just used the built-in abs() instead of importing fabs from math. ;) |
March 30, 2015, 12:30 p.m. |
+5 |
Experience for appreciated comment fantakeshi: 1 on Peter.White: Could have just used the built-in abs() instead of importing fabs from math. ;) |
March 30, 2015, 11:06 a.m. |
+15 |
Experience for solved mission Friends |
March 29, 2015, 5:44 p.m. |
+15 |
Experience for solved mission Building Base |
March 29, 2015, 5:20 p.m. |
+5 |
Experience for solved mission Absolute Sorting |
March 29, 2015, 4:12 p.m. |
+8 |
Experience for solved mission Common Words |
March 29, 2015, 3:07 p.m. |
+15 |
Experience for solved mission Number Base |
March 29, 2015, 2:02 p.m. |
+8 |
Experience for solved mission Binary Count |
March 29, 2015, 9:54 a.m. |
+8 |
Experience for solved mission Pangram |
March 28, 2015, 7:10 p.m. |
+5 |
Experience for solved mission Days Between |
March 28, 2015, 3:21 p.m. |
+5 |
Experience for solved mission The End of Other |
March 27, 2015, 8:37 p.m. |
+8 |
Experience for solved mission Count Inversions |
March 27, 2015, 6:07 p.m. |
+8 |
Experience for solved mission Digits Multiplication |
March 27, 2015, 4:59 p.m. |
+5 |
Experience for solved mission Right to Left |