max-count clear solution for The Most Wanted Letter by bryukh - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

max-count solution in Clear category for The Most Wanted Letter by bryukh

import string

def checkio(text):
    """
    We iterate through latyn alphabet and count each letter in the text.
    Then 'max' selects the most frequent letter.
    For the case when we have several equal letter,
    'max' selects the first from they.
    """
    text = text.lower()
    return max(string.ascii_lowercase, key=text.count)

Feb. 14, 2014

Comments:

metabuddy on Feb. 26, 2014, 12:36 p.m.
this is brilliant I wish I had your brains

943947611 on Dec. 3, 2017, 9:09 a.m.
me too!

neptunhiker on Jan. 25, 2018, 8:04 p.m.
absolutely amazing

Reb_Sadran on March 11, 2014, 2:54 p.m.
wow my 12 lines code in 2 lines... Haven't even heard about max before, that's awesome! if anyone wants to read up check it out here: <blockquote> <a href="http://docs.python.org/3/library/functions.html">http://docs.python.org/3/library/functions.html</a>#max </blockquote>

atzeatze on Oct. 27, 2014, 11:55 p.m.
his two lines against my 40 lines xD

patelamy on Jan. 8, 2019, 7:10 a.m.
Thanks :) . Even I thought of visiting the python doc. You made it ease.

avalon3515 on March 24, 2014, 2:26 a.m.
It's amazing... but this solution can't tell us the algorithm. so it's a perfect solution, but it's not the best answer for students.

bryukh on March 24, 2014, 2:52 a.m.
I wrote it in the docstring.

Julesss on March 26, 2014, 11:09 a.m.
O.o

rocknow on April 8, 2014, 7:26 p.m.
Hm, can't understand how this "key=text.count" works. From docs this must be ordering function

bryukh on April 8, 2014, 7:54 p.m.
"key" is not an ordering function. It does not like to Java or JS, where we use "compare" function. In Python "key" is the function that process elements and get the value for the comparison. For example: <pre class='brush: python'>a = [(2, 3), (3, 1)] # We want to sort by second elements a.sort(key=lambda x: x[1]) </pre>

rocknow on April 8, 2014, 8:10 p.m.
Sorry but still don't understand. I know in general what the code does but if I think about details everything in max is unclear. It would be wonderful if you explain to noobs such me how exactly max iterates over a string and counts the most wanted latter.

bryukh on April 8, 2014, 8:26 p.m.
"max" iterate through ascii_lowercase. Each letter (a, b, c etc) is processing by "text.count(letter)" and "max" compare elements (ascii letters) by count results. Let's look at this as more wider interpritation: <pre class='brush: python'>max_value = 0 max_letter = "" # our answer for letter in string.ascii_lowercase: value = text.count(letter) if value > max_value: max_value = value max_letter = letter </pre>

rocknow on April 8, 2014, 8:29 p.m.
Awesome. Thank you very much!

kamikaze on April 12, 2014, 8:13 p.m.
great, but isn't it an overhead to run 27 times over the same string?

bryukh on April 13, 2014, 12:14 a.m.
Just run your solution and mine with timeit and random 10000 length string and you will be wonder by results in Python ;-) And <a href="http://www.checkio.org/mission/most-wanted-letter/publications/bryukh/python-3/thanks-to-pl/#comment-outer-5909">here</a> you can find the discussion about it.

Saingue_Lainglin on June 21, 2018, 11:47 a.m.
For the record this implementation is nothing but near 10x faster than one using collection.Counter() my implementation : 23 s. to run 100x on the whole french dictionary yours : 2.6 s. I really wonder why it is so fast (or why using Counter() is so slow), that is kinda non intuitive and the link for the discussion seems dead.

