Last time we saw how to find the maximum achievable value in a situation where two players alternate in picking items from an array boundar...

Here's a simple game: gold pots with different amounts of coins are placed in a single line. Two players alternate in choosing one pot t...

Well of course we could just convert the number to String and take it up from there, but since we're real men who know about the modulo ...

Some more Java byte type related fun, how to count the number of bits set to 1 in a given byte. public int count(){ int tot = 0; ...

First of all let's start by saying that quite counter intuitively, Boolean in Java is not a single bit but either a 32 or 64 bit entity...

Regular expressions are a pain, until they are not . Implementing a matcher is a double pain, and possibly the hardest exercise I've se...

The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite sequence. It can be coded to run in-place and in O...