Learn Data Structure and Algorithms by Java

You need to have basic understanding of the Java programming language to proceed with the codes from this repository.

Table of Contents

• Introduction to Java

• Data Structure

  • Linked List
  • Stack
  • Queue
  • Binary Search Tree (BST)
  • Heap
  • Hash Table
  • Disjoint Set Union (Union Find)
  • Trie
  • Suffix Array
  • Segment Tree
  • Binary Indexed Tree (BIT)
  • Heavy Light Decomposition

• Searching

  • Linear Search
  • Binary Search
  • Ternary Search

• Sorting

  • Selection Sort
  • Bubble Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Bucket Sort
  • Counting Sort
  • Heap Sort
  • Radix Sort

• Graph Algorithms

  • Graph Representation
  • Breadth First Search (BFS)
  • Depth First Search (DFS)
  • Topological Sort
  • Strongly Connected Components (SCC)
  • Minimum Spanning Tree (MST)
  • All Pairs Shortest Path (Floyd Warshall's Algorithm)
  • Single Source Shortest Path Algorithm
    • Djkastra's Algorithm
    • Bellman Ford Algorithm
  • Directed Acyclic Graph
  • Bipartite Matching
  • Articulation Point, Bridge
  • Euler Tour/Path
  • Hamiltonian Cycle
  • Stable Marriage Problem
  • Chinese Postman Problem
  • 2-satisfiability
  • Flow Algorithms
    • Maximum Flow
    • Minimum Cut
    • Min-Cost Max Flow
    • Maximum Bipartite Matching
    • Vertex Cover

• Dynamic Programming

  • Rod Cutting
  • Maximum Sum (1D, 2D)
  • Coin Change
  • Longest Common Subsequence
  • Longest Increasing Subsequence
  • Matrix Multiplication
  • Edit Distance (Levenshtein distance)
  • 0/1 Knapsack
  • Travelling Salesman Problem
  • Optimal Binary Search Tree

• Greedy Algorithms

  • Activity Selection/Task Scheduling
  • Huffman Coding
  • Knapsack Problem (Fractional Knapsack)

• String Algorithms

  • Rabin-Karp Algorithm
  • Knuth-Morris-Pratt Algorithm
  • Z Algorithm
  • Aho-Korasick Algorithm
  • Manachers Algorithm
  • Boyr-Moore Algorithm

• Number Theory

  • Greatest Common Divisor (GCD)
  • Longest Common Multiplier (LCM)
  • Euler Totient (Phi)
  • Prime finding(Sieve of Eratosthenes)
  • Prime factorization
  • Factorial
  • Fibonacci
  • Counting, Permutation, combination
  • Exponentiation
  • Big Mod
  • Euclid, Extended euclid
  • Josephus Problem
  • Farey Sequence
  • Catalan numbers
  • Burnside's lemma/circular permutation
  • Modular inverse
  • Probability
  • Chinese Remainder Theorem
  • Gaussian Elmination method
  • Dilworth's Theorem
  • Matrix Exponentiation

• Computational Geometry

  • Pick's Theorem
  • Convex hull
  • Line Intersection
  • Point in a polygon
  • Area of a polygon
  • Line Sweeping
  • Polygon intersection
  • Closest Pair

• Game Theory

  • Take Away Game
  • Nim's Game
  • Sprague-grundy Number

• Others

  • BackTracking
    • N-Queen's Problem

---

Introduction

Useful Links:

• Algorithms, 4th Edition (book by: Robert Sedgewick and Kevin Wayne)