Javascript Data Structures And Algorithms

TDD Implementations of data structures, algorithms and programming problems

Data Structures

• Graph
  • Adjacency list representation
  • Adjacency matrix representation
• Disjoint sets
  • Union find
  • Balanced quick union tree
  • Path compressed quick union
  • Quick find
  • Quick union
  • Social network connectivity problem
• Tree
  • Binary search tree
  • AVL tree
  • Red-Black tree
  • Interval tree
  • Segment tree
• Linked list
• Trie
• Linked list
• Stack
  • Linked list Implementation
• Heap
• Queue
  • Linked list implementation
  • Object and pointers implementation
  • Two stacks implementation
• Hash table

Algorithms

• Mathematics
  • Divide and Conquer
    • Strassen's Matrix Multiplication
    • Block Matrix Multiplication
    • Karatsuba Multiplication
  • Iterative Matrix Multiplication
• Sorting
  • Quick Sort
    • Hoare - Median Pivot
    • Lomuto - Median of Three
    • Lomuto - Left Pivot
    • Lomuto - Right Pivot
  • Bucket Sort
  • Radix Sort
    • Least Significant Digit
  • Counting Sort
  • Merge Sort
  • Heap Sort
  • Selection Sort
  • Insertion Sort
  • Bubble Sort
• Searching
  • Searching
  • Binary Search
    • Iterative
    • Recursive
• Graph algorithms
  • Breadth first search
  • Depth first search
  • Kargers randomized contraction
  • Shortest path
  • Spanning trees
  • Strongly connected components - Kosaraju's algorithm
  • Topological sort
  • Graph problems
    • Cheapest flights with k stops
    • Course schedule 1
    • Course schedule 2
    • Network delay time
• Linked list algorithms
  • Add two numbers
  • Fast and slow pointers
  • Merge two lists
  • Reorder list
  • Reverse linked list
  • Reverse linked list II
  • Sort list
• Backtracking
  • N queen problem
  • Combination sum
  • Combinations
  • Permutations
  • Subsets
  • Subsets II
  • Word search
  • Letter combinations of phone number
• Sliding window
  • Contains nearby duplicates
  • Longest repeating char replacement
  • Maximum subarray
  • Max profit
• Matrix
  • Max area of island
  • Number of islands
  • Surrounded regions
  • Walls and gates
• Greedy algorithms
  • Knapsack
  • Max area of island
  • Huffman coding
  • Jump game
  • Valid parentheses string
• Dynamic programming
  • 1D
    • Climbing stairs
    • Coin change
    • Decode ways
    • House robber
    • House robber II
    • Integer break
    • Kadanes algorithm
    • Longest increasing subsequence
    • Longest palindromic substring
    • Min cost climbing stairs
    • Weighted independent sets
  • 2D
    • Coin change II
    • Best time to buy and sell stock
    • Longest common subsequence
    • Max profit
    • Unique paths
• Two pointer
  • Container with most water
  • Three sum
  • Two sum input array is sorted
  • Valid palindrome
• String manipulation
  • Add strings
  • Are strings isomorphic
  • Longest palindrome
  • Reverse words in string
  • Wildcard matching
• NP complete problems
  • Traveling salesman
• Binary tree problems
  • Binary tree right side view
  • Convert bst to greater tree
  • Count good nodes in binary tree
  • Diameter of a binary tree
  • Insert in bst
  • Invert tree
  • Is balanced
  • Is same tree
  • Is subtree
  • Kth smallest element in bst
  • Level order traversal
  • Lowest common ancestor in binary tree
  • Max depth
  • Path sum
  • Validate binary search tree
  • Binary tree maximum path sum
• Hashing and arrays
  • Encode and decode strings
  • Find disappeared nums
  • Find duplicate number
  • K diff pairs
  • Kth largest element in unsorted array
  • Merge intervals
  • Remove duplicates of sorted array
  • Rotate array
  • Stacks
  • Valid anagram
  • Valid matrix
• Bit manipulation
  • Find missing
  • Missing number
• Binary search problems
• Missing number
• Others
  • Divide and Conquer
    • Array Inversions