Skip to content
Permalink
Browse files

Updated package structure

  • Loading branch information...
igorwojda committed Mar 9, 2019
1 parent 955b685 commit 0fff7b7cf223935b667fd03ac3e6057e1a19dab0
@@ -82,8 +82,8 @@ your time before you take a look at the presented solution. **Good luck!**
- [Get duplicated arguments](app/src/test/java/com/igorwojda/string/getduplicatedarguments/GetDuplicatedArguments.md)
- [Find pair with target average](app/src/test/java/com/igorwojda/list/pairaverage/PairAverage.md)
- [Binary search tree](app/src/test/java/com/igorwojda/tree/binarysearchtree/BinarySearchTree.md)
- [Tree traversal](app/src/test/java/com/igorwojda/tree/traversal/TreeTraversal.md)
- [Tree level width](app/src/test/java/com/igorwojda/tree/levelwidth/LevelWidth.md)
- [Tree traversal](app/src/test/java/com/igorwojda/tree/classic/traversal/TreeTraversal.md)
- [Tree level width](app/src/test/java/com/igorwojda/tree/classic/levelwidth/LevelWidth.md)
- [Binary search tree (insert)](app/src/test/java/com/igorwojda/binarytree/insert/Insert.md)
- [Binary search tree (validate)](app/src/test/java/com/igorwojda/binarytree/validate/Validate.md)
- [Any callback](app/src/test/java/com/igorwojda/various/anycallback/AnyCallback.md)
@@ -94,7 +94,7 @@ your time before you take a look at the presented solution. **Good luck!**
- [Quick sort](app/src/test/java/com/igorwojda/list/sort/quicksort/QuickSort.md)
- [Radix sort](app/src/test/java/com/igorwojda/list/sort/radixsort/RadixSort.md)
- [Doubly linked list](app/src/test/java/com/igorwojda/linkedlist/doubly/base/DoublyLinkedList.md)
- [Max binary heap](app/src/test/java/com/igorwojda/heap/maxbinaryheap/MaxBinaryHeap.md)
- [Max binary heap](app/src/test/java/com/igorwojda/tree/heap/maxbinaryheap/MaxBinaryHeap.md)

**Commander**
- [List chunk](app/src/test/java/com/igorwojda/list/listchunk/ListChunk.md)
@@ -1,4 +1,4 @@
package com.igorwojda.tree.levelwidth
package com.igorwojda.tree.classic.levelwidth

import org.amshove.kluent.shouldEqual
import org.junit.Test
@@ -1,4 +1,4 @@
package com.igorwojda.tree.levelwidth
package com.igorwojda.tree.classic.levelwidth

