Basics | Krybot Code

1. Basic Sorting Algorithms
1. Bubble Sort
2. Selection Sort
3. Insertion Sort
4. Merge Sort
5. Quick Sort
6. Heap Sort
7. Counting Sort
8. Radix Sort
9. Bucket Sort

2. Searching Algorithms
10. Linear Search
11. Binary Search
12. Jump Search
13. Interpolation Search
14. Exponential Search
15. Ternary Search

3. Graph Algorithms
16. Depth-First Search (DFS)
17. Breadth-First Search (BFS)
18. Dijkstra’s Shortest Path Algorithm
19. Bellman-Ford Algorithm
20. Floyd-Warshall Algorithm
21. Kruskal’s Minimum Spanning Tree (MST)
22. Prim’s Minimum Spanning Tree (MST)
23. Topological Sort
24. Kahn’s Algorithm for Topological Sorting
25. Tarjan’s Algorithm for Strongly Connected Components
26. Kosaraju’s Algorithm for Strongly Connected Components
27. Ford-Fulkerson Algorithm for Maximum Flow
28. Edmonds-Karp Algorithm (BFS-based Maximum Flow)
29. Dinic’s Algorithm (Maximum Flow)
30. Hopcroft-Karp Algorithm (Maximum Bipartite Matching)
31. Bellman-Ford Algorithm for Negative Cycles

4. Dynamic Programming
32. Fibonacci Sequence (DP)
33. Knapsack Problem (0/1 Knapsack)
34. Longest Common Subsequence
35. Longest Increasing Subsequence
36. Matrix Chain Multiplication
37. Edit Distance
38. Coin Change Problem
39. Subset Sum Problem
40. Partition Problem
41. Rod Cutting Problem
42. Unbounded Knapsack Problem
43. Longest Palindromic Subsequence

5. Greedy Algorithms
44. Activity Selection Problem
45. Fractional Knapsack Problem
46. Huffman Coding
47. Kruskal’s Algorithm for MST
48. Prim’s Algorithm for MST
49. Job Sequencing Problem
50. Optimal Merge Pattern

6. Backtracking
51. N-Queens Problem
52. Sudoku Solver
53. Subset Sum Problem
54. Permutations and Combinations
55. Hamiltonian Path/Circuit
56. Knight’s Tour Problem
57. Graph Coloring Problem

7. Graph Theory Algorithms
58. Eulerian Path and Circuit
59. Hamiltonian Path and Circuit
60. Articulation Points (Cut Vertices)
61. Bridges in Graphs (Cut Edges)
62. Bipartite Graph Check
63. Maximum Bipartite Matching
64. Strongly Connected Components (SCCs)
65. Bridge-Finding Algorithm

8. Number Theory Algorithms
66. Sieve of Eratosthenes (Prime Generation)
67. Greatest Common Divisor (GCD) - Euclidean Algorithm
68. Least Common Multiple (LCM)
69. Modular Arithmetic
70. Fast Exponentiation (Exponentiation by Squaring)
71. Modular Inverse (Extended Euclidean Algorithm)
72. Chinese Remainder Theorem
73. Prime Factorization
74. Miller-Rabin Primality Test
75. Fermat’s Little Theorem

9. Data Structures Algorithms
76. Segment Tree (with Lazy Propagation)
77. Fenwick Tree (Binary Indexed Tree)
78. Trie Operations
79. Union-Find Data Structure (Disjoint Set Union)
80. Splay Trees
81. Treap (Randomized Binary Search Tree)
82. AVL Trees
83. Red-Black Trees
84. Skip Lists

10. String Algorithms
85. KMP String Matching Algorithm
86. Rabin-Karp Algorithm
87. Z Algorithm
88. Suffix Array Construction
89. Suffix Tree Construction
90. Longest Common Prefix (LCP) Array
91. Manacher’s Algorithm (Longest Palindromic Substring)
92. Aho-Corasick Algorithm (Multi-pattern String Matching)
93. Edit Distance
94. String Hashing

11. Computational Geometry Algorithms

95. Convex Hull (Graham Scan, Jarvis March)

96. Line Intersection

97. Point in Polygon

98. Polygon Area Calculation

99. Sweep Line Algorithm

100. Segment Intersection