algorithms

KO | EN

gitlite — search

#typescript #ai-agents #ai #dsh-plugin #deepseek-harness #open-source #claude-code #codex #cli #developer-tools #react #windows

★ 15 Open GitHub ↗

Algorithms and Data Structures a comprehensive collection of fundamental Algorithms and Data structures organized into various categories to cater to the needs of software engineers and computer science students.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

## Algorithms and Data Structures

> **_Donald Knuth:_**  "An algorithm must be seen to be believed".

Welcome to curated GitHub repository, featuring a comprehensive collection of fundamental Algorithms and 
Data structures organized into various categories to cater to the needs of software engineers and 
computer science students. Each Algorithm and Data structure is systematically classified, ensuring easy 
navigation and efficient learning. You will find concise explanations and clear Java implementation code,
making it easy to understand and implement the concepts in your projects.

Additionally, the repository includes sample problems and solutions, designed to help practice and 
apply the concepts learned from each Algorithm and Data structure. 
These problems serve as valuable exercises to enhance your problem-solving skills.

## Algorithms
<pre>
<a href="src/main/java/com/gkonovalov/algorithms/">Algorithms</a>
├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/">Arrays</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/searching/">Searching</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/searching/LinearSearch.java">Linear Search</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/searching/BinarySearch.java">Binary Search</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/searching/ExponentialSearch.java">Exponential Search</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/searching/JumpSearch.java">Jump Search</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/searching/InterpolationSearch.java">Interpolation Search</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/arrays/searching/TernarySearch.java">Ternary Search</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/">Sorting</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/BubbleSort.java">Bubble Sort</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/SelectionSort.java">Selection Sort</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/InsertionSort.java">Insertion Sort</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/MergeSort.java">Merge Sort</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/quicksort">Quick Sort</a>
│ │ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/quicksort/QuickSortPartitionHoare.java">Partition Hoare</a>
│ │ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/quicksort/QuickSortPartitionLomuto.java">Partition Lomuto</a>
│ │ │ └── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/quicksort/QuickSort3WayPartitioning.java">3-Way Partitioning</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/HeapSort.java">Heap Sort</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/CountingSort.java">Counting Sort</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/BucketSort.java">Bucket Sort</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/arrays/selection/">Selection</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/selection/quickselect/">Quick Select</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/selection/quickselect/QuickSelectPartitionHoare.java">Partition Hoare</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/arrays/selection/quickselect/QuickSelectPartitionHoare.java">Partition Lomuto</a>
│ └── Median of medians
├── <a href="src/main/java/com/gkonovalov/algorithms/strings/">Strings</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/strings/sorting/">Sorting</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/strings/sorting/LSDSort.java">LSD Radix Sort</a>
│ ├── Compression
│ │ └── Huffman Coding
│ └── String Matching
│ ├── Naive String Search
│ ├── Brute-force
│ ├── Rabin-Karp
│ ├── Knuth-Morris-Pratt
│ ├── Boyer-Moore
│ ├── Aho-Corasick
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/strings/matching/regularexpressions/">Regular Expressions</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/strings/matching/regularexpressions/RegularExpressionMatching.java">Regular Expression Matching</a>
│ │ └── Thompson NFA
│ └── <a href="src/main/java/com/gkonovalov/algorithms/strings/matching/editdistance/">Edit Distance</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/strings/matching/editdistance/LevenshteinDistance.java">Levenshtein Distance</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/strings/matching/editdistance/HammingDistance.java">Hamming Distance</a>
├── <a href="src/main/java/com/gkonovalov/algorithms/linkedlist">Linked List</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/linkedlist/FloydCycleDetection.java">Floyd's Cycle Detection</a>
├── <a href="src/main/java/com/gkonovalov/datastructures/trees/TreeNode.java">Tree</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/tree/searching">Searching</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/tree/searching/DFS.java">DFS</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/tree/searching/DFS.java#L28">Pre-order traversal</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/tree/searching/DFS.java#L57">In-order traversal</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/tree/searching/DFS.java#L85">Post-order traversal</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/tree/searching/BFS.java">BFS</a> 
│ └── <a href="src/main/java/com/gkonovalov/algorithms/tree/searching/BFS.java#L22">Level-order traversal</a>
├── <a href="src/main/java/com/gkonovalov/algorithms/graphs">Graphs</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching">Searching</a>
│ │ 	├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/dfs/DFS.java">DFS</a> 
│ │ 	│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/dfs/DFSPath.java">Path</a> 
│ │ 	│ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/dfs/DFSID.java">DFS-ID</a>
│ │ 	├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/bfs/BFS.java">BFS</a>
│ │ 	│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/bfs/BFSPath.java">Path</a> 
│ │ │ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/bfs/BidirectionalBFS.java">Bidirectional BFS</a>
│ │ 	└── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath">Shortest Path</a>
│ │ 	 ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/bfs/BFS.java">BFS</a>
│ │ 	 ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath/dijkstra/">Dijkstra's</a>
│ │ 	 │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath/dijkstra/DijkstraEager.java">Eager</a>
│ │ 	 │ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath/dijkstra/DijkstraLazy.java">Lazy</a>
│ │ 	 ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath/BellmanFord.java">Bellman–Ford</a>
│ │ 	 ├──	<a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath/FloydWarshall.java">Floyd-Warshall</a>
│ │ 	 └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath/AStar.java">A-star</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/mst">Minimum Spanning Tree</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/mst/prim/">Prim’s</a>
│ │ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/mst/prim/MSTPrimEager.java">Eager</a>
│ │ │ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/mst/prim/MSTPrimLazy.java">Lazy</a>
│ │ 	└── <a href="src/main/java/com/gkonovalov/algorithms/graphs/mst/MSTKruskal.java">Kruskal’s</a>
│ ├── Network Flow
│ │ ├── Maximum Flow
│ │ │ ├── Ford-Fulkerson
│ │ │ ├── Edmonds-Karp
│ │ │ ├── Push-Relabel
│ │ │ └── Dinic's
│ │ ├── Minimum Cut 
│ │ │ └── Karger's
│ │ └── Maximum Bipartite
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/sorting/">Sorting</a>
│ │ 	└── <a href="src/main/java/com/gkonovalov/algorithms/graphs/sorting/topological/">Topological Sort</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/sorting/topological/TopologicalSortKahn.java">Kahn's</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/sorting/topological/TopologicalSortTarjan.java">Tarjan's</a> 
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/">Connectivity</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/Bridge.java">Bridge</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/Connectivity.java">Connectivity</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/cc/">Connected Components</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/scc/">Strongly Connected Components</a>
│ │ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/scc/SCCKosarajuSharir.java">Kosaraju-Sharir's</a>
│ │ │ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/scc/SCCTarjan.java">Tarjan's</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/unionfind">Union-Find</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/unionfind/QuickFind.java">Quick Find</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/unionfind/quickunion/QuickUnion.java">Quick Union</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/unionfind/quickunion/QuickUnionWeighted.java">Weighted</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/unionfind/quickunion/QuickUnionWeightedPathCompression.java">Weighted with Path Compression</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/CycleDetection.java">Cycle Detection</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/Bipartite.java">Is Bipartite</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/MColoring.java">Graph coloring</a>
│ ├── Eulerian Path
│ ├── Eulerian Cycle
│ ├── Hamiltonian Path
│ └── Hamiltonian Cycle
├── Divide and Conquer
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/searching/BinarySearch.java">Binary Search</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/MergeSort.java">Merge Sort</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/quicksort/">Quick Sort</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/multiplication/MatrixStrassenMultiplication.java">Strassen's Matrix multiplication</a>
├── <a href="src/main/java/com/gkonovalov/algorithms/recursion/">Recursion</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/math/Factorial.java">Factorial</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/recursion/dp">Dynamic Programming</a>
│ │ ├── Approaches
│ │ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/math/FibonacciNumbers.java#L25">Top-Down - Memoization</a>
│ │ │ └── <a href="src/main/java/com/gkonovalov/algorithms/math/FibonacciNumbers.java#L45">Bottom-Up - Tabulation</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/math/FibonacciNumbers.java">Fibonacci Numbers</a>
│ │ 	├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath/BellmanFord.java">Bellman–Ford</a>
│ │ 	├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath/FloydWarshall.java">Floyd-Warshall</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/strings/matching/editdistance/LevenshteinDistance.java">Levenshtein Distance</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/strings/matching/regularexpressions/RegularExpressionMatching.java">Regular Expression Matching</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/multiplication/MatrixChainMultiplication.java">Matrix Chain Multiplication</a>
│ │ └── <a href="src/main/java/com/gkonovalov/algorithms/math/BinomialCoefficient.java">Binomial Coefficient</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/recursion/backtracking/">Backtracking</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/recursion/backtracking/combinatorics/">Combinatorics</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/recursion/backtracking/combinatorics/Permutations.java">Permutations</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/recursion/backtracking/combinatorics/Combinations.java">Combinations</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/recursion/backtracking/combinatorics/Subsets.java">Subsets</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/recursion/backtracking/combinatorics/Partitions.java">Partitions</a>
├── Greedy
│ ├── Huffman Coding
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/searching/shortestpath/dijkstra/DijkstraLazy.java">Dijkstra's Lazy</a>
│ └── Minimum Spanning Tree
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/mst/prim/MSTPrimLazy.java">Prim’s Lazy</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/mst/MSTKruskal.java">Kruskal’s</a>
├── Randomized
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/sorting/quicksort/QuickSortPartitionLomuto.java#L47">Randomized Quick Sort</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/randomized/FisherYatesShuffle.java">Fisher-Yates Shuffle</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/arrays/selection/quickselect/QuickSelectPartitionLomuto.java#L52">Randomized Quick Select</a>
│ ├── Las Vegas
│ └── Monte Carlo
├── <a href="src/main/java/com/gkonovalov/algorithms/gametheory/">Game Theory</a>
│ ├── Minimax
│ └── <a href="src/main/java/com/gkonovalov/algorithms/gametheory/prisonersdilemma/PrisonersDilemma.java">Prisoner's Dilemma</a>
├── <a href="src/main/java/com/gkonovalov/algorithms/geometry/">Geometry</a>
│ ├── Closest Pair of Points
│ ├── Line Intersection
│ ├── Voronoi Diagram
│ ├── Delaunay Triangulation
│ └── <a href="src/main/java/com/gkonovalov/algorithms/geometry/convexhull/">Convex Hull</a>
│ ├── <a href="src/main/java/com/gkonovalov/algorithms/geometry/convexhull/GrahamScan.java">Graham Scan</a>
│ └── <a href="src/main/java/com/gkonovalov/algorithms/geometry/convexhull/JarvisMarch.java">Jarvis March</a>
├── <a href="src/main/java/com/gkonovalov/algorithms/bits/BitsOperations.java">Bits Operations</a>
└── <a href="src/main/java/com/gkonovalov/algorithms/math">Math</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/FibonacciNumbers.java">Fibonacci Numbers</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/Factorial.java">Factorial</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/primenumbers">Prime Numbers</a>
 │ ├── <a href="src/main/java/com/gkonovalov/algorithms/math/primenumbers/SieveOfEratosthenes.java">Sieve of Eratosthenes</a>
 │ ├── <a href="src/main/java/com/gkonovalov/algorithms/math/primenumbers/primalitytest/">Primality Tests</a>
 │ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/math/primenumbers/primalitytest/TrialDivisionPrimalityTest.java">Trial Division</a>
 │ │ ├── <a href="src/main/java/com/gkonovalov/algorithms/math/primenumbers/primalitytest/FermatPrimalityTest.java">Fermat</a>
 │ │ └── <a href="src/main/java/com/gkonovalov/algorithms/math/primenumbers/primalitytest/MillerRabinPrimalityTest.java">Miller-Rabin</a>
 │ └── <a href="src/main/java/com/gkonovalov/algorithms/math/primenumbers/factorization">Prime Factorizations</a>
 │ ├── <a href="src/main/java/com/gkonovalov/algorithms/math/primenumbers/factorization/TrialDivisionPrimeFactorization.java">Trial Division</a>
 │ └── <a href="src/main/java/com/gkonovalov/algorithms/math/primenumbers/factorization/WheelPrimeFactorization.java">Wheel Factorization</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/GreatestCommonDivisorEuclidean.java">GCD Euclidean Algorithm</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/FastExponentiation.java">Fast Exponentiation</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/CatalanNumbers.java">Catalan Numbers</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/BinomialCoefficient.java">Binomial Coefficient</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/PascalTriangle.java">Pascal Triangle</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/LeastCommonMultiple.java">Least Common Multiple (LCM)</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/SumOfDigits.java">Sum of Digits</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/PowerOfTwo.java">Power of Two</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/EuclideanDistance.java">Euclidean Distance</a>
 └── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix">Matrix</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/MatrixInversion.java">Inversion</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/MatrixTransposition.java">Transposition</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/MatrixSquareRotation.java">Square Rotation</a>
 └── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/multiplication/MatrixMultiplication.java">Multiplication</a> 
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/multiplication/MatrixExponentiation.java">Exponentiation</a> 
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/multiplication/SparseMatrixMultiplication.java">Sparse Matrix</a>
 ├── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/multiplication/MatrixChainMultiplication.java">Chain</a>
 └── <a href="src/main/java/com/gkonovalov/algorithms/math/matrix/multiplication/MatrixStrassenMultiplication.java">Strassen's</a>
