Algorithm & Data Structures

Yay! Its the first day of 2018.

I have compiled together a comprehensive list of standard Algorithm and Data Structures below. As a new year resolution, my goal will be to implement all of these using python. Furthermore, as I go deeper down the list, I will be adding links to article and video resources, that I used to understand these concepts.

Algorithmic complexity / Big-O / Asymptotic analysis

Before even getting started implementing these algorithms, its important to know about these topics :

• HackerRank - Big O (video)
• Harvard CS50 - Asymptotic Notation (video)

Data Structures (basic)

• Stacks
  • Tutorials Point - Stack
  • HackerRank - Stacks and Queues introduction (video)
  • Harvard CS50 - Implementation of Stack (video)
  • My Code School - Array Implementation of Stack (video)
  • Array Implementation of Stack (code)
• Queues
  • Tutorials Point - Queue
  • Programiz - Circular Queue
  • My Code School - Array Implementation of Circular/Normal Queue (video)
  • Array Implementation of Queue (code)
  • Array Implementation of Circular Queue (code)
• Linked Lists
  • Tutorials Point - Singly Linked List
  • Tutorials Point - Doubly Linked List
  • HackerRank - Singly Linked List (video)
  • Derek Banas - Singly Linked List (video)
  • My Code School - Doubly Linked List introduction (video)
  • Harvard CS50 - Doubly Linked List (video)
  • Singly Linked List (code)
  • Doubly Linked List (code)
• Binary Search Tree
  • GeeksforGeeks - BST Insertion and Search
  • GeeksforGeeks - BST Deletion
  • HackerRank - Tree/Binary-Search-Tree Introduction (video)
  • Joe James - BST Insertion, Search and Traversal (video)
  • MyCodeSchool - BST Deletion (video)
  • BST implementation (code)
• Heap (Binary Heap) / Priority Queue
  • Hacker Earth - Heaps/PriorityQueues
  • Cacti Council - Heaps/PriorityQueues Introduction (video)
  • HackerRank - Heaps/PriorityQueues Implementation (video)
  • Heap (code)
  • Priority Queue (code)

Data Structures (advanced)

• Trie/PrefixTree
  • GeeksForGeeks - Trie (Insert and Search)
  • HackerRank - Trie Introduction (video)
  • PersistentProgramming - Trie Implementation (video)
  • Trie (code)
• Segment trees
  • HackerEarth - Segment Tree)
  • Algorithms Live - Segment Tree
  • Segment Tree (code)
• Fenwick tree or Binary indexed tree(BIT)
• Disjoint data structures

Sorting Algorithms

• Selection
• Insertion
• Heapsort
• Quicksort
• Merge sort

Graph Algorithms

• Breadth first search (BFS)
• Depth first search(DFS)
• Strongly connected components (SCC)
• Minimum spanning tree(MST)
• Topological sort

Search Techniques

• Linear search
• Binary search
• Ternary search
• Hash Table
• Meet in the middle
• Interpolation Search

Dynamic programming

• Fibonacci Number Series
• Rod Cutting
• Knapsack
• Tower of Hanoi
• Dijkstra
• Floyd-Warshallx
• Matrix chain multiplication

Number theory

• Modular arithmetic
• Fermat’s theorem
• Chinese remainder theorem(CRT)
• Euclidean method for GCD
• Logarithmic Exponentiation
• Sieve of Eratosthenes
• Euler's totient function

Greedy Algorithm

• Activity Selection Problem
• Huffman Coding
• Job Sequencing Problem

Computational geometry

• Graham-Scan for convex hull
• Line sweep

Game theory

• Nim game
• Grundy numbers
• Sprague-Grundy theorem.

Strings

• Knuth Morris Pratt (KMP)
• Z algorithm
• Suffix arrays/Suffix trees