DiracRules profile - python coding challenges

DiracRules

[Follow]

● 7 ● 17

443/ 545

Last seen 9 years ago

Member for 10 years, 22 days

Difficulty Normal

Hi all! I'm an Italian student of MSc. in Physics Engineering. I started programming at University with C, but soon my main tool for "programming" has become MATLAB, since I use it to analyse things I study in the class. I like programming for 2 reasons: it allows me to implement codes to study physics and it requires me to understand how our mind constructs algorithms. Thus, I am the kind of programmer (though I can't see myself in this way) that doesn't look for the most compact code, but for the easiest to implement and the most straightforward. Nonetheless, I can appreciate clever solutions and I can see the beauty in them :D

Missions (41) / Solutions (42)

Best solutions / Newest solutions

Plain, simple solution

Non-unique Elements

count

append

for

First (plain)

Three Words

isalpha

isdigit

False

True

split

First

Even the Last

lambda

inline-if

sum

First

Verify Anagrams

values

any

replace

not

lower

First

Digits Multiplication

int

str

for

First (with fors and ifs)

Brackets

values

keys

any

not

elif

First

The Most Wanted Letter

keys

isalpha

lower

count

elif

First

Letter Queue

find

not

else

for

With a little help from "a friend"...

Striped Words

isalnum

upper

find

not

lambda

First

Common Words

intersection

set

lambda

sorted

join

First

Absolute Sorting

abs

lambda

sorted

First

Striped Words

isalnum

all

upper

not

lambda

First

Secret Message

isupper

for

First

Morse Clock

isdecimal

keys

dict

bin

inline-if

One liner

Index Power

lambda

inline-if

len

Check with for loops and ifs

Xs and Os Referee

not

elif

and

range

for

First

Median

float

sorted

else

len

Second

Median

float

sorted

else

len

Recursion again :D

Disposable Teleports

insert

all

map

lambda

inline-if

First

Binary Count

bin

count

Plain solution, nothing special

Fizz Buzz

not

and

str

First

The Most Numbers

min

max

inline-if

len

First, cumbersome solution

Feed Pigeons

lambda

inline-if

while

int

First

Roman Numerals

zip

replace

lambda

list

for

First

Transposed Matrix

append

range

len

for

First

The End of Other

endswith

False

and

True

for

With a cumbersome recursion...

Open Labyrinth

pop

count

elif

False

First

Numbers Factory

startswith

any

not

elif

range

First

Speech Module

strip

elif

else

First (with recursion)

Golden Pyramid

max

len

Maybe too verbose

Network Attack

union

set-comp

any

lambda

while

First

Digit Stack

pop

inline-if

elif

append

else

Quick 'n' easy

House Password

islower

all

isupper

isdigit

One-liner

Weak Point

zip

index

min

lambda

sum

Easy with recursion :D

Restricted Sum

not

lambda

inline-if

First

The Hamming Distance

format

zip

map

lambda

inline-if

First

Number Base

raise

ValueError

find

except

try

One-liner

The Angles of a Triangle

math.acos

acos

math.pi

First

Radiation Search

copy.deepcopy

deepcopy

copy

index

max

First

Weekend Counter

range

for

First

Pearls in the Box

float

round

count

First

The Square Chest

sorted

while

append

list-comp

range