StefanPochmann profile - python coding challenges

O(1) space generator

Replace First

iter

yield

for

chain + islice

Replace First

islice

itertools.islice

chain

itertools.chain

iter

False == 0

Remove All Before

index

in

and

Freak: fast iterator

Replace First

iter

break

append

for

Making Python do it

Easy Unpack

1

text.find or None

Between Markers

find

None

inline-if

in

str

1

651

51

foo

Popular Words

dict

zip

map

lower

count

2

113

3

Regex

Morse Decoder

capitalize

re.sub

sub

re

lambda

2

98

6

The BEST number

Changing direction

float

or

for

if

3

4

2

Short

Bigger Price

lambda

sorted

5

20

2

encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and encode and ...

Morse Decoder

startswith

capitalize

get

upper

map

1

5

← Prev

Date and Time Converter

datetime.strptime

strptime

f-string

datetime.datetime

datetime

10

regex

First Word

re.search

search

re

str

13

1

golfing

Second Index

rfind

None

lambda

count

1

try second parameter of index()

Second Index

pass

index

except

try

str

4

Overkill - plugging itertools/map together

Second Index

itertools.tee

tee

contextlib.suppress

suppress

contextlib

4

Counter elements

Sort Array by Element Frequency

collections.Counter

Counter

dict

collections

3

len(items[::2])

Split List

len

Directions, please

Cipher Dict

hex

iter

append

1

3

Regex One-Liner

Brackets

re.sub

sub

r-string

re

not

2

26

1

78

Verify Anagrams

set-comp

strip

lower

lambda

sorted

3

28

7

Simple and Short

Can You Pass?

enumerate

abs

if-comprehension

in

and

4

7

Short Regex

Find Sequence

ljust

re.search

search

r-string

any

5

6

13

Directions, please

Cipher Dict (decryption)

bytes

f-string

not

sorted

False

7

Strictly speaking...

Cipher Dict (decryption)

not

sorted

False

append

for

8

1

without sorting...

Cipher Dict (decryption)

bytes

f-string

append

for

9

1

Short recursive (46, can be 42)

Digits Multiplication

lambda

3

12

Short: dict subsequence

Words Order

fromkeys

iter

all

in

split

1 line: map {}.setdefault

Surjection Strings

setdefault

map

bool

join

str

1

j.. j.. j.. join!!!

Cipher Map

zip

map

join

if-comprehension

range

1

36

6

vek

Bird Language

re.sub

sub

r-string

re

2

119

13

2 short versions

The Hidden Word

find

map

enumerate

replace

max

2

10

Something from Nothing

Conversion from CamelCase

re.sub

sub

re

lower

3

62

4

125

Call to Home

max

int

for

if

4

5

7

Keep it simple

Striped Words

upper

isalpha

isdigit

inline-if

sum

5

84

5

Use your imagination

Follow Instructions

find

sum

comprehension

7

23

2

List comprehension

Beat The Previous

map

if-comprehension

list-comp

list

comprehension

13

1

3

Not a writer...

I Love Python!

14

50

64

Pangram

chr

upper

lambda

17

3

1

Short reduce (62)

Letter Queue

functools.reduce

reduce

functools

lambda

First

Follow Instructions

count

First

Conversion into CamelCase

title

replace

1

2

Doc Abuse

Pangram

filter

islower

set

lower

lambda

1

WET makes CLEAR

The Hidden Word

itertools.zip_longest

zip_longest

splitlines

itertools

find

2

1

Shortest :-p

The Most Wanted Letter

max

lower

lambda

count

6

129

Matrix-2-String

chr

enumerate

sum

join

if-comprehension

2

bregex

Compress List

S

re.S

bytes

re.sub

sub

13

3

Product with Zero

Loading Cargo

zip

min

abs

lambda

sum

15

Recursive Balance (73)

Loading Cargo

min

abs

lambda

inline-if

comprehension

16

1

Accumulate Permutations

Loading Cargo

min

