38
Awesome Team
Stefan Pochmann
http://www.stefan-pochmann.info/
Last seen 1 hour ago
Member for 9 years, 1 month, 4 days
Difficulty Normal
Recent solutions I'm happy with (just starting/trying this):
[Words Order](https://py.checkio.org/mission/words-order/publications/StefanPochmann/python-3/short-dict-subsequence/share/5bbb2df54ec5a810d36d7f70ae7e92da/)
Dang it no markdown here?
Repeeeaaat-StefanPochmann
First wrote that [here](https://stackoverflow.com/questions/30140796/sort-a-list-to-form-the-largest-possible-number/30152085#comment48412717_30152085).
More
Fraction-StefanPochmann
First wrote that [here](https://stackoverflow.com/questions/30140796/sort-a-list-to-form-the-largest-possible-number/30152085#comment48455555_30152085).
More
punchline-StefanPochmann
Went a step further and reused this solution as well now:
https://py.checkio.org/mission/merge-intervals/publications/StefanPochmann/python-3/code-reuse-reuse/
More
Interesting. Is that copied from some some library, or did you write it like that only for this problem?
More
simple oneliner, should be O(n) (see comments)-StefanPochmann
I say "should be O(n)" because as mentioned above, only the output sorting makes it not O(n) and I think that's a shame. I still think that the output should be a set, that makes more sense to me because...
1) The *input* is a set.
2) The mission isn't called "create and sort intervals" but just "cr
More
Fails for example `'//./'`, returning `'//./'` instead of `'/'`. And `'//c/'`, returning `'//c/'` instead of `'/c'`.
More
4 problems 1 solution-StefanPochmann
1
The four problems are so similar that I decided to extract their common part and show all differences together.
More
4 problems 1 solution-StefanPochmann
1
The four problems are so similar that I decided to extract their common part and show all differences together.
More
4 problems 1 solution-StefanPochmann
The four problems are so similar that I decided to extract their common part and show all differences together.
More
4 problems 1 solution-StefanPochmann
1
The four problems are so similar that I decided to extract their common part and show all differences together.
Got the `repeat_inside` trick from rsrs3 [at LeetCode](https://discuss.leetcode.com/topic/68206/easy-python-solution-with-explaination).
More
61 (was: "Shortest?")-StefanPochmann
Don't know whether this was the shortest back when I posted it, but by now it isn't. Shortest I know now is my [50](https://py.checkio.org/mission/house-password/publications/StefanPochmann/python-3/50-based-on-przemyslawdaniels-62-and-artakases-59/?ordering=most_voted&filtering=all).
More
another numpy-StefanPochmann
1
Inspired by a glance at @mudax2.mojikasegi's [solution](https://py.checkio.org/mission/mono-captcha/publications/mudax2.mojikasegi/python-3/first/).
More
lambduh-StefanPochmann
Just for fun a lambda version of [my normal solution](https://py.checkio.org/mission/completely-empty/publications/StefanPochmann/python-3/duh/?ordering=most_voted&filtering=all).
More
golfing-StefanPochmann
Don't blame me for the bad test suite that allows this...
More
That `offset` feels unnatural to me, as it allows offsets that have nothing to do with the sought string, so this function combines two quite separate functionalities.
How about a boolean flag telling whether we want the end position?
```
def between_markers(text, begin, end):
"""Substring betw
More
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 ...-StefanPochmann
I wouldn't need the `len(morse[c])` if I reordered the dict items by decreasing length, but I didn't want to do that.
More
2 short-StefanPochmann
First one is my simplification of agave's, see [here](https://leetcode.com/problems/ugly-number-ii/discuss/69397/Sharing-very-simple-and-elegant-Python-solution-using-heap-with-explanation/71469).
More
