Jens Neuhalfen

This & That

Random Ramblings about Life, the Universe, and Everything

Bouncy GPG 2.2.0 released

bouncy-gpg 2.2.0, now with key generation

[Jens Neuhalfen]

5 minutes read

After more than one year of (slow..) development I am happy to announce the release of bouncy-gpg 2.2.0.

Testing the compatibility of gpg and bouncy-gpg

For bouncy-gpg I needed to assert compatibility with gnupg. This means a lot of shelling out gpg.

[Jens Neuhalfen]

5 minutes read

Driving an external program from java and parsing its output is seldom needed. When it is needed, in often means: no stable API (changes in command output), configuration files, sporadic errors, and orchestrating parallel execution. To test the compatibility with gpg I needed to drive the GnuPG executable.

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.

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.