forked from eugenp/tutorials
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[BAEL-16630] - Split or move algorithms-miscellaneous-1 module (eugen…
…p#7699) * [BAEL-16630] - Split or move algorithms-miscellaneous-1 module * [BAEL-16630] - Removed .gitignore file and changed all links to https
- Loading branch information
Showing
26 changed files
with
82 additions
and
20 deletions.
There are no files selected for viewing
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,18 +1,9 @@ | ||
## 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) | ||
- [Permutations of an Array in Java](https://www.baeldung.com/java-array-permutations) | ||
- [Generate Combinations in Java](https://www.baeldung.com/java-combinations-algorithm) | ||
- [Validating Input With Finite Automata in Java](https://www.baeldung.com/java-finite-automata) | ||
- [Example of Hill Climbing Algorithm](https://www.baeldung.com/java-hill-climbing-algorithm) | ||
- [Monte Carlo Tree Search for Tic-Tac-Toe Game](https://www.baeldung.com/java-monte-carlo-tree-search) | ||
- [Binary Search Algorithm in Java](https://www.baeldung.com/java-binary-search) | ||
- [Introduction to Minimax Algorithm](https://www.baeldung.com/java-minimax-algorithm) | ||
- [How to Calculate Levenshtein Distance in Java?](https://www.baeldung.com/java-levenshtein-distance) | ||
- [How to Find the Kth Largest Element in Java](https://www.baeldung.com/java-kth-largest-element) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,9 @@ | ||
## Relevant articles: | ||
|
||
- [Multi-Swarm Optimization Algorithm in Java](https://www.baeldung.com/java-multi-swarm-algorithm) | ||
- [String Search Algorithms for Large Texts](https://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](https://www.baeldung.com/java-linked-list-middle-element) | ||
- [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) | ||
- [Permutations of an Array in Java](https://www.baeldung.com/java-array-permutations) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,51 @@ | ||
<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" | ||
xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd"> | ||
<modelVersion>4.0.0</modelVersion> | ||
<artifactId>algorithms-miscellaneous-4</artifactId> | ||
<version>0.0.1-SNAPSHOT</version> | ||
<name>algorithms-miscellaneous-4</name> | ||
|
||
<parent> | ||
<groupId>com.baeldung</groupId> | ||
<artifactId>parent-modules</artifactId> | ||
<version>1.0.0-SNAPSHOT</version> | ||
</parent> | ||
|
||
<dependencies> | ||
<dependency> | ||
<groupId>com.google.guava</groupId> | ||
<artifactId>guava</artifactId> | ||
<version>${guava.version}</version> | ||
</dependency> | ||
<dependency> | ||
<groupId>org.projectlombok</groupId> | ||
<artifactId>lombok</artifactId> | ||
<version>${lombok.version}</version> | ||
<scope>provided</scope> | ||
</dependency> | ||
<dependency> | ||
<groupId>org.assertj</groupId> | ||
<artifactId>assertj-core</artifactId> | ||
<version>${org.assertj.core.version}</version> | ||
<scope>test</scope> | ||
</dependency> | ||
</dependencies> | ||
|
||
<build> | ||
<pluginManagement> | ||
<plugins> | ||
<plugin> | ||
<groupId>org.codehaus.mojo</groupId> | ||
<artifactId>exec-maven-plugin</artifactId> | ||
<version>${exec-maven-plugin.version}</version> | ||
</plugin> | ||
</plugins> | ||
</pluginManagement> | ||
</build> | ||
|
||
<properties> | ||
<org.assertj.core.version>3.9.0</org.assertj.core.version> | ||
<guava.version>27.0.1-jre</guava.version> | ||
</properties> | ||
|
||
</project> |
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,13 @@ | ||
<?xml version="1.0" encoding="UTF-8"?> | ||
<configuration> | ||
<appender name="STDOUT" class="ch.qos.logback.core.ConsoleAppender"> | ||
<encoder> | ||
<pattern>%d{HH:mm:ss.SSS} [%thread] %-5level %logger{36} - %msg%n | ||
</pattern> | ||
</encoder> | ||
</appender> | ||
|
||
<root level="INFO"> | ||
<appender-ref ref="STDOUT" /> | ||
</root> | ||
</configuration> |
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters