This repository contains Haskell based examples of algorithms and data structures. (Inspired by JavaScript Algorithms).

• Haskell Algorithms
  • Table of Contents
  • Data Structures
  • Math
  • Sets
  • Strings
  • Searches
  • Sorting
  • Linked Lists
  • Trees
  • Graphs
  • Cryptography
  • Machine Learning
  • Brute Force
  • Greedy
  • Divide and Conquer
  • Dynamic Programming
  • Backtracking
  • Uncategorized

• Linked List
• Doubly Linked List
• Queue
• Stack
• Hash Table
• Heap
• Priority Queue
• Trie
• Tree
  • Binary Search Tree
  • AVL Tree
  • Red-Black Tree
  • Segment Tree
  • Fenwick Tree
• Graph
• Disjoint Set
• Bloom Filter

• Bit Manipulation
• Factorial
• Fibonacci Number
• Primality Test
• Euclidean Algorithm
• Least Common Multiple
• Sieve of Eratosthenes
• Is Power of Two
• Pascal's Triangle
• Complex Number
• Radian & Degree
• Fast Powering
• Integer Partition
• Square Root
• Liu Hui π Algorithm
• Discrete Fourier Transform

• Cartesian Product
• Fisher–Yates Shuffle
• Power Set
• Permutations
• Combinations
• Longest Common Subsequence
• Longest Increasing Subsequence
• Shortest Common Supersequence
• Knapsack Problem
• Maximum Subarray
• Combination Sum

• Hamming Distance
• Levenshtein Distance
• Knuth–Morris–Pratt Algorithm
• Z Algorithm
• Rabin Karp Algorithm
• Longest Common Substring
• Regular Expression Matching

• Linear Search
• Jump Search
• Binary Search
• Interpolation Search

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

• Straight Traversal
• Reverse Traversal

• Depth-First Search
• Breadth-First Search

• Depth-First Search
• Breadth-First Search
• Kruskal’s Algorithm
• Dijkstra Algorithm
• Bellman-Ford Algorithm
• Floyd-Warshall Algorithm
• Detect Cycle
• Prim’s Algorithm
• Topological Sorting
• Articulation Points
• Bridges
• Eulerian Path and Eulerian Circuit
• Hamiltonian Cycle
• Strongly Connected Components
• Travelling Salesman Problem

• Polynomial Hash

• NanoNeuron

• Linear Search
• Rain Terraces
• Recursive Staircase
• Maximum Subarray
• Travelling Salesman Problem
• Discrete Fourier Transform

• Jump Game
• Unbound Knapsack Problem
• Dijkstra Algorithm
• Prim’s Algorithm
• Kruskal’s Algorithm

• Binary Search
• Tower of Hanoi
• Pascal's Triangle
• Euclidean Algorithm
• Merge Sort
• Quicksort
• Tree Depth-First Search
• Graph Depth-First Search
• Jump Game
• Fast Powering
• Permutations
• Combinations

• Fibonacci Number
• Jump Game
• Unique Paths
• Rain Terraces
• Recursive Staircase
• Levenshtein Distance
• Longest Common Subsequence
• Longest Common Substring
• Longest Increasing Subsequence
• Shortest Common Supersequence
• 0/1 Knapsack Problem
• Integer Partition
• Maximum Subarray
• Bellman-Ford Algorithm
• Floyd-Warshall Algorithm
• Regular Expression Matching

• Jump Game
• Unique Paths
• Power Set
• Hamiltonian Cycle
• N-Queens Problem
• Knight's Tour
• Combination Sum

• Tower of Hanoi
• Square Matrix Rotation
• Jump Game
• Unique Paths
• Rain Terraces
• Recursive Staircase
• N-Queens Problem
• Knight's Tour