Regular Memory

A Collection of Insteresting Processes

Data Structures

  • Doubly Linked List
  • Queue
  • Heap (with Update Key)

Trees Structures

  • Binary Tree
  • Segment Tree
  • Trie Structure
  • Balanced AVL Tree
  • Union-Find Structure

Tree Traversal

  • Pre/In/Post Order Traversal

Tree Algorithims

  • Cycle Detection
  • Minimax Algorithim
  • Binary Search
  • Breadth/Depth First Search
  • Dijkstras Shortest Path Algorithim
  • Floyd-Warshall Algorithim

Sorting

  • Merge Sort
  • Topological Sort

Spanning Tree

  • Prims/Kruskal Minimum Spanning Tree

Dynamic Programing

  • Backtracking
  • Knapsack Problem
  • Kadane’s Algorithm
  • Edit Distance
  • Two Pointers (Max Contained Water)

Other

  • Maximum Matching
  • Marching Squares
  • K-Nearest Neighbours
  • Backpropagation (Neural Network)