In this post we’ll show a practical example of processing tree-like structure using streams and Java 8 flatMap.
As many other algorithms in Linked List – remove element from given position runs in linear time. Here we are going to implement it to better understand how it works.
In this post we’ll implement another algorithm for Linked List – insert element at position. The algorithm works in linear time in the worst case.
Linked List is a simple data structure. Implementing it from scratch helps to understand its properties. We’ll implement Linked List add, size, and print its contents.
There are many ways to create Java Streams and for each of them we’ll show examples. This flexibility is needed especially when combined with flatMap!
One of the best known algorithms to detect a cycle in a linked list is Floyd Cycle detection. Using Floyd’s algorithm we can detect cycle, its beginning, and length.
Shuffling of arrays/lists sounds like a trivial task, but in reality it’s full of subtle traps. Here we show how to implement Fisher-Yates Shuffle Algorithm in Java.
To calculate MD5 hash in Java we can use pure Java approach or use libraries. In this post we’re going to show how to calculate Message Digest in different ways.
Spring Framework is really great when it comes to i18n. It applies different strategies to get user’s locale from request. In this post we’ll show how apply that!
Divide and Conquer algorithms are great subject for parallelism. Here we present Parallel Merge Sort implemented using Java ForkJoin Framework.