object Solution1 {
private object Solution1 {
@@ -1,4 +1,4 @@
package com.igorwojda.tree.traversal
package com.igorwojda.tree.classic.traversal

import org.amshove.kluent.shouldEqual
import org.junit.Test
@@ -1,4 +1,4 @@
package com.igorwojda.tree.traversal
package com.igorwojda.tree.classic.traversal

private object Solution {
private class BinarySearchTree<E : Comparable<E>> {
@@ -1,4 +1,4 @@
package com.igorwojda.heap.maxbinaryheap
package com.igorwojda.tree.heap.maxbinaryheap

import org.amshove.kluent.shouldEqual
import org.junit.Test
@@ -1,4 +1,4 @@
package com.igorwojda.heap.maxbinaryheap
package com.igorwojda.tree.heap.maxbinaryheap

object Solution {
private class MaxBinaryHeap<E : Comparable<E>> {
@@ -30,7 +30,7 @@ for recursive call) or change return type (eg. change `List<Int>` to `MutableLis
- [Get odd](../app/src/test/java/com/igorwojda/integer/getodd/GetOdd.md)
- [Count down](../app/src/test/java/com/igorwojda/integer/countdown/CountDown.md)
- [Is substring](../app/src/test/java/com/igorwojda/string/issubstring/IsSubstring.md)
- [Tree traversal](../app/src/test/java/com/igorwojda/tree/traversal/TreeTraversal.md)
- [Tree traversal](../app/src/test/java/com/igorwojda/tree/classic/traversal/TreeTraversal.md)

## Double pointer

@@ -155,19 +155,19 @@ We use sliding window instead of nested loops which decreases complexity from `O

- [Queue](../app/src/test/java/com/igorwojda/queue/basic/Queue.md)
- [Combine two queues](../app/src/test/java/com/igorwojda/queue/combine/Combine.md)
- [Tree traversal](../app/src/test/java/com/igorwojda/tree/traversal/TreeTraversal.md)
- [Tree traversal](../app/src/test/java/com/igorwojda/tree/classic/traversal/TreeTraversal.md)

## Stack

- [Stack](../app/src/test/java/com/igorwojda/stack/basic/Stack.md)
- [Tree traversal](../app/src/test/java/com/igorwojda/tree/traversal/TreeTraversal.md)
- [Tree traversal](../app/src/test/java/com/igorwojda/tree/classic/traversal/TreeTraversal.md)

## Heap

- [Max binary heap](../app/src/test/java/com/igorwojda/heap/maxbinaryheap/MaxBinaryHeap.md)
- [Max binary heap](../app/src/test/java/com/igorwojda/tree/heap/maxbinaryheap/MaxBinaryHeap.md)

## Tree

- [Binary search tree](../app/src/test/java/com/igorwojda/tree/binarysearchtree/BinarySearchTree.md)
- [Tree level width](../app/src/test/java/com/igorwojda/tree/levelwidth/LevelWidth.md)
- [Tree](../app/src/test/java/com/igorwojda/tree/traversal/TreeTraversal.md)
- [Tree level width](../app/src/test/java/com/igorwojda/tree/classic/levelwidth/LevelWidth.md)
- [Tree](../app/src/test/java/com/igorwojda/tree/classic/traversal/TreeTraversal.md)
@@ -30,8 +30,8 @@ This section contains all puzzles in order in which they where added to reposito
24. [Singly linked list](../app/src/test/java/com/igorwojda/linkedlist/singly/base/SinglyLinkedList.md)
25. [Midpoint](../app/src/test/java/com/igorwojda/linkedlist/singly/midpoint/Midpoint.md)
26. [Circular check](../app/src/test/java/com/igorwojda/linkedlist/singly/circularcheck/CircularCheck.md)
27. [Tree traversal](../app/src/test/java/com/igorwojda/tree/traversal/TreeTraversal.md)
28. [Tree level width](../app/src/test/java/com/igorwojda/tree/levelwidth/LevelWidth.md)
27. [Tree traversal](../app/src/test/java/com/igorwojda/tree/classic/traversal/TreeTraversal.md)
28. [Tree level width](../app/src/test/java/com/igorwojda/tree/classic/levelwidth/LevelWidth.md)
29. [Binary search tree (insert)](../app/src/test/java/com/igorwojda/binarytree/insert/Insert.md)
30. [Binary search tree (validate)](../app/src/test/java/com/igorwojda/binarytree/validate/Validate.md)
31. [Bubble sort](../app/src/test/java/com/igorwojda/list/sort/bubblesort/BubbleSort.md)
@@ -69,5 +69,5 @@ This section contains all puzzles in order in which they where added to reposito
63. [Radix sort](../app/src/test/java/com/igorwojda/list/sort/radixsort/RadixSort.md)
64. [Doubly linked list](../app/src/test/java/com/igorwojda/linkedlist/doubly/base/DoublyLinkedList.md)
65. [Binary search tree](../app/src/test/java/com/igorwojda/tree/binarysearchtree/BinarySearchTree.md)
66. [Max binary heap](../app/src/test/java/com/igorwojda/heap/maxbinaryheap/MaxBinaryHeap.md)
66. [Max binary heap](../app/src/test/java/com/igorwojda/tree/heap/maxbinaryheap/MaxBinaryHeap.md)

0 comments on commit 0fff7b7

Please sign in to comment.
You can’t perform that action at this time.