MBM_1607 profile - python coding challenges

MBM_1607

[Follow]

● 4 ● 21 ● 39

2676/ 2695

Muhammad Khan

Last seen 1 year ago

Member for 6 years, 5 months, 7 days

Difficulty Normal

Programming and History enthusiast

Jan. 17, 2023, 4:36 p.m.	+ 1	for Comment lisovsky: Nice solution! Nothing to add!
Aug. 17, 2022, 6:06 a.m.	+ 1	for Comment MuragnarokStaff: Very concise and to the point 👍
July 28, 2022, 11:34 a.m.	+ 1	for Task The Final Stone
Feb. 2, 2021, 3:37 p.m.	+ 1	for Comment pandektis: Good job
Sept. 8, 2020, 7:53 p.m.	+ 1	for Task Next Birthday
Sept. 8, 2020, 7:51 p.m.	+ 1	for Task Correct Sentence
Sept. 7, 2020, 5:42 p.m.	+ 1	for Task Weekly Calendar
Aug. 16, 2020, 11:24 a.m.	+ 1	for Task Non Empty Lines
June 6, 2020, 11:04 a.m.	+ 1	for Task Sort by Removing
April 11, 2020, 2:22 a.m.	+ 1	for Task The Flat Dictionary
April 11, 2020, 2:11 a.m.	+ 1	for Task Frequency Sorting
April 11, 2020, 2:03 a.m.	+ 1	for Task Index Power
April 11, 2020, 2:02 a.m.	+ 1	for Task Remove All After
April 11, 2020, 1:57 a.m.	+ 1	for Task Replace Last
April 8, 2020, 3:30 p.m.	+ 5	for 6-liner: Generator, divmod, list.pop, math.factorial-Phil15
April 8, 2020, 1:54 p.m.	+ 5	for If I had a hammer...-veky
April 8, 2020, 1:52 p.m.	+ 5	for fromisoformat (with python 3.7)-Phil15
April 7, 2020, 8:59 p.m.	+ 1	for Task Between Markers
April 7, 2020, 5:34 p.m.	+ 1	for Task The First Working Day
April 7, 2020, 4:24 p.m.	+ 1	for Task Count Chains
April 5, 2020, 10:40 a.m.	+ 1	for Comment veky: You don't need those backslashes (except the last one, unless you add another pair of parentheses), ...
April 4, 2020, 5 a.m.	+ 1	for Task Zigzag Array
April 4, 2020, 4:55 a.m.	+ 5	for [v3] 1-liner: count odd divisors (the naive way)-Phil15
April 3, 2020, 8:33 a.m.	+ 1	for Task Network Loops
April 3, 2020, 1:44 a.m.	+ 1	for Task Count Consecutive Summers
March 21, 2020, 2:07 p.m.	+ 1	for Task Word Pattern
March 21, 2020, 1:59 p.m.	+ 1	for Task Reverse Every Ascending
March 20, 2020, 6:46 a.m.	+ 1	for Task Expand Intervals
March 20, 2020, 6:45 a.m.	+ 1	for Task Backward Each Word
March 20, 2020, 6:06 a.m.	+ 1	for Task How Deep
March 20, 2020, 6:05 a.m.	+ 1	for Task End Zeros
March 20, 2020, 6:03 a.m.	+ 1	for Task Acceptable Password VI
March 20, 2020, 5:55 a.m.	+ 1	for Task Acceptable Password V
March 20, 2020, 5:51 a.m.	+ 1	for Task Acceptable Password IV
March 20, 2020, 5:49 a.m.	+ 1	for Task Acceptable Password III
March 20, 2020, 5:44 a.m.	+ 1	for Task Acceptable Password II
March 20, 2020, 5:40 a.m.	+ 1	for Task Acceptable Password I
March 20, 2020, 5:39 a.m.	+ 1	for Task Sum by Type
March 20, 2020, 5:22 a.m.	+ 1	for Task Sum Consecutives
March 20, 2020, 5:22 a.m.	+ 1	for Task Backward String
March 20, 2020, 5:21 a.m.	+ 1	for Comment RobertCocking: Very neat!
March 16, 2020, 7:02 a.m.	+ 1	for Task Robot Sort
March 16, 2020, 6:09 a.m.	+ 1	for Task Restricted Sum
March 16, 2020, 5:41 a.m.	+ 1	for Task The Good Radix
March 13, 2020, 2:51 p.m.	+ 1	for Task Goes Right After
March 12, 2020, 1:46 p.m.	+ 1	for Task All Upper II
March 11, 2020, 7:21 a.m.	+ 1	for Task Days Between
March 11, 2020, 7:19 a.m.	+ 1	for Task Skew-symmetric Matrix
March 9, 2020, 1:39 p.m.	+ 1	for First-Tinus_Trotyl
March 9, 2020, 1:35 p.m.	+ 1	for Task Non-unique Elements
March 6, 2020, 11:20 a.m.	+ 1	for Task All Upper I
March 6, 2020, 11:20 a.m.	+ 1	for Task Beginning Zeros
March 6, 2020, 11:20 a.m.	+ 1	for Task Max Digit
March 4, 2020, 8:55 a.m.	+ 1	for Task Number Length
Feb. 26, 2020, 1:18 p.m.	+ 1	for Task Crossword Solver
Feb. 26, 2020, 1:07 p.m.	+ 1	for Task Sort Except Zero
Feb. 21, 2020, 10:12 a.m.	+ 1	for Task Majority
Feb. 21, 2020, 10:11 a.m.	+ 1	for Task Chunk
Feb. 20, 2020, 6:10 a.m.	+ 1	for Comment r.bathoorn: nice use of defaultdict(int) to build a historgram
Nov. 10, 2019, 10:26 a.m.	+ 2	for textwrap-fokusd
Nov. 9, 2019, 12:05 p.m.	+ 1	for Task New Cities
Nov. 9, 2019, 11:24 a.m.	+ 1	for Task Stressful Subject
Nov. 9, 2019, 10:22 a.m.	+ 1	for Task Light Up
Nov. 9, 2019, 10:01 a.m.	+ 1	for Task Split Pairs
Nov. 8, 2019, 2:43 p.m.	+ 1	for Task YAML. More Types
Oct. 29, 2019, 7:53 a.m.	+ 4	for Arithmetic formulation-tokyoamado
Oct. 25, 2019, 11:06 a.m.	+ 1	for Task Reversed Permutation Index
Oct. 25, 2019, 9:45 a.m.	+ 1	for Task Permutation Index
Oct. 18, 2019, 6:14 a.m.	+ 4	for Dynamic-veky
Oct. 18, 2019, 6:01 a.m.	+ 1	for Comment juestr: Almost perfect dynamic programming solution if you'd slap @lru_cache on max_steps. If you trace thro...
Sept. 21, 2019, 9:29 a.m.	+ 1	for New Python on CheckiO
Aug. 29, 2019, 2:33 p.m.	+ 1	for Task Date and Time Converter
Aug. 29, 2019, 2:32 p.m.	+ 1	for Task Time Converter (12h to 24h)
Oct. 23, 2018, 1:27 p.m.	+ 1	for Comment Infini7y: A tad verbose with 'initialize' function, nicer to just do inline: first_word = first_word.lower().r...
Oct. 20, 2018, 12:19 p.m.	+ 1	for Task Numbers Factory
Oct. 20, 2018, 12:19 p.m.	+ 1	for Comment Sim0000: You can use for ... else to simplify you code. You can replace line 11-12 with else: return 0 This w...
Oct. 20, 2018, 12:19 p.m.	+ 1	for Comment Sim0000: You can write `self.index = (self.index + 1) % 4` instead of line 8-11.
Oct. 9, 2018, 4:01 p.m.	+ 1	for Comment swhcz: seemingly good use of enumerate and comprehensions, like it!
Sept. 29, 2018, 1:38 a.m.	+ 1	for Comment JimmyCarlos: Good solution. The code works well, and is indented nicely on one line to make things much clearer.
Sept. 28, 2018, 2:42 p.m.	+ 1	for Task Hypercube
Sept. 27, 2018, 2:39 p.m.	+ 1	for Comment zalikovka: Great. Short, clear and fast solution. Great!
Sept. 27, 2018, 10:55 a.m.	+ 1	for Comment fed.kz: Why do you publish someone else's solution without pointing out the real author? See [this solution]...
Sept. 26, 2018, 8:06 a.m.	+ 1	for Graphical Key-Dmitrij_Protopopov
Sept. 25, 2018, 9:51 a.m.	+ 1	for Task Graphical Key
Sept. 24, 2018, 7:57 p.m.	+ 1	for Comment niilz: I like the type annotations
Sept. 24, 2018, 2:05 p.m.	+ 1	for Comment BrianMcleod: Love the valid-visited test!! It avoids many tests for the edge of the ceiling.
Sept. 24, 2018, 1:41 p.m.	+ 4	for 8-liner-Merzix
Sept. 24, 2018, 1:35 p.m.	+ 1	for Comment przemyslaw.daniel: It's up to you. I would appreciate to be mentioned as an author ;-)
Sept. 24, 2018, 11:39 a.m.	+ 1	for Comment przemyslaw.daniel: This is identical to [this](https://py.checkio.org/mission/the-buttons/publications/przemyslaw.danie...
Sept. 24, 2018, 10:47 a.m.	+ 4	for 12-liner: recursive-przemyslaw.daniel
Sept. 23, 2018, 9:16 a.m.	+ 1	for Task The Buttons
Sept. 23, 2018, 6:30 a.m.	+ 1	for Comment Jay-Jay-D: AWESOME!
Sept. 23, 2018, 6:30 a.m.	+ 1	for Comment BrianMcleod: This fails with cards(5, [4, 3, 3]). sorted(hand) fixes this too.
Sept. 22, 2018, 8:23 p.m.	+ 1	for Comment pon.tu.correo.aca: Hi that solution is pretty short and looks pythonic, great job. I notice some corner cases that fail...
Sept. 22, 2018, 5:49 p.m.	+ 1	for Comment BrianMcleod: This fails on (10, [2, 0, 1, 10])
Sept. 22, 2018, 5:24 p.m.	+ 1	for Comment Merzix: Nice. Very compact and clear. One of my solutions was also this way. But I created only that part of...
Sept. 22, 2018, 5:24 p.m.	+ 1	for Comment przemyslaw.daniel: This fails on cards2(10, [2, 0, 1, 10]). All you have to do is sorted(hand) to get it fixed
Sept. 22, 2018, 4:03 p.m.	+ 2	for 10-liner: simple-przemyslaw.daniel
Sept. 22, 2018, 11:34 a.m.	+ 2	for 8e93bec2103e6d3d9d61237416498aa4-pon.tu.correo.aca
Sept. 22, 2018, 11:31 a.m.	+ 1	for Comment przemyslaw.daniel: This solution is identical to [mine](https://py.checkio.org/mission/card-game/publications/przemysla...

2 3 4