ine1 on Sept. 7, 2019, 10:32 p.m.
Just did that <pre class='brush: python'>In [1]: def abc(text): ...: text = text.lower() ...: return max(string.ascii_lowercase, key=text.count) In [3]: def col(text): ...: c = Counter(filter(str.isalpha, sorted(text.lower()))).most_common(1) ...: return c[0][0] In [4]: def abc_set(text): ...: text = list( filter(str.isalpha, sorted(text.lower())) ) ...: return max(sorted(set(text)), key=text.count) In [5]: t = 'Hello World!' In [12]: %timeit abc(t) 100000 loops, best of 3: 6.86 µs per loop In [13]: %timeit abc_set(t) 100000 loops, best of 3: 11.2 µs per loop In [14]: %timeit col(t) 10000 loops, best of 3: 20.8 µs per loop </pre> For chaotic texts situation slightly change <pre class='brush: python'>In [15]: import random In [16]: t = ''.join(random.choice(string.printable) for i in range(1000000)) In [17]: t [:100] Out[17]: ';MyI[=0|\x0bG#}{&:eOa7O?v\x0c/,7otkhQ\'Y[O"JVv\\9$I0\tli0QjAxpf.kWCBUsjr:7b}5\';=q]m2{\x0c|%xV4-%\' 9\t1KIq:=\`Tz\tGu' In [18]: %timeit abc(t) 10 loops, best of 3: 28.3 ms per loop In [19]: %timeit abc_set(t) 1 loops, best of 3: 949 ms per loop In [20]: %timeit col(t) 1 loops, best of 3: 615 ms per loop </pre> abcset is attempt to shorten list string.asciilowercase Failed tho

isaiah.stjohn on May 16, 2019, 7:32 p.m.
I was surprised by this, too. But I found that on my machine, `str.count('a')` is 43 times faster than `mycount(str, 'a')`. <pre class='brush: python'>import cProfile, string, random text_long = "".join(random.choice(string.printable) for _ in range(10000000)) def mycount(text, char): count = 0 for ch in text: if ch == char: count += 1 return count if __name__ == "__main__": cProfile.run("mycount(text_long, 'a')") # 0.303 seconds cProfile.run("text_long.count('a')") # 0.007 seconds </pre> So the inefficiency of looping 27 times over the string is swamped by the inefficiency of looping over the string with custom Python code. I imagine `str.count` is implemented in C behind the scenes.

timur.suleimanov on June 7, 2014, 9:10 p.m.
just wow. i love python

Akay on June 22, 2014, 12:26 p.m.
Wow!!!

NCNecros on July 3, 2014, 6:02 p.m.
it's beautiful

VictorRodriguez on July 9, 2014, 12:59 a.m.
I used 33 lines. SMH.

avari on July 9, 2014, 2:56 p.m.
Nice & clear!

AlexanderPirogov on July 11, 2014, 8:21 a.m.
This is so beautiful that I want to marry this code...

alexandre.cavalcante on July 13, 2014, 1:58 p.m.
I'm impressed how it can be simple! Congratulations.

Filipizaum on July 22, 2014, 1:46 p.m.
I always think how awesome 2 lines do the same as mine 20!!!

daru_421fb9914c984e3d97b0c8ff0 on July 26, 2014, 3:54 p.m.
I don't know this beautiful solution. It's Amazing!

dorothyhs on Aug. 6, 2014, 2:59 p.m.
Groovy man!!

Yean-Bon on Aug. 10, 2014, 10:26 p.m.
Respect!

StanislavShramko on Aug. 23, 2014, 7:33 p.m.
Brilliant!

ws775901 on Sept. 3, 2014, 9:05 a.m.
amazing!!

qian.long.984 on Sept. 8, 2014, 6:40 a.m.
cool

ematorose on Sept. 10, 2014, 11:16 p.m.
I wish I knew what you knew! I spent hours just trying to get rid of my brackets!!! Let alone the miles of line of code to make it work. I love this site and your, sir, are a great teacher!

MassimoLuraschi on Sept. 16, 2014, 2:32 p.m.
Nice one. I wouldn't say it necessarily belong to "clear" category, but it's a clever one definitively. Iterating over the alphabet and using key saves a lot of time complexity, and makes it so that you don't have to work on the input string, trimming whitespaces, numbers and punctuation. Nice one! [claps]

robinw on Sept. 17, 2014, 12:58 p.m.
Wow. Hard to believe, it can be such clear and simple. Respect!

picklesforfingers on Sept. 27, 2014, 6:51 a.m.
Note to self. max() is a thing.

reviewboy on Oct. 1, 2014, 5:48 a.m.
Ooh, that's nice. this is much more readable than mine. return min([(-1 * ltext.count(c), c) for c in string.ascii_lowercase])[1]

pawel80 on Oct. 14, 2014, 6:37 p.m.
excellent coding

AraytShah on Oct. 24, 2014, 12:25 p.m.
#mindblowing

AraytShah on Oct. 24, 2014, 12:26 p.m.
#mindblowing

lw251 on Oct. 30, 2014, 12:09 a.m.
This is awesome!