abs

sum

comprehension

17

1

< veky

Xs and Os Referee

max

lambda

join

if-comprehension

range

18

5

1

First

Frequency Sorting

count

sorted

True

18

± timestamp

Lightbulb Intro

enumerate

sum

comprehension

O(1) space generator

Replace Last

iter

yield

for

2 short lines

Sort Except Zero

None

sorted

and

5

Elephant in Cairo - Fast all-rounder - With benchmarks

Remove All After

index

not

if

2

Simpler Elephant

Remove All After

pop

index

append

2

First

Determine the Order

strip

all

lstrip

break

sorted

min :-D

The Greatest Common Divisor

set-comp

min

or

while

comprehension

1

18

13

Simple simulation

Ulam–Warburton Automaton

set-comp

collections.Counter

Counter

collections

if-comprehension

1

10

2

9-liner: easily up to 10**10000

Ulam–Warburton Automaton

while

int

1

5

1

EAFP: Easier to Ask For Pattern

Collatz Ztalloc

type

is

inline-if

while

and

1

4

19

Complex nails

Ulam-Warburton Automaton Hex

set-comp

collections.Counter

Counter

collections

if-comprehension

2

17

8

Can't be bothered...

Currency Style

re.sub

sub

r-string

re

replace

2

9

2

2D Recursion (96)

Determinant

pop

lambda

or

list-comp

comprehension

2

5

1

Top-down

Postfix Evaluation

reversed

is

index

2

1

Shortest? 52 - Kill me now

Fizz Buzz

repr

lambda

3

75

16

Simple simulation

Toothpicks

set-comp

collections.Counter

Counter

items

collections

3

7

Repeeeaaat

Bigger Together

map

lambda

sorted

join

int

4

25

4

Actual chase, not cheating like everyone else!

Achilles and the Tortoise

range

for

4

7

Cookie Recipe

Determinant

lambda

sum

range

list

comprehension

15

whatever

Cut Sentence

rfind

max

len

if

19

2

14

Forgive me, for I have sinned

Postfix Evaluation

eval

type

f-string

pop

except

First

Longest Common Prefix

itertools.accumulate

accumulate

intersection

itertools

map

mildm + min + max

Longest Common Prefix

startswith

min

max

not

while

1

Functional

Longest Common Prefix

itertools.accumulate

accumulate

startswith

filter

itertools

Fraction

Bigger Together

Fraction

fractions.Fraction

fractions

map

lambda

1

rfind variations...

Cut Sentence

rfind

inline-if

len

if

2

15

obviously

Best Stock

get

max

1

short and clear

Roman Numerals

zip

split

for

1

752

61

Bellman–Ford-ish (short)

How to Find Friends

set

in

split

for

if

2

177

15

Short O(n)

Counting Tiles

map

max

sum

list-comp

range

2

5

Trial of the centurifuge

The Centrifuge Problem

all

not

False

and

True

2

3

4 problems 1 solution

Long Repeat

set

not

lambda

count

or

3

36

2

two one-liners

Reverse Roman Numerals

enumerate

count

or

sum

in

3

26

11

sum map __contains__

Monkey Typing

map

lower

lambda

sum

3

18

2

Second

The Centrifuge Problem

sympy.primefactors

primefactors

sympy

False

and

5

1

It's a sign

Reveal the Number

eval

float

None

isdigit

not

9

5

1

Unicode-Find algorithm

Count Chains

chr

map

enumerate

replace

set

17

Story Time

How to Find Friends

setdefault

inline-if

split

for

if

18

2

3

First

Morse Encoder

get

upper

map

join

2

code reuse ftw

Reverse Roman Numerals

zip

map

index

split

range

9

No initial flattening

15-puzzle Solvability

bisect.insort

insort

bisect

enumerate

index

1

16

1

1 line

15-puzzle Solvability

remove

index

lambda

sum

range

1

Calculate distances

Bishop vs Aliens

math.gcd

gcd

pow

float

tuple

