14
Maksym Skorupskyi
https://www.linkedin.com/in/maxnrg/
Last seen 2 years ago
Member for 4 years, 5 months, 17 days
Difficulty Normal
https://github.com/MaksymSkorupskyi
Initiation
First - split()
First Word (simplified)
30
10
0
First
Easy Unpack
49
11
0
First - dot only
Correct Sentence
92
7
0
Second - universal
Correct Sentence
124
6
1
Second - text.split(maxsplit=1)[0]
First Word (simplified)
356
2
0
First - silce indexes
Between Markers (simplified)
617
1
0
First
All the Same
878
0
1
Home
Third - RegExp
First Word
98
7
1
First - re.search('[a-zA-Z]+ [a-zA-Z]+ [a-zA-Z]+', words)
Three Words
178
9
0
First - slice & sum
Even the Last
279
7
1
v3 - find() and slice 3 lines
Between Markers
296
3
1
#3 optimized Counter comprehension
Sort Array by Element Frequency
296
3
1
Counter
Sort Array by Element Frequency
300
0
0
2) optimized Counter
Sort Array by Element Frequency
301
0
0
4th no Counter
Sort Array by Element Frequency
302
0
0
First - pretty straightforward ))
Sun Angle
435
2
1
First - split() and Counter()
Popular Words
436
2
0
Second - re.search('([a-zA-Z]+ ){2}[a-zA-Z]+', words)
Three Words
509
3
0
v1 - return sorted(data, key=lambda i: i['price'], reverse=True)[:limit]
Bigger Price
593
2
1
First
Between Markers
613
1
0
Second - - split() and count()
Popular Words
660
1
0
Third - split() and count() one-liner
Popular Words
661
1
0
First - replace(), strip(), split()
First Word
766
1
0
Second - str methods: replace(), split()
First Word
767
1
1
Second - sorted(data, key=itemgetter('price'), reverse=True)[:limit]
Bigger Price
847
1
0
First - chr/ord O(n)
Pawn Brotherhood
849
2
1
count() list comprehension
Non-unique Elements
962
4
0
v2 - find() and slice
Between Markers
1093
0
0
First - index() & count()
Second Index
1308
0
3
First - join + replace
Right to Left
1367
1
0
First - datetime.date(), datetime.timedelta().days
Days Between
2375
0
1
Electronic Station
First str int
Digits Multiplication
478
3
1
Scientific Expedition
# v2 - title() + replace()
Conversion into CamelCase
133
4
0
#v1 - capitalize() + split()
Conversion into CamelCase
189
3
1
First comprehension
Secret Message
198
8
0
Counter
The Most Wanted Letter
241
1
1
no datetime
Time Converter (24h to 12h)
386
0
0
First
Letter Queue
678
0
0
First - sorted(numbers_array, key=abs)
Absolute Sorting
957
2
1
First - flag + counter
Bird Language
1311
0
0
First - rotate(cipher_grille) four times
Cipher Map
1567
0
0
Second - optimized
Cipher Map
1568
0
0
O'Reilly
First - lazy and pretty straightforward ))
Xs and Os Referee
108
1
0
Second recursion
Flatten a List
266
4
1
First
Index Power
323
5
0
First - straight
Median
529
4
0
First - recursion
Flatten a List
640
1
0
Third - matrix transpose for columns check
Xs and Os Referee
1983
0
0
Second - lazy, a little bit optimized ))
Xs and Os Referee
4510
0
0
Incinerator
First - Strategy Pattern - Geometry Figures
Geometry Figures
86
0
0
First - had to modify the base class Warrior
The Vampires
91
1
0
First - simple
3 Chefs
171
0
0
First
Army Battles
178
1
0
First - list of deepcopy(text)
Text Editor
197
0
0
Second - list of deepcopy(text), self.font optimized
Text Editor
198
0
0
Second - state @property
Text Editor
199
0
0
Second - move vampirism logic to Warrior class.
The Vampires
202
0
0
First - documented and clear I hope )
The Defenders
218
0
0
Third - optimised
The Warriors
302
2
0
First - basic OOP
The Warriors
420
1
0
Second - fix property boolean logic :)))
The Warriors
701
0
0
Mine
First - simple iteration
Best Stock
71
8
1
Second - max(stocks, key=stocks.get)
Best Stock
1020
0
1
First
Fizz Buzz
1113
1
0
Ice Base
First
Feed Pigeons
197
3
1
First - brute force O(n)
Long Repeat
521
1
1
First- max(args) - min(args) if args else 0
The Most Numbers
1050
1
0
Alice In Wonderland
First - str > int > bin > longest_common_prefix > int
IP Network: Route Summarization
146
0
0
v2
IP Network: Route Summarization
147
0
0
First - len(text) % 2, len(text) // 2
Middle Characters
192
0
0
GitHub
5th - assert create_intervals({-1, 0, 1, 12}) == [(-1, 1), (12, 12)]
Create Intervals
64
3
0
# v2 - isleap and weekday leap/non-leap year
The Most Frequent Weekdays
106
3
0
v1 - straightforward iteration through sorted(data)
Create Intervals
304
0
0
v2 - `begins` and `ends`
Create Intervals
305
0
0
v4 - `starts` and `ends` iterators
Create Intervals
306
0
0
# v1 - datetime.date leap/non-leap year
The Most Frequent Weekdays
463
0
0
# v3 - calendar: isleap, weekday, day_name
The Most Frequent Weekdays
464
0
0
Dropbox
First - max(words, key=lambda word: sum(VALUES.get(w) for w in word))
Worth of Words
189
1
0
PyCon TW
First - build pyramid of max possible sums in a path from top to bottom
Golden Pyramid
446
0
0
v2, v3 - build a pyramid of max possible sums in a path from bottom to top
Golden Pyramid
447
0
0
First
House Password
10182
0
0
Blizzard
First - re
Stressful Subject
568
0
0
Watchtower
First
Compare Functions
130
0
0
Second
Compare Functions
131
0
0