serseregas_8017c410d4544a15b3a on Nov. 8, 2014, 3:28 a.m.
best of the best

mydaemon on Nov. 8, 2014, 10:24 p.m.
You got me amazed. I could not even think on this usage for max()! My 12 lines of code summarized so beautifully. Your code deserves to be shown as the sample of why Python is so beautiful and creative language.

bryukh on Nov. 9, 2014, 7:13 a.m.
Thanks!

vocheez on Nov. 15, 2014, 2:11 p.m.
Good task. Now I know about string module. I write this witout importing, is difficult for me. Next time I decide similar task with string module.

bryukh on Jan. 21, 2015, 11:27 a.m.
Tsss, but I had known about this only two year since started use python ;-)

alexander.chzhen on Nov. 19, 2014, 5:42 a.m.
It is the perfect reason to reread "already known" documentation once again.

bryukh on Jan. 21, 2015, 11:27 a.m.
Yeah, I have >5year in python but reread documentation still :-)

Prasanna.kumar.GLV on Nov. 27, 2014, 8:36 p.m.
for god sake! please lemme know where can i learn such artistic method coding

bryukh on Jan. 21, 2015, 11:26 a.m.
Just practice and practice and one moment you will boring to write "just code" and will learn something tricky. I recommend you read @veky solution - that is really creative.

RedheadA3_8469cf456c5840cf9112 on Dec. 10, 2014, 7:58 p.m.
I understand everything that you did, but how does it know to choose the letter that appears first in the alphabet if there are letters that appear an equal amount of times? (i.e. a and b both appear 4 times; if b happened to have been written first in the string, would that be the answer or would it still be a?)

sabareeshk on Dec. 15, 2014, 10:01 a.m.
awsome

bryukh on Jan. 21, 2015, 11:25 a.m.
All letters will be in alphabetical order as we iterate them.

greenit on Jan. 14, 2015, 11:16 a.m.
wow... I definitely have to read myself into Python way more, hat's just awesome...

bryukh on Jan. 21, 2015, 11:24 a.m.
Yep, I like python for these things :-)

or_halimi on Jan. 21, 2015, 8:43 a.m.
I still don't understand how python link the lower case list and the number of letters in the text trough max. I read the doc and all the explains :-(

bryukh on Jan. 21, 2015, 11:23 a.m.
How about comments? As <a href="http://www.checkio.org/mission/most-wanted-letter/publications/bryukh/python-3/max-count/share/28481482c11b990b08b44369be5c5970/#comment-11693">this</a>

or_halimi on Jan. 21, 2015, 1:41 p.m.
Its like telling max that b = 3, a =2, x = 0 and etc...then he find the first letter who has the larger value?

bryukh on Jan. 21, 2015, 1:47 p.m.
As first - it iterates letter by alphabet order - a b c d ... So when it will meet the "same frequency" letter - it will take first from two.

or_halimi on Jan. 21, 2015, 1:54 p.m.
Thanks man, I start to get that max\key\lambda idea.

jcook00 on Feb. 5, 2015, 9:39 p.m.
wow!

SaifSohomow on March 1, 2015, 12:30 p.m.
This seems brilliant, i don't actually know how it does what is does though. However run it against a string that actually contains no letters (only symbols and numbers) and you'll see ;) :P

bryukh on March 1, 2015, 1:49 p.m.
<blockquote> However run it against a string that actually contains no letters (only symbols and numbers) and you’ll see ;) </blockquote> And this will return "a". Is it a problem? For this case all letters have the same frequency - 0 and we take the first.

rmankai on March 6, 2015, 9:50 a.m.
Clean, clear, efficient, really brilliant, bravo!

Peter.White on March 31, 2015, 10:33 a.m.
What the...? ;) Just great. Wish I had thought of that.

rh1n0 on April 1, 2015, 8:53 p.m.
Sweet!

bryukh on April 30, 2015, 5:49 p.m.
Thanks

kayge on April 10, 2015, 4:45 p.m.
Your usage of max() puts <a href="http://www.checkio.org/mission/most-wanted-letter/publications/kayge/python-3/crypto-is-supposed-to-be-slow-right-d/">my usage</a> of max() to shame :)

bryukh on April 30, 2015, 5:49 p.m.
Thanks

tommycarstensen on April 24, 2015, 6:42 p.m.
Doesn't this solution loop over the text multiple times?

bryukh on April 30, 2015, 5:48 p.m.
Yep, 26 times. O(CN) == O(N)

