Skip to content

[DOC] Markdown files moved to their own directory. #96

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 23, 2023
Merged

[DOC] Markdown files moved to their own directory. #96

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 5 additions & 8 deletions algorithm-exercises-java/src/main/java/ae/Problem0000.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,18 +1,15 @@
// CHECKSTYLE.OFF: JavadocParagraph
/**
* {TITLE}.
*
* ////////////////////////////////////////////////////////////////////////////
* Result found:
* ////////////////////////////////////////////////////////////////////////////
*/
/// ////////////////////////////////////////////////////////////////////////////
// Result found:
/// ////////////////////////////////////////////////////////////////////////////

package ae;

import java.text.MessageFormat;

/**
* {TITLE}.
*
* @link Problem definition [[docs/hackerrank/problem0000.md]]
*/
public class Problem0000 {

Expand Down
15 changes: 3 additions & 12 deletions algorithm-exercises-java/src/main/java/ae/hackerrank/SolveMeFirst.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,18 +1,11 @@
// CHECKSTYLE.OFF: JavadocParagraph
/**
* SolveMeFirst.
*
* ////////////////////////////////////////////////////////////////////////////
* Result found:
* ////////////////////////////////////////////////////////////////////////////
*/

package ae.hackerrank;

import java.text.MessageFormat;

/**
* SolveMeFirst.
* Solve Me First.
*
* @link Problem definition [[docs/hackerrank/SolveMeFirst.md]]
*/
public class SolveMeFirst {

Expand All @@ -37,5 +30,3 @@ public static Integer solveMeFirst(Integer[] inputs) {
return total;
}
}

//CHECKSTYLE.ON: JavadocParagraph
7 changes: 2 additions & 5 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0001.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,12 +1,12 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import java.text.MessageFormat;
import java.util.logging.Logger;

/**
* Multiples of 3 and 5.
*
* @link Problem definition [[docs/projecteuler/problem0001.md]]
*/
public class Problem0001 {

Expand All @@ -15,7 +15,6 @@ private Problem0001() {}
static Logger logger = ae.projecteuler.util.CustomLogger.getLogger();

/**
*
* Problem0001.
*/
public static Integer problem0001(Integer top) {
Expand All @@ -37,5 +36,3 @@ public static Integer problem0001(Integer top) {
return result;
}
}

//CHECKSTYLE.ON: JavadocParagraph
6 changes: 2 additions & 4 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0002.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,12 +1,12 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import java.text.MessageFormat;
import java.util.logging.Logger;

/**
* Even Fibonacci numbers.
*
* @link Problem definition [[docs/projecteuler/problem0002.md]]
*/
public class Problem0002 {

Expand Down Expand Up @@ -48,5 +48,3 @@ public static Integer problem0002(int top) {
}

}

//CHECKSTYLE.ON: JavadocParagraph
9 changes: 3 additions & 6 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0003.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,14 +1,13 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import ae.projecteuler.helper.Divisors;
import ae.projecteuler.helper.NaturalNumber;
import java.util.Arrays;


/**
* Problem0003.
* Largest prime factor.
*
* @link Problem definition [[docs/projecteuler/problem0003.md]]
*/
public class Problem0003 {

Expand Down Expand Up @@ -56,5 +55,3 @@ public static Long problem0003(Long top) {
}

}

//CHECKSTYLE.ON: JavadocParagraph
6 changes: 2 additions & 4 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0004.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
// CHECKSTYLE.OFF: JavadocParagraph

/// ////////////////////////////////////////////////////////////////////////////
// NOTES ABOUT THE SOLUTION:
// This solution cycles to test all pairs of factors between 111 and 999 that
Expand All @@ -16,6 +14,8 @@

/**
* Largest palindrome product.
*
* @link Problem definition [[docs/projecteuler/problem0004.md]]
*/
public class Problem0004 {

Expand Down Expand Up @@ -70,5 +70,3 @@ public static Integer problem0004(int bottom, int top) {
return foundPalindrome;
}
}

//CHECKSTYLE.ON: JavadocParagraph
8 changes: 3 additions & 5 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import ae.projecteuler.helper.NaturalNumber;
Expand All @@ -11,6 +9,8 @@

/**
* Smallest multiple.
*
* @link Problem definition [[docs/projecteuler/problem0005.md]]
*/
public class Problem0005 {

Expand All @@ -33,7 +33,7 @@ public static Map<Long, Integer> countOccurrences(List<Long> numbers) {
return occurrences;
}

/***
/**
* mixOccurrences.
*/
public static Map<Long, Integer> mixOccurrences(
Expand Down Expand Up @@ -94,5 +94,3 @@ public static Integer problem0005(Integer bottom, Integer top) {
}

}

//CHECKSTYLE.ON: JavadocParagraph
2 changes: 2 additions & 0 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005Simple.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,8 @@

/**
* Smallest multiple.
*
* @link Problem definition [[docs/projecteuler/problem0005.md]]
*/
public class Problem0005Simple {

Expand Down
9 changes: 5 additions & 4 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0006.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
// CHECKSTYLE.OFF: JavadocParagraph

// ////////////////////////////////////////////////////////////////////////////
// Solution found:
// Sum of first 100 squares = 338350
Expand All @@ -10,6 +8,11 @@

package ae.projecteuler;

/**
* Sum square difference.
*
* @link Problem definition [[docs/projecteuler/problem0006.md]]
*/
class Problem0006 {

private Problem0006() {}
Expand Down Expand Up @@ -55,5 +58,3 @@ public static Integer problem0006(Integer bottom, Integer top) {
}

}

//CHECKSTYLE.ON: JavadocParagraph
6 changes: 2 additions & 4 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0007.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import ae.projecteuler.helper.NaturalNumber;
Expand All @@ -8,6 +6,8 @@

/**
* 10001st prime.
*
* @link Problem definition [[docs/projecteuler/problem0007.md]]
*/
public class Problem0007 {

Expand Down Expand Up @@ -49,5 +49,3 @@ public static Integer problem0007(Integer top) {
return answer;
}
}

//CHECKSTYLE.ON: JavadocParagraph
6 changes: 2 additions & 4 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0008.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import ae.projecteuler.helper.Product;
Expand All @@ -8,6 +6,8 @@

/**
* Largest product in a series.
*
* @link Problem definition [[docs/projecteuler/problem0008.md]]
*/
public class Problem0008 {

Expand Down Expand Up @@ -47,5 +47,3 @@ public static Long problem0008(String number, Integer interval) {
return max;
}
}

//CHECKSTYLE.ON: JavadocParagraph
6 changes: 2 additions & 4 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0009.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,11 +1,11 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import java.text.MessageFormat;

/**
* Special Pythagorean triplet.
*
* @link Problem definition [[docs/projecteuler/problem0009.md]]
*/
public class Problem0009 {

Expand Down Expand Up @@ -76,5 +76,3 @@ public static Integer problem0009(Integer limit) {
return found.ta * found.tb * found.tc;
}
}

//CHECKSTYLE.ON: JavadocParagraph
6 changes: 2 additions & 4 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0010.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import ae.projecteuler.helper.NaturalNumber;
Expand All @@ -9,6 +7,8 @@

/**
* Summation of primes.
*
* @link Problem definition [[docs/projecteuler/problem0010.md]]
*/
public class Problem0010 {

Expand Down Expand Up @@ -45,5 +45,3 @@ public static Long problem0010(Long bottom, Long top) {
return result;
}
}

//CHECKSTYLE.ON: JavadocParagraph
8 changes: 3 additions & 5 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0011.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,11 +1,11 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import java.text.MessageFormat;

/**
* Problem 0011.
* Largest product in a grid.
*
* @link Problem definition [[docs/projecteuler/problem0011.md]]
*/
public class Problem0011 {

Expand Down Expand Up @@ -93,5 +93,3 @@ public static Integer problem0011(Integer[][] squareMatrix, Integer interval)
return result;
}
}

//CHECKSTYLE.ON: JavadocParagraph
6 changes: 2 additions & 4 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0012.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,11 +1,11 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import ae.projecteuler.helper.Divisors;

/**
* Problem 0012.
*
* @link Problem definition [[docs/projecteuler/problem0012.md]]
*/
public class Problem0012 {

Expand Down Expand Up @@ -44,5 +44,3 @@ public static Long problem0012(Long top) {
return count;
}
}

//CHECKSTYLE.ON: JavadocParagraph
8 changes: 3 additions & 5 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0013.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import ae.projecteuler.helper.BigNum;
Expand All @@ -9,7 +7,9 @@


/**
* Problem 0013.
* Large sum.
*
* @link Problem definition [[docs/projecteuler/problem0013.md]]
*/
public class Problem0013 {

Expand Down Expand Up @@ -40,5 +40,3 @@ public static String problem0013(String[] arrayOfNumbers, Integer firtsDigits) {
return numberString;
}
}

//CHECKSTYLE.ON: JavadocParagraph
8 changes: 3 additions & 5 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0014.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

import ae.projecteuler.helper.Collatz;
Expand All @@ -8,7 +6,9 @@


/**
* Problem 0013.
* Longest Collatz sequence.
*
* @link Problem definition [[docs/projecteuler/problem0014.md]]
*/
public class Problem0014 {
private Problem0014() {}
Expand Down Expand Up @@ -59,5 +59,3 @@ public static Long problem0014(Integer bottom, Integer top) throws IllegalArgume
return result;
}
}

//CHECKSTYLE.ON: JavadocParagraph
8 changes: 3 additions & 5 deletions algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0015.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
// CHECKSTYLE.OFF: JavadocParagraph

package ae.projecteuler;

/**
* Problem 0015.
* Lattice paths.
*
* @link Problem definition [[docs/projecteuler/problem0015.md]]
*/
public class Problem0015 {

Expand Down Expand Up @@ -44,5 +44,3 @@ public static Long problem0015(Integer gridSide) {
return result;
}
}

//CHECKSTYLE.ON: JavadocParagraph
Loading