sachinlala / simplifylearning

Basic and advanced Algorithms, written in Java, built w/ Gradle, CI thru TravisCI, covered w/ JaCoCo and coverage reported thru Coveralls.

Simplify Learning

An anthology of programs to simplify understanding of foundational algorithms and basic frameworks. Written in Java, built with Gradle goodness:

• List of Algorithms
• Spring Boot 101

Stages of Learning

Stage	Visual	Description
Kihon		The basic algorithmic concepts and fundamental techniques.
Kata		Assert the learnings with rigorous practice and achieve 1+ level of proficiency.
Kumite		The assembling of basic moves into coherent sequences, leading to something that solves a real-life problem.

One becomes a beginner after one thousand days of training and an expert after ten thousand days of practice.

When an artist begins a sculpture he or she doesn’t start with the eye and finish and perfect the eye before moving to another part of the sculpture. No, the artist begins with an outline of the entire piece and slowly chips away revealing the sculpture that lies within the stone.

So it should be with kata. You can learn and get a rough idea of the entire kata in movements, and then begin to tweak and perfect each movement, revealing the art that lies within the kata.

Dev Help

0. Build: ./gradlew clean build
1. Please import Google style-guide into your IDE, to prevent code-style violations.
2. To publish from localhost to coveralls cloud, set the COVERALLS_REPO_TOKEN environment variable.
3. To update/refresh the javadocs, run ./gradlew alljavadoc and re-commit the docs/ folder.

How to contribute ?

Please create a new branch from 'master' and raise a pull-request once ready for review.

• Code of Conduct
• Copyright License

simplifylearning's Issues

Add Tree: findLCA tests

Graphs: add UnionFind Algorithm

Fix StringValidator.isValidParenthesis for wild-char scenarios

    @Ignore
    @Test
    public void assertMatchWildCharAsEmpty() {
        Assert.assertTrue(StringValidator.isValidParenthesis("(*)"));
    }

Write Encoder & Decoder

Add Algo for NGE (next greater element)

Add Log4j2 Logger

Remove System.out.println and e.printStackTrace

Heap: implement min, max and heapify functions

Tree: add standard BST Ops

Exclude empty private constructors from coverage report

Once new version of JaCoCo is released (0.8.0), add filter to exclude empty private constructors.

Reference - jacoco/jacoco#298

Smallest Positive Missing Number in Sorted Array - handle duplicates

ArrayOptimalTraversal:
- findSmallestMissingNumberSorted
- findSmallestMissingNumberSortedXOR

Fix LinkedList rotation algo for index=0 case

    @Test
    public void testRotateAntiClockwisePartial() {
        String output = new String("[54123]");
        Node newHead = rotateList(testNode, 3);
        Assert.assertEquals(output, printList(newHead));
    }

    @Test
    public void testRotateAntiClockwiseFull() {
        String output = new String("[12345]");
        Node newHead = rotateList(testNode, 5);
        Assert.assertEquals(output, printList(newHead));
    }

Add BucketSort for Negative Floating Point Numbers

Sort: adding basic algorithms (mergesort, counting-sort & dutch-flags)

Formulas.isPrimeNumber should cover numbers > 10 digits

Fix LinkedListTraversal.reverseList for partial-reverse scenario

    @Ignore
    @Test
    public void testPartialReverse() {
        String output = new String("[32145]");
        Node newHead = reverseList(testNode, 3);
        Assert.assertEquals(output, printList(newHead));
    }

Action the //TODO & //FIXME