lucasBertola on April 29, 2015, 10:30 a.m.
Perfect :)

bryukh on April 30, 2015, 5:48 p.m.
Thx

brizzadizza on July 18, 2015, 9:28 p.m.
Dayummmm! Very pythonic. Great answer

murray2k on Aug. 15, 2015, 2 p.m.
Wow. I jumped right to collections.Counter, because counting ... d'uh ;) Nice use of the "devilish" count function and its O(n) time complexity, which has given me quiet a headache counting occurrences of many items in large lists before. For educational purposes: (if someone is interested) Counting occurrences with something like collections.Counter is O(n). Counting each item's occurrences while iterating over the list of the distinct items, by using the .count function or something like it is O(m * n) with m being the number of distinct items. Worst case: this can get to O(n²) with a list where each item occurs only once. Here we have a fixed number of possible items (26 letters) so its O(26*n) equals O(n). Nice. But be aware that .count() walks through the list each time called, so using a Counter is usually advised.

Urza on Aug. 23, 2015, 7:41 p.m.
May you pardon me if this question is stupid, but why is the syntax "text.count" and not "text.count()"?

veky on Oct. 15, 2017, 4:24 p.m.
Because you're not calling it, `max` does. (Every time through `string.ascii_lowercase`... otherwise it could be called only once.)

Urza on Jan. 5, 2018, 8:32 p.m.
Thank you very much, though a bit late... But the newbie I'm still is back for good! ^^

fickas on Sept. 2, 2015, 10:29 p.m.
Would return max(text, key=text.count) also work? No, I think it would lose the sort of the ascii string.

psgonza on Sept. 11, 2015, 2:34 p.m.
Hats off to your solution...

bryukh on Sept. 11, 2015, 4:27 p.m.
Thx!

Rodnee on Sept. 24, 2015, 8:01 p.m.
Hats off to you bro!

kirillk on Oct. 8, 2015, 2:25 p.m.
This is great!

Sukonnik-Illia on Dec. 5, 2015, 10:35 p.m.
Jedi. You reminded me that it is necessary to examine standard modules.

yct on Jan. 7, 2016, 8:54 a.m.
I completed it with 6 lines and spent ONE day thinking about how to use 'Counter' or 'Collection' functions before I saw this solution.

suiluj_julius on Jan. 8, 2016, 10:05 a.m.
Wow, there's so much to learn about Python... it took me 20 rows or more...

hernandezj on Jan. 20, 2016, 11:12 a.m.
That is an awesome solution. Very elegant and simple!!

wbkoetsier on Jan. 25, 2016, 2:19 p.m.
Thanks for sharing this String module solution, now I know it's there for me to use! (and to get some more practice with lambda which I totally don't understand yet)

youngjpo44 on Feb. 16, 2016, 10:05 p.m.
Stunningly brilliant

Fyodor_eca63 on March 7, 2016, 6:29 p.m.
Так просто. Удивительно.

ljy95135 on April 10, 2016, 6:23 a.m.
I use 20 lines to solve the same problem. It's terrific to see such brilliant way.

developingcoder on May 22, 2016, 3:06 p.m.
Love it.

leandroribeiro on July 12, 2017, 3:14 p.m.
No F#$%#% way :|

Minh_Dung_Dao on July 14, 2017, 5:40 p.m.
That is just awesome!

lg.sakki on July 16, 2017, 7:35 a.m.
i feel useless

a_l_e_x_e_y_b on July 17, 2017, 4:10 a.m.
I think, I should read Documentation

sergeod on July 20, 2017, 6:04 p.m.
15 wows, for wow in range(len(my_lines))

