For more information about me, visit - www.jmugz3.com, www.josemugaburu.com
Using principles such as Divide and Conquer, Greedy Approach, Inductive Reasoning, Branch-and-Bound, Reduction, Recursion, Dynamic Programming and Memoization
Continuously updated.
- Graph Traversing (BFS, DFS)
- Searching (Binary search)
- Shortest Path (Dijsktra with fibonacci heap, Floyd-Warshall, Bellman-Ford)
- Cycle detection
- Divide and Conquer (MergeSort, Quicksort)
- Sorting (Heapsort)
- Flow (Ford-Fulkerson)
- Dynamic (Longest Common Subsequence, Knapsack)
- String/Pattern Matching (Knuth-Morris-Pratt)
- Sliding window
- Recursion and Master Theorem
- Job Scheduling (Round Robin, Shortest job first)
- Arrays, maps, queues and stacks
- Trees: Binary Search Trees, AVL trees, RedBlack trees, B-tree
- Segment Tree and K-D tree
- Hash Tables (Build, process, and hash-collisions)
- For stream: Tries, Suffix Tree
- Modeling
- MonteCarlo Simulation
- Mean, Standard Deviation
- Variance, co-variance, R-squared
- Probability (Bayes Theorem)
- Solve a y-function curve
- Matrix Operations
- Binary Exponentiation
- unit tests
- integration tests
- automated testing
- Previous web courses
- Checkers
- Bingo
- Calculator
- Towers of Hanoi
- Soccer Club Management
- FFT transform time domain to frequency domain
- RSA
- PageRank
- Fourier Transform