1

Shorter than htamas'

Multiplication Table

bin

lambda

len

3

12

1

modified ale1ster

Digits Doublets

zip

sum

if-comprehension

list-comp

comprehension

5

7

3

Short

15-puzzle Solvability

remove

index

bool

not

sum

10

1

First

Bishop vs Aliens

tuple

break

bool

not

in

10

2D Recursion

Multiplication Table

lambda

and

15

3

1

4 problems 1 solution

Long Non Repeat

set

not

lambda

count

or

1

simple

Merge Intervals

max

not

or

append

for

1

61

4

First

Simplify Unix Path

startswith

or

join

and

append

1

19

4

Another simple oneliner

Create Intervals

zip

sorted

if-comprehension

list

comprehension

2

93

8

veky + DiZ + Stefan

Solution for Anything

dir

id

type

dict-comp

comprehension

2

50

16

Next →

The Highest Building

any

map

index

sum

2

37

8

Lists are easier to update

Merge Intervals

tuple

map

max

not

or

2

36

3

Shortest? (54)

The End of Other

endswith

any

tuple

lambda

comprehension

2

30

22

Store paths **in matrix**

Open Labyrinth

zip

for

if

3

25

1

Meh

Solution for Anything

class

lambda

True

4

35

code reuse reuse

Merge Intervals

zip

pop

max

4

2

4

Small

Merge Intervals

max

not

or

for

if

5

2

[old] oneliner, should be O(n)

Create Intervals

itertools.count

count

sorted

10

3

XOR

The End of Other

endswith

any

lambda

comprehension

11

5

7

bit brute

Painting Wall

set-comp

any

zip

sum

sorted

14

5

4 problems 1 solution

Long Repeat Inside

set

not

lambda

count

or

1

10

simple oneliner, should be O(n) (see comments)

Create Intervals

itertools.count

count

sorted

2

punchline

Create Intervals

tuple

zip

map

max

not

3

swapcase

Atbash Cipher

methodcaller

operator.methodcaller

swapcase

ascii_letters

string.ascii_letters

1

25

1

Brute Force

e+pi

OverflowError

eval

itertools.product

product

float

1

8

2

Fixed?

Frogs Collision

operator.sub

operator

sub

map

or

1

5

4

Meh

URL Normalization

match

re.match

re.sub

sub

chr

2

11

Short(77): eval('*'.join(str(i)))

Numbers Factory

eval

join

if-comprehension

2

8

1

Permutations (6 lines)

Place Queens

set-comp

ord

zip

set

and

2

6

1

Brute Force 2

e+pi

OverflowError

itertools.permutations

permutations

eval

itertools.product

3

4

Findt

Frogs Collision

operator.sub

operator

sub

map

or

3

1

4

2.7 times faster than built-in max

Maximum Among Three

inline-if

4

1

I'm sure you'll agree

The Best Number Ever

lambda

split

int

5

43

11

Simulated Annealing

Three Points Circle

random.random

random

rstrip

float

format

7

4

Secomplex

Frogs Collision

operator.sub

complex

operator

sub

round

13

2

Less meh

Revorse the vewels

upper

pop

lower

inline-if

join

Short(90): Recursive

Numbers Factory

repr

lambda

inline-if

and

int

Regex

Revorse the vewels

re.sub

sub

findall

re.findall

islower

Fake Newb!

The Best Number Ever

while

in

range

7

6

5 versions

Sort Sorted Groups

is

sort

None

not

or

1

The Equalizer

Common Tail

pop

max

while

len

if

amidoinitrite

The Best Number Ever

float

lambda

3

12

regex oneliner

Double Substring

findall

re.findall

r-string

map

re

1

74

9

4 problems 1 solution

Double Substring

set

not

lambda

count

or

2

31

9

Shortest?

Golden Pyramid

max

lambda

len

2

25

1

Short fast non-recursive lambda

Golden Pyramid

reversed

zip

max

lambda

list-comp

2

17

1