petrch on Aug. 5, 2017, 8:49 a.m.
The only disadvantage I can see is that if the text is very long (let's say 100k only 'a's and 'b's I assume it will go over the string for all lower ascii characters. Am I right? Or is the text.count able to quickly figure out zeros?

MissingPiece on Aug. 7, 2017, 9:43 p.m.
I don't understand how, if there is equality in max, the first is selected. For example, if input: 'two': why is the output 'o' instead of 't' when nothing was sorted?

Jagabandhu.cok on Aug. 11, 2017, 7:12 p.m.
Just say me you have a Youtube channel where you teach advance things of python

shuyu on Aug. 17, 2017, 11:36 a.m.
so great!!! deeply impressed!!!

art8008 on Aug. 20, 2017, 7:47 p.m.
Thank's. It's briliant!

tytin on Aug. 22, 2017, 3:06 p.m.
Wow, it's magic

DeCooper on Sept. 13, 2017, 10:07 p.m.
Very impressive solution! And great that you make an effort to explain this stuff.

RexLee64 on Oct. 24, 2017, 6:26 a.m.
amazing!!!!!

lv_sage on Oct. 25, 2017, 8:02 a.m.
thank you, i did not know the max() have key parm before.

pcl5k2ou on Nov. 5, 2017, 3:48 p.m.
Great, I used 22 lines,haha~

Chan-Joo_Kim on Nov. 8, 2017, 5:56 a.m.
this is amazing... --

Strawberry on Nov. 9, 2017, 6:14 a.m.
Awesome!!!

guoshichengfirst on Nov. 14, 2017, 2:40 p.m.
so smart!

fieldlady on Nov. 17, 2017, 3:59 a.m.
ONLY 2 lines! This is awesome!

linglitang on Nov. 19, 2017, 4:49 a.m.
You're very smart and very skilled at python. I admire it and deserve learning.

Quan_Lee on Nov. 20, 2017, 1:14 a.m.
just 2 lines... ...

yuki66366659 on Nov. 23, 2017, 1:37 a.m.
awesome!

Kunkgg on Dec. 9, 2017, 4:24 p.m.
wow!!!

StrongWal on Dec. 19, 2017, 7:04 a.m.
Wonderful Work, only two lines, can you finish this question!!! That's Amaizng!

blue777.moja on Jan. 20, 2018, 3:46 p.m.
great! I gained good learning from your code and this algorithm.

moonerstudy on Jan. 22, 2018, 9:17 a.m.
Brilliant! How about more than one most wanted letter like this:('a','a','b','b').Should it return 'a' or 'b'? Thanks.

Saingue_Lainglin on June 21, 2018, 11:42 a.m.
his implementation is somewhat a shortcut of this (same performance) : <pre class='brush: python'>def checkio(text: str) -> str: # no need to filter out non alpha symbols as we will go through string.ascii_lowercase text = text.lower() max_counted = 0 best = "" # it runs in alphabetical order for char in string.ascii_lowercase: counted = text.count(char) # best will be replaced only by a greater max_counted score if counted > max_counted: max_counted = counted best = char return best </pre> as "b" will not be counted as a better score, "a" will keep being recorded as the best.

hekai on Feb. 10, 2018, 12:07 a.m.
AMAZING！

Richard4833 on Feb. 13, 2018, 4:26 p.m.
Y no lo hizo en una sola línea, porque no quiso: And he did not do it in a single line, because he did not want to: return max(string.ascii_lowercase, key=text.lower().count)

bask1939 on Feb. 23, 2018, 7:58 a.m.
Super cool

TianPu8153 on Feb. 24, 2018, 5:35 p.m.
OMG! I'm a begginner in Python and really shocked by your code. It's short and amazing. Thanks!

filopaa1990 on Feb. 26, 2018, 11:46 a.m.
WTF

Vlad2018 on March 1, 2018, 6:20 p.m.
охренеть)) извините)

Naveen45 on March 17, 2018, 12:54 p.m.
This cut through my head....

junhuang.ann on March 18, 2018, 12:59 p.m.
brilliant

cobbwho on March 31, 2018, 2:55 a.m.
I think this code is good from the code quantity and simple,but i just think if you can complete this mission by string.count methond, then the mission have no meaning.May be the source code of string.count is the best answer.233333

ositowang on May 15, 2018, 2:16 a.m.
Will the max function return the several equal letters in an alphabetic order? like a, b, c. Would not be the case it returns several equal max values like b,c,a and pick and first one?

Tairraos on May 15, 2018, 4:10 a.m.
really awesome!

huang19015 on May 27, 2018, 8:01 a.m.
Amazing!

davoudiofficial on June 7, 2018, 8 p.m.
good job :)

apieceofcaken on June 13, 2018, 5:02 a.m.
Freaking brilliant...

XueliJi on June 23, 2018, 7:54 a.m.
wow, i write so many rows in my code, then i open your answer, then i can just say " wow ".

Celshade on June 28, 2018, 10:16 a.m.
I had this as the core of my code, for so long, but I kept iterating over the text instead of string.asciilowercase...resulting in my 13 lines of code. I can't believe I didn't realize max() would pull the correct first instance (where multiple matches were found) due to string.asciilowercase being naturally sorted, already. Ahh, the beautiful frustration of a simple variable swap lol

