## LeetCode #746 : Min cost climbing stairs

60 ms, faster than 44.27%

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

Random Ramblings about Life, the Universe, and Everything

60 ms, faster than 44.27%

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

132 ms, faster than 38.27%

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

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

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.

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

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

and `*`

.

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

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