a-grim-loth

Table of Contents:

cpp
- Arrays
  - kth-smallest-or-subarray
  - kth-smallest-sum-subarray
  - largest-subarray-sum
  - move-all-0s-to-left-while-maintaining-order
  - reverse-array
- Combinatorial-search
  - N-queens-puzzle
  - TSP-branch-and-bound
  - allow-n-people-in-2-power-n-way
  - anagram-of-the-given-string
  - backtracking
  - combinations
    - combination-of-multisets
    - combinations-every-element-appears-twice-distance-appearances-equal-value
  - expected-number-of-calls-to-rng-04-per-call-of-rng-07
  - list-k-element-subsets-of-n-items
  - permutations
  - permute-a-string
  - print-all-subset-of-given-string
  - sudoku-solver
  - telephone-numbers-to-possible-words
- Conjectures
  - Taxicab-Number
- Dictionaries
  - ceaser-cipher-decrypt
  - dictionaries-implementation-benchmark
  - search-string-magazine-cutting
- Dynamic-Programming
  - Longest-Increasing-subsequence
  - Longest-common-subsequence
    - Lcs-basic
    - reducedspace
  - Max-sum-on-line
    - basic
  - basic
  - edit-distance
    - approximate-string-matching
    - poker-chips
  - number-problems
  - partition
    - integer-partition
      - without-rearrangement
  - shortest-common-supersequence
    - scs
  - subset-sum
  - tree
    - optimal-binary-tree
  - vertex-cover
    - tree
- Graphs
  - minimum-spanning-tree
    - kruskal
    - prims
  - network-flows-and-Bipartite-matching
    - edmond-karp-algorithm
    - residual-flow-graphs
  - shortest-path
  - types
    - directed
      - strongly-connected-component
      - topological-sort
      - traversal
        
        depth-first-search
      - unweighted
        
        adjacency-list-representation
      - weighted
        
        adjacency-list-representation
    - undirected
      - adjacency-matrix-to-incidence-matrix
      - articulation-points
      - connected-components
      - count-componenets
      - cycle-detection
      - traversal
        
        Breath-first-search
        
        Depth-first-traversal
      - two-coloring
      - unweighted
        
        adjacency-list-representation
      - weighted
        
        adjacency-list-representation
- Greedy-algorithms
  - index
- Hashing-and-Randomization
  - Bloom-filter
  - LRU-cache
  - min-hash
  - minimal-perfect-hashing
  - primality-test
    - fermat-primality-test
  - simulation
    - expected-round-until-heads
  - weighted-random-distribution
- Heaps
  - Fast-Heap
  - K-th-element-compare-with-x
  - min-heap
- Lists
  - find-loop-in-linked-list
  - find-middle-linkedlist
  - reverse-linked-list
  - singly-linked-list
- Queues
  - Priority-queue
- Sorting
  - Bucket-sort
  - Counting-sort
  - Heap-sort
  - Merge-sort
  - Quick-sort
  - Quick-sort
  - Radix-sort
  - Randomized-Quick-sort
  - Shell-sort
  - external-sorting
  - stable-sort
  - wiggle-sort
- Stacks
  - balanced-paranthesis
  - reverse-words-in-sentence
- Trees
  - Interval-trees
  - binary-search-tree
  - binary-tree-equality
  - bst-linked-list
  - construct-tree-from-given-inorder-and-preorder-traversal
  - maximum-matching
  - traversal
    - iterative-implementation
    - recursive-implementation
- Union-find
  - structure-implementation
- computataional-geometry
  - bullet-through-largest-number-of-walls
  - graham-scan-convex-hull
- divide-and-conquer
  - count-of-range-sum
  - maximum-length-possible-by-cutting-n-given-woods-into-at-least-k-pieces
  - median-of-two-sorted-arrays
  - merge-k-sorted-linkedlists
  - merge-two-linked-lists
- partition
  - three-way-parition-problem-quicksort-dutch-national-flag
- range-queries
  - dynamic-programming
    - 2-D
      - Heap-Tree-Count
      - place-of-sign
  - number-of-elements-greater-than-k-in-the-range-l-to-r-using-fenwick-tree-offline-queries
  - smallest-subarray
  - special-sequence
- searching
  - binary-search
  - counting-occurences-via-binary-search
  - majority-voting-algorithm
  - meta-binary-search-one-sided-binary-search
  - square-root
- selection
  - Quick-select
  - find-median-in-linear-time
  - find-the-first-missing-number
  - majority-voting-algorithm
- strings
  - Rabin-karp-string-search
  - count-similar-substrings
  - fast_hash
  - hash-func
  - knuth-Morris-Pratt-algorithm
  - rotodrome
  - suffix-array
  - suffix-tree
    - construction
    - suffix-trie
  - trie
python
- Basic
  - array
  - binary-search
  - dis-joint-set
  - hash-function
  - hash-table
  - linkedList
  - queue
  - segment-tree
  - stack
  - trie
- Combinatorial-search
  - backtracking
  - permutation-vs-subset
- Recursion
- concurrency
  - multi-threaded-fizzbuzz
- dynamic-programming
- graph
- heap
  - max-heap
  - treap
- probability
  - month-hall-paradox
- problems
  - Divide-arrays
  - Find-Klargest-number-in-unsorted-array
  - Minimum-operations
  - absolute-integer
  - bit-mainpulation
  - count-set-bits
  - data-structure-to-store-words
  - first-and-last-position-of-target-in-list
  - min_substring
  - palindrome-construction
  - recursion-and-backtracking
  - sieve-of-eratosthenes
  - smallest-subarray
  - trapping-water
  - two-sums
  - unpredictable-array
- selection
  - k-largest-quickselect
  - quickSelect
- sorting
- strings
- topics
  - Graph-algorithms
  - Network-Flow-Problem
  - combinatorial-optimization
  - computational-geometry
  - data-structures
  - geometry
    - convex-hull
    - triangulation
  - memoization
    - example
  - number-theory
    - fibonacci-sequenc
    - simplex
  - range-queries
    - merge-sort-tree
    - number-of-elements-greater-than-k-in-the-range-l-to-r-using-fenwick-tree-offline-queries
  - shortest-path
  - string-algorithms
    - naive-method
- tree

License

This site is open source. Improve this page.