46
Last seen 11 months ago
Member for 9 years, 4 months, 19 days
Difficulty Normal
Initiation
Prime Factors
Easy Unpack
2
32
5
Composition of Functions
Max Digit
2
14
3
lambda password:
Acceptable Password I
3
62
2
most_frequent = lambda seq: max(seq, key=seq.count)
The Most Frequent
3
43
0
Composition of Functions
Backward String
6
9
1
compose((6).__lt__, len)
Acceptable Password I
6
8
2
sum(x for _ in range(y))
Multiply (Intro)
7
13
2
Composition of Functions
Easy Unpack
7
9
3
log10(a or 1)
Number Length
8
20
4
Second Composition of Functions
Correct Sentence
8
5
2
all(the_same)
All the Same
12
16
4
zip
All the Same
13
16
0
number % 10**(n+1) // 10**n
Max Digit
13
3
2
all_the_same = compose(all, the, same)
All the Same
18
5
3
compose(partial(and_, 1), inv)
Is Even
26
5
1
all, starmap, eq, zip
All the Same
27
12
0
Composition of Functions
Count Digits
37
0
0
import
Multiply (Intro)
45
9
1
Composition of Functions
All the Same
47
2
0
items[items.index(border):]
Remove All Before
79
6
0
grouper as Itertools Recipe
Split Pairs
141
4
1
empty-string-safe
Correct Sentence
155
5
0
collections.Counter
The Most Frequent
157
3
0
s := str(num)
End Zeros
212
4
0
not c.isalpha() or c.isupper()
All Upper I
297
2
0
abs(one - x), x - one
Nearest Value
315
1
3
i: i[1:] + i[:1]
Replace First
319
2
0
Composition of Functions
First Word (simplified)
322
2
0
int, max, str
Max Digit
330
2
0
''.join(reversed(val))
Backward String
343
3
0
border.__ne__
Remove All Before
453
1
0
w.isnumeric() and int(w)
Sum Numbers
470
1
1
All the Same
All the Same
558
2
0
'0' <= c <= '9'
Count Digits
590
0
0
m := re.match('(^0+)', number)
Beginning Zeros
593
0
0
if number[n] != '0': return n
Beginning Zeros
594
0
0
next
Beginning Zeros
595
0
0
not num & 1
Is Even
596
0
0
~num & 1
Is Even
597
0
0
max_digit = compose(int, max, str)
Max Digit
674
0
0
max(digits(number))
Max Digit
675
0
0
First
Easy Unpack
725
0
0
backward_string = itemgetter
Backward String
759
0
0
(i:=text.index(begin)+1)
Between Markers (simplified)
783
1
0
text[begin:end]
Between Markers (simplified)
809
0
0
lte
All the Same
817
1
2
Home
(-items.count(x), items.index(x))
Sort Array by Element Frequency
1
450
42
text.lower().split().count
Popular Words
1
334
20
str(p & f)time
Date and Time Converter
1
186
11
one liner
Popular Words
1
24
3
The Art of the Metaobject Pluralization
Date and Time Converter
3
63
3
Composition of Functions
First Word
3
7
2
Composition of Functions
Backward Each Word
5
6
0
C({}.fromkeys(ws, 0)).u(C)
Popular Words
6
7
1
With itertools batteries: chain, repeat, starmap
Sort Array by Element Frequency
7
32
7
Composition of Functions
Bigger Price
9
4
3
Suppressing
Between Markers
10
5
0
f(f() + 1)
Second Index
21
2
1
clear
Sun Angle
38
8
1
Composition of Functions
Days Between
39
1
1
yield from [d] * (1 + (d==0))
Duplicate Zeros
52
0
0
up = next(it) <= (last := next(it))
Changing direction
55
0
0
enumerate(pairwise(items))
Missing Number
60
0
0
len(items)/2 + len(items)%2
Split List
72
6
1
yield from repeat(item, count)
Sort Array by Element Frequency
82
8
2
Composition of Functions
Sort Array by Element Frequency
105
0
0
Morse decoder
Morse Decoder
126
4
1
Counter.update
Popular Words
180
4
0
itertools.groupby
Three Words
217
7
2
re.search
First Word
318
3
0
with backward_string
Backward Each Word
326
1
0
itemgetter
Bigger Price
355
3
0
' '.join(s[::-1])
Backward Each Word
512
0
0
First
Pawn Brotherhood
560
3
0
contextlib.suppress
Second Index
579
1
0
First
Days Between
666
2
1
first:last
Between Markers
699
0
0
First
Non-unique Elements
1455
2
0
left_join = compose(left, ','.join)
Right to Left
3778
0
0
First
Even the Last
4609
0
0
Electronic Station
sorted == words
Words Order
1
205
20
are_similar poly
Similar Triangles
1
155
10
SymPy
Inside Block
1
31
7
str.maketrans
Surjection Strings
2
91
4
Recursive Generator
Mathematically Lucky Tickets
2
32
4
eq(*)
Verify Anagrams
5
12
1
First
Can You Pass?
7
11
0
boolean = compose(eval,"{2}({0},{1})".format)
Boolean Algebra
10
13
0
boolean = lambda x, y, op: globals()[op[:2]](x, y)
Boolean Algebra
11
13
0
_5 and len(set(password)) >= 3
Acceptable Password VI
17
7
0
First
Digits Multiplication
19
6
0
Second
Digits Multiplication
21
5
0
is_all_upper = str.isupper
All Upper II
40
7
1
all(zip)
Ascending List
41
7
0
eval(f"{op}({x},{y})")
Boolean Algebra
64
9
7
sorted(files, key=split_filename)
Sort by Extension
88
3
1
with suppress(re.error):
Unix Match. Part 2
94
0
1
'password' not in password
Acceptable Password V
110
2
0
seen.add(w) or w
Words Order
132
2
0
Composition of Functions & Fixed Point
Brackets
138
0
0
0 < sum < len > 6
Acceptable Password III
190
1
0
seen |= c.isupper()
All Upper II
207
1
2
l := or < l >
Acceptable Password IV
214
0
0
'0' <= c <= '9'
Acceptable Password II
232
1
0
> 6 and any
Acceptable Password II
233
1
0
First
Boolean Algebra
321
2
0
First
Find Sequence
588
0
0
@fixpoint
Brackets
1623
0
0
Scientific Expedition
result[isinstance(item, int)]
Sum by Type
1
168
15
re.findall & lower
Conversion from CamelCase
1
157
12
Numpy
Cipher Map
1
22
1
methodcaller
YAML. Simple Dict
1
19
1
take a hammer to crack a nut
Follow Instructions
1
10
0
0 <= first == second - 1
Goes Right After
2
78
4
caps = not caps
Caps Lock
2
42
3
dict, int, decode
YAML. More Types
2
23
4
u"̨̉
Remove Accents
2
14
1
one-liner
Time Converter (24h to 12h)
3
19
1
numpy 2
Cipher Map
3
14
1
Composition of Functions
Conversion from CamelCase
3
13
3
result.get(str, ''), result.get(int, 0)
Sum by Type
3
8
2
First
Call to Home
4
21
2
find_message = str('_').join(('find', 'message'))
Secret Message
4
16
4
to_CamelCase = partial
Conversion into CamelCase
4
7
3
re.sub & lower
Conversion from CamelCase
5
27
1
methodcaller
Common Words
5
8
1
zip_longest
The Hidden Word
6
20
3
k: convert(v.strip())
YAML. More Types
7
14
1
key, value = s.split(': ')
YAML. Simple Dict
7
13
1
recursive
Conversion into CamelCase
7
4
0
First
Morse Clock
16
4
0
getattr(q, op)(*args)
Letter Queue
40
5
0
if not res[k]: del res[k]
Convert and Aggregate
43
0
0
filter(all, res.items())
Convert and Aggregate
44
0
0
Composition of Functions
Pangram
47
1
0
str(p & f)time
Time Converter (24h to 12h)
78
7
3
lines in two lines
YAML. Simple Dict
84
1
1
'pa'[h < 12]
Time Converter (24h to 12h)
128
5
1
max
The Most Wanted Letter
231
5
0
step-by-step
Follow Instructions
235
1
0
Composition of (Instru|Fun)ctions
Follow Instructions
287
0
0
split & map
Conversion into CamelCase
309
0
0
re
Conversion into CamelCase
310
0
0
First
Letter Queue
415
0
0
First
Common Words
638
1
0
First
Secret Message
735
0
0
Set
Pangram
1134
0
0
checkio = partial(sorted, key=abs)
Absolute Sorting
3412
0
0
O'Reilly
sorted(sorted)
Frequency Sorting
1
189
13
one-liner
Time Converter (12h to 24h)
1
27
1
Recursive Generator
Flatten a List (generator version)
1
8
3
yield from (x,)
Flatten a List (generator version)
2
8
1
sort with key
Frequency Sorting
3
44
3
res.insert(i, 0)
Sort Except Zero
3
30
1
items[x:x+size]
Chunk
3
20
0
yield from chain.from_iterable
Flatten a List (iterator version)
4
2
0
ChainMap
The Flat Dictionary
5
18
3
Not Only Lists
Flatten a List (generator version)
5
4
0
Stack
The Flat Dictionary
6
15
0
brute force
Loading Cargo
7
12
1
i: i[-1:] + i[:-1]
Replace Last
13
14
1
[i:j][::-1]
Reverse Every Ascending
16
11
1
Any Iterable
Flatten a List (generator version)
18
0
0
recursive - revisited
Count Inversions
19
10
0
(i:=n) and x or x
Compress List
20
1
1
recursive
Count Inversions
22
9
0
insort(s, s.pop() - s.pop())
The Final Stone
30
1
0
flat_list = '_'.join(('flat', 'list'))
Flatten a List
37
3
0
0 if type(structure) is int
How Deep
39
4
0
len(s := str(num)) == 1
Sum of Digits
39
1
0
x or zeros.add(i)
Sort Except Zero
56
4
2
flat_list = compose(flat, list)
Flatten a List
56
2
0
flat_list = str('_').join(('flat', 'list')); list = list
Flatten a List
57
2
1
peaks(items)
Reverse Every Ascending
60
3
1
Mainly Functional
Determine the Order
70
1
0
import combinations, starmap & gt
Count Inversions
80
4
1
starts, intervals = {}, []
Multiple Lightbulbs
85
0
0
pairwise as Itertools Recipe
Compress List
123
2
0
zip_longest
Compress List
146
1
0
sum & len
Majority
200
2
0
First
Xs and Os Referee
278
4
0
items[:items.index(border)+1]
Remove All After
305
0
0
Recursive generator
Flatten a List
316
3
0
contextlib.suppress
Index Power
669
2
3
First
Median
7914
0
1
Incinerator
cycle(Lamp.sequence)
Multicolored Lamp
1
154
19
vars(self).update(locals())
Every Person is Unique
1
115
7
SavedText(list)
Text Editor
1
89
4
Squaring the Circle
Geometry Figures
1
61
8
Party as a Named list
Party Invitations
1
55
5
metaclass=Singleton
Capital City
1
54
5
Human = Robot
Dialogues
1
53
5
for attr in vars(weapon):
The Weapons
1
35
4
char2byte & byte2char
Hacker Language
1
30
2
Lamp = type
Multicolored Lamp
1
23
0
__getattr__ = lambda: lambda: getattr
Every Person is Unique
1
20
1
AbstractCook
3 Chefs
2
50
1
make_broken & getattr
Microwave Ovens
2
20
2
cook your locals()
3 Chefs
2
18
0
__init__ = choose_figure
Geometry Figures
2
9
0
Swordsman = Lancer = Archer = None
Army Units
3
22
4
@rounded, @staticmethod, @classmethod
Geometry Figures
3
21
1
other[:] = (x for x in other if x.is_alive)
The Lancers
3
12
0
FP & MetaOOP
Geometry Figures
3
7
2
army from strings
Army Units
4
2
0
__new__
Capital City
5
14
1
class Person:
Every Person is Unique
5
10
3
while unit_1.is_alive:
The Warriors
6
34
1
class SetAndGet(list)
Voice TV Control
8
7
1
@time.setter
Microwave Ovens
8
5
0
Friends set
Friends
13
9
0
__init_subclass__
3 Chefs
18
6
1
First
Straight Fight
20
1
2
First
The Healers
27
3
0
[a1, a2][fight(a1[0], a2[0])].pop(0)
The Vampires
76
1
1
del [a1, a2][fight(a1[0], a2[0])][0]
The Defenders
92
1
0
First
Building Base
163
2
1
Mine
__getitem__
Best Stock
1
257
30
clean(cryptotext).translate(cipher(delta))
Caesar Cipher (decryptor)
1
9
1
In search of Eulerian path (vinc's solution), discarding loops
Domino Chain
2
23
2
eval(pythonize(formula))
Chemical Analysis
2
5
1
Composition of Functions
Bigger Together
2
3
2
Fixed, after update mission description...
Cut Sentence
3
49
1
old style sorting
Bigger Together
3
29
0
Composition of Functions
Currency Style
3
6
0
First
The Einstein Problem-Lite
5
12
2
First
Currency Style
5
11
0
optimized random solution
Domino Chain
5
11
0
First
Determinant
7
4
0
Composition of Functions
Cut Sentence
7
1
1
Stack
Disposable Teleports
8
8
0
Composition of Functions (2)
Best Stock
9
3
0
Composition of Functions
Binary Count
10
8
1
chains recursive generator
Domino Chain
10
6
0
re & translate
Caesar Cipher (decryptor)
10
5
0
shortest solution factorized
Fizz Buzz
14
12
4
weighted_sum
Can Balance
14
8
0
Composition of Functions
Best Stock
21
1
1
DRY with backtracking
Disposable Teleports
22
0
0
First
Find Enemy
26
1
0
First
What Is Wrong With This Family?
27
5
0
...else eval(code)
Aggregate by Operation
31
0
0
groupby, zip_longest
Long Pressed
32
0
0
groupby, zip_longest, count
Long Pressed
33
0
0
''.join(stack)
Adjacent Letters
34
0
0
groupby, zip_longest, count, all_any
Long Pressed
34
0
0
First
The Greatest Common Divisor
35
7
0
res[v].add(k)
Switch Keys to Values
38
0
0
cipher dict
Caesar Cipher (encryptor)
66
5
0
DRY -- just to_encrypt
Caesar Cipher (decryptor)
72
0
0
Stack Backtracking
Color Map
93
0
0
Reversing Tuples
Best Stock
124
5
0
Recursive generator
Disposable Teleports
207
0
0
itemgetter
Best Stock
431
1
0
Counter
Best Stock
432
1
0
First
Moore Neighbourhood
450
0
0
Ice Base
First
Identify Block
1
41
1
Composition of Functions
Morse Encoder
2
5
0
__import__ and compile
Find Quotes
3
15
0
First
Oil Pie
4
22
1
infinite rotations
Identify Block
4
13
0
any(starmap(swap, combinations))
One Switch Strings
4
3
0
3-liner: based on 7-liner: based on best Roman Numerals solution
Reverse Roman Numerals
6
6
0
lambda-reduce
Oil Pie
8
0
1
Circle intersection - fixed
Count Chains
12
0
0
First
Reverse Roman Numerals
14
8
2
grid = list(zip(*grid[::-1]))
Identify Block
17
4
1
[0] * items.count(0)
Move Zeros
21
2
1
Composition of Functions
Long Repeat
25
3
0
Composition of Functions (thanks to veky's derelict battery heads-up)
Reverse Roman Numerals
27
6
1
partial(sorted, key=not_)
Move Zeros
48
0
0
First
Counting Tiles
50
3
2
repeat(0, zero)
Move Zeros
50
0
0
upper or lower or upper and lower
Correct Capital
52
0
0
without min/max
The Most Numbers
58
1
2
' '.join(' '.join)
Morse Encoder
91
3
0
find_quotes = re.compile('"([^"]*)"').findall
Find Quotes
105
3
0
find_quotes = quotes.findall
Find Quotes
112
3
0
recursive reachability
How to Find Friends
131
4
0
stack reachability
How to Find Friends
132
4
0
Second
Reverse Roman Numerals
182
0
2
itertools.groupby
Long Repeat
193
3
13
Scanner(M).scan
Morse Encoder
202
0
0
Third
Long Repeat
283
2
0
First
Monkey Typing
345
2
0
Second (re.finditer)
Long Repeat
570
0
0
array = array or [0]
The Most Numbers
3701
0
0
Alice In Wonderland
(4 - date.weekday()) % 7
When is Friday?
1
76
5
eat_value(deque)
YAML. Complex Structure
1
11
0
lines[0].startswith('-')
YAML. List and Comments
1
8
2
divmod
Middle Characters
2
60
4
mode
The Fastest Horse
7
11
1
slice(*signed)
Middle Characters
12
0
0
First
Transposed Matrix
18
1
1
tree_walker(subtree, target)
Tree Walker
25
0
0
Counter.most_common
The Fastest Horse
27
5
0
from os.path import commonprefix
IP Network: Route Summarization
36
2
2
start = stop
Zigzag Array
54
2
0
zip(a[::2], a[1::2])
Swap Nodes
71
1
1
First
The Shortest Knight's Path
94
0
0
First
Digits Doublets
130
0
0
First
Long Non Repeat
136
0
0
Second
Long Non Repeat
142
0
0
First
Multiplication Table
205
0
0
GitHub
cookie.split.split
Cookies
1
59
1
first, *data = sorted(data)
Create Intervals (generator version)
1
21
0
try: first, *data = sorted(data)
Create Intervals (iterator version)
1
8
0
First
Long Repeat Inside
2
48
3
a0, b0 = next(intervals)
Merge Intervals (iterator version)
2
7
0
np
Paper Dice
2
0
0
dict
Cookies
3
21
2
best_moves and winning_combos
Xs and Os Champion
3
6
1
except StopIteration:
Merge Intervals (iterator version)
3
5
0
scipy.sparse.csgraph
The Cheapest Flight
3
0
0
a0, b0 = intervals.pop(0)
Merge Intervals (generator version)
4
0
1
max columns sum
The Highest Building
5
21
3
if reachable_by_city.isdisjoint(dark_cities): continue
Power Plants
5
4
0
yield from range
Expand Intervals
7
12
0
First
Merge Intervals
8
10
1
re.search
Cookies
10
10
0
merge intervals
Painting Wall
10
7
0
from calendar
The Most Frequent Weekdays
10
2
0
class checkio:
Solution for Anything
11
15
0
First
Simplify Unix Path
11
3
3
decode(s) or decode(s[::-1])
Barcode Reader
11
1
0
next & enumerate
The Highest Building
14
9
1
Mainly Functional (reviewed)
Power Supply
15
3
0
starmap(str.endswith)
The End of Other
20
9
1
First
Shooting Range
25
2
0
dist = reduce(gcd, spaces)
Evenly Spaced Trees
25
2
0
Composition of Functions
Area of a Convex Polygon
29
1
0
for loops
The Highest Building
66
2
1
slicing
Cookies
78
1
1
First
The Highest Building
80
1
0
Mainly Functional
Power Supply
94
0
0
heapq
Open Labyrinth
124
4
0
simply merge_intervals (spoiler)
Create Intervals
144
0
0
Composition of Functions
The End of Other
150
0
0
Dropbox
sympy.geometry.Circle
Three Points Circle
2
12
0
brute force
Nonogram Row
2
8
1
Composition of Functions
Worth of Words
3
10
1
n % 100, n // 100, n % 10
Speech Module
4
15
1
exec(worth_of_words.__doc__) & eval('+'.join(word)))
Worth of Words
5
8
0
atbash = mc('translate', r(l) | r(u))
Atbash Cipher
5
1
0
map locals()[style]
Text Formatting
7
11
1
letters values
Worth of Words
10
1
0
First
Place Queens
14
1
0
First
Simple Hashlib
19
7
0
zip(reversed)
Common Tail
19
2
0
plaintext.translate(table)
Atbash Cipher
22
2
0
''.join(text[i::key] for i in range(key))
Scytale Encryption
48
0
0
First
The Longest Palindromic
54
8
0
First
Numbers Factory
59
7
1
eval
Worth of Words
77
3
1
First
Humpty Dumpty Form
96
2
0
PyCon TW
sympy.solve_linear_system
How Much Gold
2
3
1
Composition of Functions
Double Substring
3
5
0
Composition of Functions
Sum Consecutives
5
3
0
First
Simple Areas
6
5
0
sum & groupby
Sum Consecutives
12
6
0
Second
House Password
25
5
0
First
Network Attack
32
4
1
First
Double Substring
32
4
0
Recursive generator
Golden Pyramid
33
8
1
First
House Password
35
18
2
map(eval, commands)
Digit Stack
42
0
0
merge intervals
Building Visibility
53
0
0
GRADES = dict(zip(VALUES, MINS))
Ryerson Letter Grade
61
0
0
First
Express Delivery
74
0
0
elif stack:
Digit Stack
106
2
0
Swap Generator
Robot Sort
134
0
0
First
Calculate Islands
217
0
0
First
Digit Stack
540
0
0
Storage
groupby
Group Equal consecutive
1
62
3
Composition of Functions
Group Equal consecutive
1
17
4
spiral walk
Hexagon Spiral
2
4
1
First
Square Spiral
4
9
2
quine = lambda: code
Exec Quine
4
3
2
First
Moria Doors
5
10
1
First
Mind Switcher
5
6
2
Hack Rules
Restricted Prime
7
5
1
distinct lines
The Rows of Cakes
10
6
0
one liner
Word Pattern
13
1
1
heapq
Digging a Canal
52
0
0
First
Earth Distances
57
0
0
numpy
Skew-symmetric Matrix
65
0
0
First
English to Braille Translator
66
0
0
(m(x), m(zip(*x)))
Weak Point
85
0
0
First
Playfair Cipher
86
0
0
First
Weak Point
316
0
0
Maya
deduce, satisfy_constraints, solve
Light Up
5
3
0
HubSpot
reduce, or_, starmap
Supply Line
1
14
2
weekday() - firstweekday
Weekly Calendar
5
6
0
leap_shift
Next Birthday
6
6
0
First
City's Happiness
10
5
2
First
Repeating Decimals
13
4
1
First
Auto Painting
15
4
0
Precomputation
Square Board
24
2
0
First
Node Disconnected Users
32
3
0
Count connected components, discarding nodes
New Cities
39
1
0
sum(bool(line.strip()))
Non Empty Lines
43
1
0
any(c != ' ')
Non Empty Lines
44
1
0
Count connected components
New Cities
66
0
0
checkio = try_with_default(int, default=-1)
Number Base
121
0
1
Composition of Functions
The Hamming Distance
141
0
0
First
Restricted Sum
759
0
0
contextlib.suppress
Number Base
2730
0
0
Blizzard
SciPy Batteries
Connect Stars
1
12
2
recursive generator with numpy support
Sudoku Solver
1
2
0
scipy.sparse.csgraph
Useless Flights
2
8
1
reduce(set.union, points)
Rectangles Union
4
13
1
oikcehc
Palindromic Palindrome
7
8
1
min, max = from_cmp(le), from_cmp(ge)
Min and Max
8
9
0
First
Spaceship Landing Strip
8
5
0
last.isoformat()
The First Working Day
9
7
2
numbers[1-i:]
Permutation Index
35
0
0
First
Radiation Search
37
1
0
Recursive
String Conversion
42
1
1
chain.from_iterable(points)
Rectangles Union
43
1
1
First
Safe Coasts
71
0
0
First
Weekend Counter
84
2
1
First
Stressful Subject
333
0
2
First
The Angles of a Triangle
966
0
0
Rock
First
Web Log Sessions
1
20
0
hunter & walker
Chicken Hunt
1
0
0
First
Black Holes
3
8
0
First
CheckSum
7
6
0
while cells: yield close_island()
Hexagonal Islands
9
3
0
First
Crossword Solver
14
1
0
First
Parity Bit Generator
16
5
0
max(line[:len(line)-i+1])
Greedy Number
36
0
0
First
Water Jars
41
0
1
(last := v) for v in values
Sort by Removing
42
1
0
First
Super Root
55
1
1
len(nth_composition(step, tick_n)(live))
Life Counter
62
0
2
last = float('-inf')
Sort by Removing
84
0
0
First
Berserk Rook
85
0
0
Shelter
digit(f)
Seven Segment
1
65
4
max(search)
Halloween Monsters
1
4
0
for f in str.isupper, str.islower:
Seven Segment
2
24
4
completely_empty = lambda *args: globals()['completely_empty'](*args) .....
Completely Empty
2
13
2
Bi-Compressed Sparse Graph & Permutations
Climbing Route
2
0
1
Compressed Sparse Graph & Permutations
Climbing Route
3
4
0
numpy
Pattern Recognition
3
1
0
x:x*x
The Nearest Square Number
4
1
0
2..__rpow__
The Nearest Square Number
6
1
0
last_dir = '↓'
The Lantern Festival
9
2
0
for monster in candidates:
Halloween Monsters
17
3
0
class MonsterCounter
Halloween Monsters
24
1
0
First
One line Drawing
57
0
0
Codeship
as simple as greedy: often doesn't work!
Unfair Dice
1
9
2
First
The Square Chest
4
21
1
Binomial coefficients
Probably Dice
4
7
1
bfs
The 88th Puzzle
5
6
0
'Group', ('color', 'elements')
Eaten Go Stones
5
2
0
card_a, card_b = islice
Magic with 5 cards
6
1
0
sort_(card, hand, combination)
Texas Referee
7
4
0
groups partitions, again
The Territory of Go
9
2
0
First
Behind 2048
9
1
0
from itertools import *
The Square Chest
10
1
1
gyahun_dash optimized
8 Puzzle
17
1
1
First
Minesweeper
17
1
0
First
Pearls in the Box
129
0
0
Hermit
First
Ore In The Desert
2
18
0
First
Colder-Warmer
3
12
1
d and f'{d} and '
Fractions Addition
3
6
1
numpy
Mono Captcha
5
0
0
DRY with backtrack
Network Loops
5
0
0
SymPy
Simplification
6
1
0
First
The Good Radix
9
5
0
is_integer()
Count Consecutive Summers
10
10
0
suppress_ZeroDivisionError
Reverse Engineer
11
0
0
(x%2 == 0) * (x//2)
Count Consecutive Summers
19
8
0
birthday + datetime.timedelta(5-wd)
Birthday Party
28
0
0
'{d} and {f - d}'
Fractions Addition
29
1
0
131 chars
Ore In The Desert
30
1
0
val[:pos-1] + val[pos+1:]
Backspace Apply
30
0
0
26 ** (ln-i)
Excel Column Number
40
0
0
len(set(map(canonify, emails)))
Unique Email Addresses
47
0
0
[total:len(data)-total])
Shorter Set
49
0
0
merge_intervals reuse
Keywords Finder
50
0
0
one pass
Stock Profit
52
0
0
Watchtower
First
Numbered Triangles
4
7
1
First
Ethernet Ring Dimensioning
4
5
0
First
Compare Functions
6
6
0
Second (defaultdict)
Ethernet Ring Dimensioning
10
4
0
First
Wall Keeper
10
2
1
with memoization
DNA Common Sequence
14
1
0
best_gift = current_gift
Bag of Santa Claus
21
1
0
choices.pop()
Bulls and Cows
38
0
1
Best divisor first
Number Guess
58
0
0
First
Convex Hull
61
0
0
First
Vigenere Cipher
135
0
0
checkio = sum
Funny Addition
167
4
0
First
Rotate Hole
316
0
0
Escher
insort_left
The Ship Teams
1
124
11
x0, y0 = positions.pop('Y')
Compass, Map and Spyglass
1
85
4
search(positions, word='hypercube'):
Hypercube
1
34
0
scipy.ndimage.find_objects
Keys and Locks
1
27
1
from numpy import array, abs, argwhere
Compass, Map and Spyglass
1
25
1
except: pass
Safe Code
1
16
1
numpy.(sum, argmin)
The Stone Wall
1
9
0
xs, ys = zip(*grounds)
Ground for the House
2
50
4
max(l) - min(l) + 1
Ground for the House
2
10
1
scipy.ndimage.find_objects
Ground for the House
2
9
0
min(starmap(point_line_distance, lines))
Wild Dogs
2
5
0
safe = {1}
The Stones
4
16
0
yield sum(yield)
The Buttons
5
5
0
class Treasure:
Treasures
10
7
3
sorted(bts, reverse=True)
The Buttons
11
3
0
next(filter(solve, range), -1)
Safe Code
12
6
1
N[0] = 'zero'
The Secret Room
12
5
1
f'{item}: {count}'
Treasures
18
4
0
deck.remove
Card Game
29
1
3
functools.reduce
The Stones
30
2
1
column.count('#')
The Stone Wall
64
2
0
Not On Map
eval('string_length'[7:10])
Length of the String
2
1
0
numpy.base_repr
Base change - Position System
2
0
0
takewhile(most_common)
Most Wanted Letter
8
7
2
groupby(most_common)
Most Wanted Letter
15
3
1
Counter update
Aggregate and Count
42
0
0
Counter & chain.from_iterable
Aggregate and Count
43
0
0
string_length = len
Length of the String
80
0
1
