A quick and practical guide to finding the k-th smallest element in two sorted arrays.
I'm a Java Software Developer with 12 years experience in the financial industry. I like clean coding, learning new languages (both programming and natural languages) and reading about and understanding algorithms. My main focus is Java, Java EE, Spring, Databases and Kotlin.
Here's what I've written (so far):
A quick and practical guide to lock-free data structures in Java.
Learn about the @Before, @BeforeStep, @AfterStep, and @After Cucumber hooks
A quick and practical overview of overflow and underflow in Java.
A quick and practical overview of Java HashMap.
Learn how to use request parameters with Spring and Thymeleaf.
A quick and practical overview of the difference between Collection.stream().forEach() and Collection.forEach().
A quick and practical overview of the concept of Ahead of Time Compilation.
Baeldung on Computer Science
Explore algorithms for generating a maze with visual representations.
A quick and practical introduction to idempotency.
A quick and practical overview of the Red-Black Tree data structure.
Baeldung on Kotlin
A quick and practical overview of differences between var keyword in Java and Kotlin.
Have a look at the @Jvm annotations that Kotlin provides