Algorithms Notes for Professional
Hello
Developers! Today I will share with you such awesome notes if you follow and
practice the notes properly. You will not have to face any more problems with Algorithms, Inshallah. So let's discuss Algorithms
notes in detail.
List of Contents
Chapter 1: Getting Started with Algorithms
Chapter 2: Algorithms Complexity
Chapter 3: Big-O Notation
Chapter 4: Trees
Chapter 5: Binary Search Trees
Chapter 6: Check if a tree is BST or not
Chapter 7: Binary Tree traversals
Chapter 8: Lowest common ancestor of
a Binary Tree
Chapter 9: Graph
Chapter 10: Graph Traversals
Chapter 11: Dijkastra’s Algorithms
Chapter 12: A* Pathfinding
Chapter 13: A* Pathfinding Algorithms
Chapter 14: Dynamic Programming
Chapter 15: Application of Dynamic
Programming
Chapter 16: Kruskal’s Algorithms
Chapter 17: Greedy Algorithms
Chapter 18: Applications of Greedy
technique
Chapter 19: Prim’s Algorithms
Chapter 20: Bellman-Ford Algorithms
Chapter 21: Line Algorithms
Chapter 22: Floyd-Warshall Algorithms
Chapter 23: Catalan Number Algorithms
Chapter 24: Multithreaded Algorithms
Chapter 25: Knuth Morris Pratt (KMP)
Algorithms
Chapter 26: Edit Distance Dynamic Algorithms
Chapter 27: Online Algorithms
Chapter 28: Sorting
Chapter 29: Bubble Sort
Chapter 30: Merge Sort
Chapter 31: Insertion Sort
Chapter 32: Bucket Sort
Chapter 33: Quicksort
Chapter 34: Counting Sort
Chapter 35: Heap Sort
Chapter 36: Cycle Sort
Chapter 37: Odd-Even Sort
Chapter 38: Selection Sort
Chapter 39: Searching
Chapter 40: Substring Search
Chapter 41: Breadth-First Search
Chapter 42: Depth First Search
Chapter 43: Hash Functions
Chapter 44: Travelling Salesman
Chapter 45: Knapsack Problem
Chapter 46: Equation Solving
Chapter 47: Longest Common Subsequence
Chapter 48: Longest Increasing
Subsequence
Chapter 49: Check two strings are
anagrams
Chapter 50: Pascal’s Triangle
Chapter 51: Algo:- Print a m*n
matrix in square wise
Chapter 52: Matrix Exponentiation
Chapter 53: Polynomial-time bounded
algorithm for Minimum Vertex Cover
Chapter 54: Dynamic Time Warping
Chapter 55: Fast Fourier Transform
Appendix A: Pseudocode
|
Notes Details |
|
|
Notes Name |
Algorithms Notes for Professional |
|
Publisher |
GoalKicker |
|
Total Chapter |
55 |
|
Total Pages |
252 |
|
Category |
Free Programming E-book |
[Preview ##eye##] [Download ##download##]
Disclaimer!
This is an unofficial free book created for educational purposes and is not
affiliated with official Algorithms groups or companies. All trademarks and
registered trademarks are registered trademarks are the property of their
respective owners.