Math + 88

Simple Areas

lambda

or

3

12

1

Short, fast, recursive

Golden Pyramid

zip

max

lambda

list-comp

comprehension

3

11

61 (was: "Shortest?")

House Password

upper

isalpha

lower

lambda

len

5

28

3

112

Digit Stack

lambda

inline-if

sum

int

len

7

4

1

50 (based on przemyslaw.daniel's 62 and artakase's 59)

House Password

set-comp

ord

lambda

comprehension

len

9

18

8

Short

Mind Switcher

popitem

get

pop

while

for

1

24

21

There is one obvious way to do it. Even when you're not Dutch.

List Beautify

f-string

zip

max

join

list-comp

82

Auto Painting

repr

min

lambda

9

1

YELLING IS GOOD

Restricted Sum

exec

lower

Mathematical

Restricted Sum

sum

6

Short, Simple, Efficient

Stair Steps

max

lambda

inline-if

1

6

1

Short, Simple, Efficient, Clear

Stair Steps

max

for

2

82

4

64, using reduce

Stair Steps

functools.reduce

reduce

functools

max

lambda

4

5

2

lambda lambda reduce lambda

Min and Max

gt

operator.gt

lt

operator.lt

operator

6

15

veky - 3 + fast

Weekend Counter

lambda

sum

comprehension

13

3

1

Recursive Cycle, Short

The Angles of a Triangle

round

lambda

sorted

and

1

2

meh

Palindromic Palindrome

lambda

Duh

Completely Empty

all

map

except

try

False

1

92

16

Short backwards DFS

One line Drawing

set-comp

remove

min

count

or

1

16

2

lambduh

Completely Empty

exec

lambda

or

4

3

1

4 lines

Rolling 🎲!

replace

int

str

for

1

5

Single dict lookup per move

Rolling 🎲!

functools.reduce

reduce

functools

get

dict

2

1

Seriously?

Champernowne Word

None

count

int

3

4

n=10^9 in 2 minutes

Ugly Numbers

itertools.repeat

repeat

collections.deque

deque

itertools

4

2

Second

Champernowne Word

while

int

str

4

Short with Unicode and other tricks

Behind 2048

re.sub

sub

chr

r-string

ord

8

1

This is BS

Ugly Numbers

while

else

int

if

8

2

WWW

Rolling 🎲!

replace

int

str

for

if

15

2

list > str

Champernowne Word

while

int

str

len

1

2 short

Ugly Numbers

heapq.merge

merge

heappush

heapq.heappush

heappop

3

re.sub

Unique Email Addresses

set-comp

re.sub

sub

r-string

re

1

21

11

del a[-1:]

Backspace Apply

join

append

else

str

for

1

11

4

Short BFS

Anagrams By Stacks

frozenset

add

items

set

not

1

11

Generator Fun

Network Loops

collections.defaultdict

defaultdict

yield

add

collections

1

3

1

another numpy

Mono Captcha

numpy.reshape

reshape

numpy.array

array

3

4

Short, Simple, Speedy

Reverse Engineer

Fraction

fractions.Fraction

fractions

eval

set-comp

2

1

4

re.subn

Backspace Apply

re.subn

subn

re

not

while

6

5

Simple O(sqrt),10**14 in 2.7 seconds

Count Consecutive Summers

not

while

if

9

3

2

Patience...

Excel Column Number

indexOf

operator.indexOf

itertools.count

from_iterable

itertools.from_iterable

3

accumulate(min)

Stock Profit

itertools.accumulate

accumulate

operator.sub

operator

sub

Short (10 lines)

Convex Hull

map

pop

index

or

sorted

1

9

1

Simple

Bacteria Colonies

itertools.product

product

collections.Counter

Counter

itertools

3

11

4

78

Number Guess

all

max

lambda

range

comprehension

10

Something from Nothing

Funny Addition

ljust

map

lambda

join

len

4

Just act dumb.

Number Guess

all

range

comprehension

len

for