Quarkus Framework for Java

Fault Tolerance in Quarkus

Systems can face issues, including failures in one or more components. For example, external APIs and databases may fail. This can cause a major negative impact on the system, which is why there are ways to handle these failures. Quarkus uses the SmallRye Fault Tolerance specification to make the system more resilient. These techniques are…

Read More
OpenRewrite

How OpenRewrite Turns Legacy Java into Modern Java?

Maintaining a Java system up to date is not just a matter of performance or access to new features — it is a matter of security, support, and software longevity. However, migrating a project from an older Java version to a newer one usually involves a significant manual effort: refactoring code, adapting APIs, reviewing thousands…

Read More

🚀 Topics, Partitions, and Offsets in Kafka — How do they work?

Kafka is currently one of the most widely used streaming platforms in the world.But to use it effectively, you need to master three essential concepts: These three elements form the foundation of how Kafka’s entire architecture works. Let’s break each one down with simple examples, real-world scenarios, and analogies. 1. What Is a Topic in…

Read More
Java

How to save memory when declaring Strings in Java?

String is a very commonly used type in Java, and it is extremely important to understand how it works. We can easily declare a String, for example: The question is: what happens when we declare a String this way? Because we can also declare it like this: In this article, we will look at the…

Read More

How does work Asymptotic Notations for Analysis of Algorithms?

When we develop algorithms, one of the biggest concerns is efficiency: how long it takes to run and how much memory it consumes. But measuring efficiency in absolute numbers (seconds or megabytes) is not enough, because these values change depending on the machine, the compiler, and even small code adjustments. That’s where Asymptotic Notation comes…

Read More

🧠 Understanding Stacks in Java with a Real Example

When working with algorithms, data structures like Stacks play a crucial role in solving problems efficiently. A Stack follows a simple but powerful principle: LIFO (Last In, First Out) — the last element you add is the first one to be removed. Think of a stack like a pile of books: you can only remove…

Read More
Java

How to Grouping and restricting constraints using Bean Validation?

We already know that the Bean Validation specification is very helpful for performing validations. There is also the possibility of validating using groups. Imagine the following scenario: a DTO for products and another one for categories, as in the following example: When trying to register a product by specifying the category id, we encounter an…

Read More
Java

What is Java Bean Validation and how to use it?

Bean Validation is a specification for performing validations in Java and can have multiple implementations. To avoid writing repetitive validation code, Java provides Bean Validation (standard specified by JSR 380, also known as Jakarta Bean Validation), which allows applying rules directly to class attributes using annotations. When developing Java applications, it is common to validate…

Read More
AWS

🚀 Introduction to Amazon EC2 (Elastic Compute Cloud)

Amazon EC2 (Elastic Compute Cloud) is one of the most popular and foundational services in AWS. It allows you to create and manage virtual machines (instances) in the cloud with ease, scalability, and full control over the operating system, storage, and networking. With EC2, you can run anything from small web applications to high-performance systems,…

Read More

Why is it important to study data structures and algorithms?

One day I was talking to a friend who is learning programming. I suggested solving a problem to check whether a word or phrase is a palindrome. We entered a prompt asking to AI for this and received a response using Java’s StringBuilder. The solution was correct, but with a more critical eye, I thought…

Read More