</pre>

## Data Structures
<pre>
<a href="src/main/java/com/gkonovalov/datastructures/">Data Structures</a>
├── <a href="src/main/java/com/gkonovalov/datastructures/strings/String.java">String</a>
├── <a href="src/main/java/com/gkonovalov/datastructures/arrays">Arrays</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/arrays/Array.java">Array</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/arrays/DynamicArray.java">Dynamic Array</a>
│ └── Suffix Arrays
├── <a href="src/main/java/com/gkonovalov/datastructures/linkedlist">Linked Lists</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/linkedlist/SinglyLinkedList.java">Singly</a> 
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/linkedlist/DoublyLinkedList.java">Doubly</a> 
│ └── Skip List
├── <a href="src/main/java/com/gkonovalov/datastructures/stack/Stack.java">Stacks</a>
├── <a href="src/main/java/com/gkonovalov/datastructures/queues">Queues</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/queues/Queue.java">Queue</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/queues/Deque.java">Deque</a>
│ └── <a href="src/main/java/com/gkonovalov/datastructures/queues/CircularQueue.java">Circular Queue</a>
├── <a href="src/main/java/com/gkonovalov/datastructures/hashtables">Hash Tables</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/hashtables/HashMap.java">HashMap</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/hashtables/HashSet.java">HashSet</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/hashtables/SparseVector.java">Sparse Vector</a>
│ └── Collision Resolution
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/hashtables/HashMap.java#L159">Separate Chaining</a>
│ └── <a href="src/main/java/com/gkonovalov/datastructures/hashtables/HashSet.java#L107">Open Addressing</a>
├── <a href="src/main/java/com/gkonovalov/datastructures/bloomfilter/BloomFilter.java">Bloom Filter</a> 
├── <a href="src/main/java/com/gkonovalov/datastructures/trees/">Trees</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/trees/BinarySearchTree.java">Binary Search Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/trees/trie">Trie-trees</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/datastructures/trees/trie/Trie.java">Prefix Tree - Trie</a>
│ │ └── Suffix Tree
│ ├── <a href="src/main/java/com/gkonovalov/datastructures/trees/heaps">Heaps</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/datastructures/trees/heaps/BinaryHeap.java">Binary Heap - Priority Queue</a>
│ │ │ ├── <a href="src/main/java/com/gkonovalov/datastructures/trees/heaps/BinaryHeap.java#L124">Min Heap</a>
│ │ │ └── <a href="src/main/java/com/gkonovalov/datastructures/trees/heaps/BinaryHeap.java#L122">Max Heap</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/datastructures/trees/heaps/IndexedBinaryHeap.java">Indexed Binary Heap</a>
│ │ └── Fibonacci Heaps
│ ├── Self-balanced
│ │ ├── AVL Tree
│ │ ├── Red Black Tree
│ │ ├── B Tree
│ │ │ └── B+ Tree
│ │ ├── 2-3 Tree
│ │ ├── Splay Tree
│ │ └── Treaps
│ ├── Cartesian Tree
│ ├── K-D Tree
│ ├── Fenwick Tree
│ └── Segment Tree
└── <a href="src/main/java/com/gkonovalov/datastructures/graphs/Graph.java">Graphs</a>
 ├── Types
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java#L32">Undirected Graph</a>
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java#L59">Directed Graph</a>
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java#L106">Weighted Undirected Graph</a>
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java#L122">Weighted Directed Graph</a>
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java#L51">Cyclic Graph</a>
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java#L51">Acyclic Graph</a>
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java#L71">Directed Acyclic Graph</a>
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java#L97">Labeled Graph</a>
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java#L78">Bipartite Graph</a>
 │ ├── <a href="src/main/java/com/gkonovalov/datastructures/trees/TreeNode.java">Tree</a>
 │ ├── <a href="src/main/java/com/gkonovalov/algorithms/graphs/connectivity/unionfind/">Forest</a>
 │ └── <a href="src/main/java/com/gkonovalov/algorithms/graphs/mst">Spanning Tree</a>
 └── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/">Representation in memory</a>
 ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyList.java">Adjacency List</a>
 ├── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/AdjacencyMatrix.java">Adjacency Matrix</a>
 └── <a href="src/main/java/com/gkonovalov/datastructures/graphs/representation/EdgeList.java">Edge List</a>
