21 lines
1.8 KiB
Markdown
21 lines
1.8 KiB
Markdown
|
## Relevant articles:
|
||
|
|
|
||
|
|
- [Validating Input With Finite Automata in Java](http://www.baeldung.com/java-finite-automata)
|
||
|
|
- [Example of Hill Climbing Algorithm](http://www.baeldung.com/java-hill-climbing-algorithm)
|
||
|
|
- [Monte Carlo Tree Search for Tic-Tac-Toe Game](http://www.baeldung.com/java-monte-carlo-tree-search)
|
||
|
|
- [Binary Search Algorithm in Java](http://www.baeldung.com/java-binary-search)
|
||
|
|
- [Introduction to Minimax Algorithm](http://www.baeldung.com/java-minimax-algorithm)
|
||
|
|
- [How to Calculate Levenshtein Distance in Java?](http://www.baeldung.com/java-levenshtein-distance)
|
||
|
|
- [How to Find the Kth Largest Element in Java](http://www.baeldung.com/java-kth-largest-element)
|
||
|
|
- [Multi-Swarm Optimization Algorithm in Java](http://www.baeldung.com/java-multi-swarm-algorithm)
|
||
|
|
- [String Search Algorithms for Large Texts](http://www.baeldung.com/java-full-text-search-algorithms)
|
||
|
|
- [Check If a String Contains All The Letters of The Alphabet](https://www.baeldung.com/java-string-contains-all-letters)
|
||
|
|
- [Find the Middle Element of a Linked List](http://www.baeldung.com/java-linked-list-middle-element)
|
||
|
|
- [Calculate Factorial in Java](https://www.baeldung.com/java-calculate-factorial)
|
||
|
|
- [Find Substrings That Are Palindromes in Java](https://www.baeldung.com/java-palindrome-substrings)
|
||
|
|
- [Find the Longest Substring without Repeating Characters](https://www.baeldung.com/java-longest-substring-without-repeated-characters)
|
||
|
|
- [Java Two Pointer Technique](https://www.baeldung.com/java-two-pointer-technique)
|
||
|
|
- [Permutations of an Array in Java](https://www.baeldung.com/java-array-permutations)
|
||
|
|
- [Implementing Simple State Machines with Java Enums](https://www.baeldung.com/java-enum-simple-state-machine)
|
||
|
|
- [Generate Combinations in Java](https://www.baeldung.com/java-combinations-algorithm)
|