perimeter profile - python coding challenges

genexp

Count Digits

isdigit

join

if-comprehension

comprehension

int

8

1

Counter()

The Most Frequent

collections.Counter

Counter

collections

list

str

4

Use the tuple, Luke!

Nearest Value

sort

abs

set

lambda

list

2

1

Zip it long!

Split Pairs

itertools.zip_longest

zip_longest

itertools

append

list

2

3

Use the set, Luke!

All the Same

Any

typing.Any

List

typing.List

bool

4

1

collections.Counter and dictcomp

Popular Words

collections.Counter

Counter

dict-comp

dict

collections

12

14

1

regexp

First Word

re.compile

compile

re

9

sorted with a lambda

Sort Array by Element Frequency

index

lambda

count

sorted

True

10

1

Sort it with 'price' as key. In descending order. A lambda as a sorting key is possible too, see the commented out line.

Bigger Price

itemgetter

operator.itemgetter

operator

sort

True

9

1

regexp

Backward Each Word

re.compile

compile

r-string

re

join

6

1

itertools.accumulate with special lambda

Three Words

itertools.accumulate

accumulate

any

itertools

isalpha

9

1

datetime.date()

Days Between

date

datetime.date

datetime

abs

5

1

Any guards in pawns?

Pawn Brotherhood

yield

chr

any

ord

set

4

1

listcomp

Non-unique Elements

count

if-comprehension

list-comp

list

comprehension

7

1

All pairs strictly ascending?

Ascending List

all

zip

typing.Iterable

Iterable

bool

5

1

functools.reduce()

Digits Multiplication

mul

operator.mul

operator

functools.reduce

reduce

3

1

normalize and combining

Remove Accents

combining

unicodedata.combining

normalize

unicodedata.normalize

unicodedata

6

1

Make use of re module

YAML. Simple Dict

finditer

re.finditer

dict-comp

r-string

re

5

1

Bitcoins

Call to Home

values

get

List

typing.List

typing

3

find in rows or columns

The Hidden Word

itertools.zip_longest

zip_longest

itertools

find

map

3

2

State machine

Caps Lock

re.sub

sub

r-string

upper

re

2

1

Intersection of sets

Common Words

set

sorted

join

split

str

7

2

find()

Goes Right After

find

bool

False

and

str

2

capitalize()

Conversion into CamelCase

capitalize

join

split

comprehension

str

1

isupper()

Secret Message

isupper

join

if-comprehension

comprehension

str

5

1

set()

Pangram

ascii_lowercase

string.ascii_lowercase

string

isalpha

set

2

1

Specialized sort on collections.Counter()

The Most Wanted Letter

collections.Counter

Counter

items

collections

isalpha

3

2

re.finditer()

Conversion from CamelCase

finditer

re.finditer

r-string

re

lower

1

Rename

Letter Queue

eval

pass

List

typing.List

IndexError

1

Glancing into the future

Striped Words

re.I

I

re.compile

compile

r-string

regsub() squared

Bird Language

re.sub

sub

r-string

re

lambda

Find indices of discontinuities and apply slicing

Reverse Every Ascending

reversed

zip

enumerate

if-comprehension

list-comp

14

12

Sum of timedeltas in total_seconds() from datetime pairs streamed out of zip()

Lightbulb Intro

datetime.datetime

datetime

List

typing.List

zip

5

1

subtract duration before start_watching mark from total duration

Lightbulb Start Watching

Optional

typing.Optional

datetime

1

adjacent_difference

Compress List

math.inf

inf

itertools.zip_longest

zip_longest

itertools

3

1

Sort items without zeros, then find indices of zeroes (if any) and insert zeros at original positions

Sort Except Zero

insert

index

typing.Iterable

Iterable

typing

3

convert to deque , rotate() it and convert back to list

Replace Last

collections.deque

deque

collections

list

3

1

Counter and sorted() with tuples as comparison entities

Frequency Sorting

as

collections.Counter

Counter

collections

List

for letter in word for word in words

Morse Encoder

lower

join

split

comprehension

2

3

max() - min()

The Most Numbers

min

max

6

1

SPQR

Roman Numerals

keys

while

for

5

2

findall

Find Quotes

findall

re.findall

r-string

re

1

find segments of identical consecutive characters and return length of the longest one (if any)

Long Repeat

re.compile

compile

r-string

map

re

1

How many words are in text, regardless of case

Monkey Typing

set

lower

sum

if-comprehension

in

1

Flying Rats

Feed Pigeons

min

while

True

if

dictcomp

Cookies

finditer

re.finditer

dict-comp

r-string

get

6

Maximum tuple

The Highest Building

zip

enumerate

max

sum

list-comp

6

1

regexp & set

Unique Email Addresses

set-comp

re.sub

sub

re

lower

3

9

3

Sigma(Ai*B**i)

Excel Column Number

reversed

ord

enumerate

sum

print

3

4

slicing of sorted() result

Shorter Set

None

set

inline-if

print

sorted

1