JDK 24 has its feature set frozen. This means it’s time to look at what is going to be in the release. In total 24 JEPs are included (Coincidence? I don’t think so!). Let’s skip any experimental, preview and incubating JEPs and review only the generally available ones. ...

I had to use GNU Parallel quite extensively lately. In this post I’m sharing some of its features that were most helpful to me. Here is how I used it. ...

Prefix Sum is a simple and efficient approach to calculate sums of elements of any contiguous subarray in constant time. But what if you want to update an element in the array. Now it takes O(n) to do that. Is there a way to do it faster? ...

Bloom filter is a data structure that allows to save a lot of memory when checking if an element exists in a set at the expense of some precision. Let’s see how it works and what are the guarantees. ...

The Rabin-Karp algorithm is a linear time substring searching algorithm. Let’s see how it works in theory and in practice. ...