Jens Neuhalfen

This & That

Random Ramblings about Life, the Universe, and Everything


LeetCode #746 : Min cost climbing stairs

60 ms, faster than 44.27%

[Jens Neuhalfen]

5 minutes read

On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).

LeetCode #931. Minimum Falling Path Sum

132 ms, faster than 38.27%

[Jens Neuhalfen]

5 minutes read

Given a square array of integers A, we want the minimum sum of a falling path through A.

LeetCode #8 : String to Integer (atoi)

Solution in python3: 28 ms, faster than 93.82% (plus python profiling)

[Jens Neuhalfen]

19 minutes read

This problem is quite simple and does not allow for many algorithmic improvements. In fact it would be difficult to come up with a non-optimal (bigger than \(O(n)\)) solution. This makes this problem a good candidate for benchmarking.

LeetCode #10 : Regular Expression Matching

solution in python3: 44 ms, faster than 86.57%, Memory Usage: 12.7 MB, less than 100.00%

[Jens Neuhalfen]

10 minutes read

Given an input string (s) and a pattern (p), implement regular expression matching with support for . and *.

LeetCode #23 : Merge k Sorted Lists

$O(n * log(k))$ solution in python3: faster than 83.12%

[Jens Neuhalfen]

8 minutes read

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Recent posts

See more



Information security and software development are enablers for a successful company. During the last 20+ years of my working life I have always been convinced that outstanding success is only possible if everybody works together to find and reach a common goal.