See how to implement a basic maze solver in Java.
Here's what I've written (so far):
Baeldung on Java
- All
- Algorithms (2)
- Networking (1)
- Java Concurrency (1)
- Java Collections (1)
How to Calculate Levenshtein Distance in Java?
Filed under Algorithms
Discover performant methods of calculating the Levenshtein distance.
Test a Linked List for Cyclicity
Filed under Java Collections
Learn about a couple of ways of detecting and removing cycles in a linked list.
Broadcasting and Multicasting in Java
Filed under Networking
Learn how one-to-all (broadcast) and one-to-many (multicast) communications can be handled in Java.
An Introduction to Atomic Variables in Java
Filed under Java Concurrency
Learn how to use atomic variables for solving concurrency issues.