Pavetta on June 28, 2018, 3:27 p.m.
Great!

ahthwl on Aug. 20, 2018, 6:58 a.m.
incredible man

Anna_Kablukova on Aug. 29, 2018, 7:58 a.m.
Perfect!

lbk0116 on Sept. 4, 2018, 12:51 p.m.
Amazing!!! tks for your share.

kangmin on Sept. 21, 2018, 9:28 a.m.
Amazing!

ljpGBL on Sept. 21, 2018, 3:26 p.m.
This is remarkable...I know that there must be some codes much better and more concise than my 20-line codes, but I didn't expect this level...

nmbugua22 on Sept. 24, 2018, 1:32 p.m.
Neat!!

szver on Oct. 10, 2018, 12:34 p.m.
Amazing!!!

pumacens_64305eb2e37c43308c6c7 on Oct. 22, 2018, 5:25 a.m.
ome gonorrea ome :,,v

strongyin on Nov. 15, 2018, 3:46 p.m.
awsome！！！

yowee on Dec. 5, 2018, 12:53 p.m.
So clearly

ebonight02 on Dec. 13, 2018, 3:08 p.m.
OMG Amazing

megaexception on Jan. 18, 2019, 7:04 p.m.
it's brilliant! simple, clear, fast, pythonic.

qannnons on Jan. 24, 2019, 2:53 p.m.
awesome!!!

fisher_7f21ac60654742468fdb62b on April 5, 2019, 4:19 p.m.
Excellent solution!!!

jiachxxj on April 12, 2019, 2:04 p.m.
what about: return max(string.ascii_lowercase, key=text.lower().count) ?

PasswordError on May 18, 2019, 11:49 a.m.
牛逼

Adermi on June 23, 2019, 11:39 a.m.
oh, my god

bsquare on July 29, 2019, 4:03 p.m.
Very quick and nice solution, I learned something. Thank you!

martin.sterniel on Aug. 8, 2019, 3:58 p.m.
WOW!!!

roman.alilov on Sept. 4, 2019, 2:37 p.m.
Knowing is definitely better than not knowing) On this website I understood that you need to learn couple of libraries on each of type of variables to make you life much more easier.

jp.ventura on Sept. 7, 2019, 1:16 p.m.
<img src="<a href="https://giphy.com/embed/xT0xeJpnrWC4XWblEk">https://giphy.com/embed/xT0xeJpnrWC4XWblEk</a>" alt="MIND BLOWING" />

tralfamafnord on Sept. 21, 2019, 10:57 a.m.
I'll be damned... I have a lot to learn.:D

aashu0012 on Oct. 10, 2019, 10:36 a.m.
Thanks for sharing your brilliance

Txrned on Nov. 5, 2019, 3:08 a.m.
amazing, you deserve the 282 likes.

_Chico__5d82cee4f5234e78a5c65e on June 12, 2021, 6:23 a.m.
You mean the 2241 likes ? :D

chenyongchun on Jan. 3, 2020, 3:49 a.m.
i want to say amazing!

sergeyklimov-creator on Jan. 8, 2020, 5:40 p.m.
solve must be without import

_Chico__5d82cee4f5234e78a5c65e on July 16, 2021, 12:57 p.m.
No...

Zhisheng_Ying on Jan. 14, 2020, 9:39 a.m.
First of all I am a newbie in Python. If I am wrong, please forgive me. I think though the code is very neat, the operations behind are not efficient, because it may not be necessary to iterate every alphabet. Maybe we could set() first to save some operations.

Wiktor_Zachar on April 15, 2020, 9:03 a.m.
It is Amazing solution.

tkachuk.constantine on June 28, 2021, 9:37 p.m.
:))

jsg-inet on July 13, 2021, 10:55 a.m.
Very cool!

robertabegg on Sept. 20, 2021, 6:06 p.m.
Thanks for documenting a great solution!

viktor.chyrkin on Oct. 23, 2021, 2:48 p.m.
how in the world did you get 2280 likes?!?! (not including my five likes)

lbe on Aug. 2, 2023, 7:09 a.m.
Oo So brilliant !

kipermail on Sept. 2, 2023, 4 p.m.
Here is the case when I am ashamed of my own code

murnet on May 6, 2024, 7:56 a.m.
only one question - how?) this is a brilliant!

akamus on Oct. 7, 2024, 6:39 p.m.
cleaver, nice and clear

Strings and Integers

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.