</pre>

## Coding Problems and Techniques
<pre>
<a href="src/main/java/com/gkonovalov/problems/">Problems</a>
├── Arrays
│ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/sorting">Sorting</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/sorting/MergeIntervals.java">Merge Intervals</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/sorting/MergeSortedArray.java">Merge Sorted Array</a>
│ ├── Searching
│ │ └── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/">Binary Search</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/CapacityToShipPackagesWithinDDays.java">Capacity to Ship Packages Within N Days</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/CuttingRibbons.java">Cutting Ribbons</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/FindFirstLastPositionOfElementInSortedArray.java">Find First and Last Position of Element in Sorted Array</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/FindPeakElement.java">Find Peak Element</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/FirstBadVersion.java">First Bad Version</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/KokoEatingBananas.java">Koko Eating Bananas</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/MissingNumber.java">Missing Number</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/SearchInsertPosition.java">Search Insert Position</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/arrays/searching/binarysearch/SearchRotatedSortedArray.java">Search Rotated Sorted Array</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/selection/">Selection</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/selection/KClosestPointsToOrigin.java">Kth Closest Points to Origin</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/arrays/selection/KthLargestElementArray.java">Kth Largest Element in Array</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/strings/slidingwindow/">Sliding Window</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/strings/slidingwindow/LongestSubstringWithoutRepeatingCharacters.java">Longest Substring Without Repeating Characters</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/twopointers/">Two Pointers</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/arrays/twopointers/ContainerWithMostWater.java">Container With Most Water</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/matrix">Matrix</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/matrix/GameOfLife.java">Game of Life</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/matrix/RotateImage.java">Rotate Image</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/matrix/Search2DMatrix.java">Search in 2D Matrix</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/arrays/matrix/SetMatrixZeroes.java">Set Matrix Zeroes</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/arrays/MaximumSubarray.java">Maximum Sum Subarray - Kadane's </a>
│ ├── Prefix Sum
│ └── Range Sum 
├── Strings
│ ├── <a href="src/main/java/com/gkonovalov/problems/strings/SpellingCorrection.java">Spelling Correction</a>
│ ├── Reverse String
│ ├── Anagram Checking
│ └── Palindromes
│ ├── Palindrome Checking
│ ├── Palindrome Substrings
│ └── Longest Palindromic Substring
├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/">Linked List</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/AddTwoNumbers.java">Add Two Numbers</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/IntersectionTwoLinkedLists.java">Intersection of Two Linked Lists</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/MergeTwoSortedLists.java">Merge Two Sorted Lists</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/PalindromeLinkedList.java">Palindrome Linked List</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/RemoveNthNodeFromEndOfList.java">Remove Nth Node From End of List</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/SortList.java">Sort List</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/cycle/">Cycle</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/cycle/LinkedListCycle.java">Linked List Cycle</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/linkedlist/cycle/LinkedListCycleTwo.java">Linked List Cycle II</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/reversal/">Reversal</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/reversal/ReverseLinkedList.java">Reverse Linked List</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/linkedlist/reversal/ReverseLinkedListTwo.java">Reverse Linked List II</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/linkedlist/cache/">Cache</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/linkedlist/cache/LRUCache.java">LRU</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/linkedlist/cache/LFUCache.java">LFU</a> 
├── <a href="src/main/java/com/gkonovalov/problems/stack/">Stacks</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/stack/SimplifyPath.java">Simplify Path</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/stack/ValidParentheses.java">Valid Parentheses</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/stack/BasicCalculatorII.java">Basic Calculator II</a>
├── Queues
├── <a href="src/main/java/com/gkonovalov/problems/hashtable/">Hash Table</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/hashtable/GroupAnagrams.java">Group Anagrams</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/hashtable/LoggerRateLimiter.java">Logger Rate Limiter</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/hashtable/RomanToInteger.java">Roman to Integer</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/hashtable/VerifyingAnAlienDictionary.java">Verifying an Alien Dictionary</a>
├── <a href="src/main/java/com/gkonovalov/problems/tree/">Trees</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/MaximumDepthOfBinaryTree.java">Maximum Depth of Binary Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/BinaryTreeInorderTraversal.java">Binary Tree Inorder Traversal</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/BinaryTreeMaximumPathSum.java">Binary Tree Maximum Path Sum</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/BinaryTreeRightSideView.java">Binary Tree Right Side View</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/BinaryTreeVerticalOrderTraversal.java">Binary Tree Vertical Order Traversal</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/BoundaryOfBinaryTree.java">Boundary of Binary Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/LowestCommonAncestorOfBinaryTree.java">Lowest Common Ancestor of a Binary Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/DiameterOfBinaryTree.java">Diameter of Binary Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/InvertBinaryTree.java">Invert Binary Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/RecoverBinarySearchTree.java">Recover Binary Search Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/SameTree.java">Same Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/ValidateBinarySearchTree.java">Validate Binary Search Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/heap/">Heap</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/tree/heap/MergeKSortedLists.java">Merge k Sorted Lists</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/trie/">Trie</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/tree/trie/LongestCommonPrefix.java">Longest Common Prefix</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/tree/nary/">N-ary Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/nary/CloneNAryTree.java">Clone N-ary Tree</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/tree/nary/DiameterNAryTree.java">Diameter of N-Ary Tree</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/tree/nary/MaximumDepthOfNAryTree.java">Maximum Depth of N-ary Tree</a>
├── <a href="src/main/java/com/gkonovalov/problems/graph/">Graphs</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/graph/bipartite/IsGraphBipartite.java">Is Graph Bipartite</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/graph/sorting">Sorting</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/graph/sorting">Topological Sort</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/graph/sorting/topologicalsort/AlienDictionary.java">Alien Dictionary</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/graph/searching">Searching</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/graph/searching/bfs">BFS</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/graph/searching/bfs/NumberOfIslands.java">Number of Islands</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/graph/searching/bfs/WordBreak.java">Word Break</a>
│ │ └── <a href="src/main/java/com/gkonovalov/problems/graph/searching/bfs/WordLadder.java">Word Ladder</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/graph/searching/dfs">DFS</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/graph/searching/dfs/CloneGraph.java">Clone Graph</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/graph/searching/dfs/IslandPerimeter.java">Island Perimeter</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/graph/searching/dfs/WallsAndGates.java">Walls and Gates</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/graph/searching/dfs/SpiralMatrix.java">Spiral Matrix</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/graph/searching/dfs/WordSearch.java">Word Search</a>
├── Recursion
│ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/">Dynamic Programming</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/FibonacciNumbers.java">Fibonacci Numbers</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/Knapsack01.java">Knapsack 0/1</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/KnapsackUnbounded.java">Knapsack Unbounded</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/TravelingSalesmanProblem.java">Traveling Salesman</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/LongestCommonSubsequence.java">Longest Common Subsequence (LCS)</a>
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/LongestIncreasingSubsequence.java">Longest Increasing Subsequence (LIS)</a> 
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/LongestPalindromicSubstring.java">Longest Palindrome Subsequence (LPS)</a>
│ │ ├── Shortest Common Supersequence (SCS)
│ │ ├── Maximum Sum Increasing Subsequence
│ │ ├── Maximum Subarray Sum
│ │ ├── Combination Sum
│ │ ├── Rod Cutting
│ │ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/JumpGame.java">Jump Game</a>
│ │ ├── Partition problem
│ │ ├── Russian Dolls Envelope
│ │ ├── Dungeon Game
│ │ ├── Subset Sum problem
│ │ ├── Minimum Path Sum
│ │ ├── Unique Paths in a Grid
│ │ ├── Counting Paths in a Grid
│ │ ├── Wildcard Matching
│ │ ├── Word Break
│ │ ├── Paint House
│ │ ├── Palindrome Partitioning
│ │ ├── Maximum Product Subarray
│ │ ├── Staircase
│ │ └── Coin Change
│ └── <a href="src/main/java/com/gkonovalov/problems/recursion/backtracking/">Backtracking</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/backtracking/TravelingSalesmanProblem.java">Traveling Salesman</a>
│ ├── <a href="src/main/java/com/gkonovalov/problems/recursion/backtracking/NQueens.java">N-Queens</a>
│ ├── Knight's Tour 
│ ├── Sudoku Solver
│ ├── Unique Paths
│ ├── Rat in a Maze 
│ ├── Subset Sum
│ └── Word Search
├── Greedy
│ ├── <a href="src/main/java/com/gkonovalov/problems/greedy/Knapsack.java">Knapsack</a>
│ ├── Interval Scheduling
│ ├── Job Scheduling 
│ └── Coin Change
├── <a href="src/main/java/com/gkonovalov/problems/gametheory/">Game Theory</a>
│ └── <a href="src/main/java/com/gkonovalov/problems/gametheory/GuessTheWord.java">Guess The Word</a>
├── Bit Manipulation
└── NP-complete problems
 ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/TravelingSalesmanProblem.java">Traveling Salesman</a>
 ├── <a href="src/main/java/com/gkonovalov/problems/recursion/dp/KnapsackUnbounded.java">Knapsack Unbounded</a>
 ├── SAT
 ├── Clique
 ├── Factorization
 └── Hamiltonian Cycle
</pre>

## Requirements
JDK 8.0 or later.

## Development

To open the project in Intellij Idea:

1. Go to *File* menu or the *Welcome Screen*
2. Click on *Open...*
3. Navigate to `algorithms` root directory.
4. Select `setting.gradle`

------------
Georgiy Konovalov 2024 (c) [MIT License](LICENSE)

algorithms

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README