the project is Under Development

a comprehensive list of algorithms related to the coding challenges

the list is not completed yet, under development

Sorting Algorithms

1. Bubble Sort
2. Insertion Sort
3. Selection Sort
4. Merge Sort
5. Quick Sort
6. Heap Sort
7. Radix Sort
8. Bucket Sort
9. Shell Sort
10. Counting Sort
11. Tim Sort

Searching Algorithms

11. Linear Search
12. Binary Search
13. Interpolation Search
14. Exponential Search
15. Hashing (e.g., using hash tables)

Graph Problems

16. Depth-First Search (DFS)
17. Breadth-First Search (BFS)
18. Dijkstra's Algorithm
19. Bellman-Ford Algorithm
20. Floyd-Warshall Algorithm
21. Kruskal's Algorithm (Minimum Spanning Tree)
22. Prim's Algorithm (Minimum Spanning Tree)
23. Topological Sort
24. Strongly Connected Components
25. Eulerian Path/Circuit
26. Hamiltonian Path/Cycle
27. Travelling Salesman Problem
28. Maximum Flow (Ford-Fulkerson, Edmonds-Karp)
29. Minimum Cut
30. Bipartite Matching (Hopcroft-Karp Algorithm)

Dynamic Programming Problems

31. Fibonacci Sequence
32. Knapsack Problem
33. Longest Common Subsequence
34. Edit Distance
35. Longest Increasing Subsequence
36. Matrix Chain Multiplication
37. Coin Change Problem
38. Rod Cutting Problem
39. Palindrome Partitioning
40. Subset Sum

Tree Problems

41. Tree Traversals (Inorder, Preorder, Postorder)
42. Binary Search Trees (BST)
43. AVL Trees
44. Red-Black Trees
45. B-Trees
46. Trie (Prefix Tree)
47. Lowest Common Ancestor (LCA)
48. Segment Trees
49. Fenwick Trees (Binary Indexed Trees)
50. Huffman Coding

String Problems

51. Brute Force String Matching
52. Knuth-Morris-Pratt (KMP) Algorithm
53. Boyer-Moore Algorithm
54. Longest Palindromic Substring
55. Rabin-Karp Algorithm
56. String Edit Distance (Levenshtein Distance)
57. Regular Expression Matching

Heap and Priority Queue

58. Binary Heap
59. Fibonacci Heap
60. Priority Queue (Min-Heap/Max-Heap)

Hashing and Hash Tables

61. Hash Functions
62. Open Addressing
63. Separate Chaining
64. Linear Probing
65. Quadratic Probing
66. Cuckoo Hashing

Geometric Algorithms

67. Convex Hull (Graham's Scan, Jarvis March)
68. Closest Pair of Points
69. Line Intersection
70. Polygon Triangulation

Miscellaneous Algorithms

71. Union-Find (Disjoint Set Union)
72. Interval Tree
73. Suffix Array
74. Suffix Tree
75. Minimum Spanning Arborescence
76. Game Theory (e.g., Nim Game)
77. Longest Path in a DAG
78. Maximum Subarray Sum (Kadane's Algorithm)
79. Majority Element (Boyer-Moore Voting Algorithm)
80. Hash-based Set and Map (e.g., HashSet, HashMap)

---

algorithms to solve specific problems

1. Knutt-Morris-Pratt (KMP) : algorithm is a pattern matching algorithm that improves upon naive pattern matching by utilizing information from previous matches to avoid unnecessary re-comparisons
2. manacher's algorithm : used to find the longest palindromic substring in any given string
3. Hamming Weight : find number of 1 bits in a binary representation