# Daily Algorithms - [1. Topological Sort](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/1.-topological-sort.md): class prerequisites - [2. MST- Prim, Kruskal](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/2.-mst-prim-kruskal.md) - [3. Cycle in a Graph](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/3.-cycle-in-a-graph.md): See Graph - [\[Algo\] Cycle in Graph (directed)](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/3.-cycle-in-a-graph/algo-cycle-in-graph-directed.md): check if there is a cycle in a directed graph - [4. Maximum sub array sum](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum.md) - [Problem](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/problem.md) - [Solutions](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/solutions.md) - [Brute Force](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/solutions/brute-force.md) - [Divide And Conquer](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/solutions/divide-and-conquer.md) - [Kadane's Algorithm - Dynamic](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/solutions/kadanes-algorithm-dynamic.md) - [Empty Array allowed](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-allowed.md) - [Empty Array not allowed](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-not-allowed.md) - [Empty Array Not Allowed + circular](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-not-allowed-+-circular.md) - [Double array:: O(N), O(N)](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-not-allowed-+-circular/double-array-o-n-o-n.md) - [minimum subarray:: O(N), O(1)](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-not-allowed-+-circular/minimum-subarray-o-n-o-1.md) - [5. Detect a Cycle in a graph with a disjoint set (Union Find)](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/5.-detect-a-cycle-in-a-graph-with-a-disjoint-set-union-find.md) - [6. Kruskal's Algorithm - Union Find](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/6.-kruskals-algorithm-union-find.md) - [7. Prim's Algorithm - Priority Queue](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/7.-prims-algorithm-priority-queue.md) - [8. Sort Array nlogn](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/8.-sort-array-nlogn.md) - [9. Shortest path - BFS](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/9.-shortest-path-bfs.md) - [10. Dijkstra algorithm](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/10.-dijkstra-algorithm.md) - [11. Minimum spanning tree - points](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/11.-minimum-spanning-tree-points.md) - [12. Minimum depth in a binary tree](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/12.-minimum-depth-in-a-binary-tree.md) - [13. \[Counting Sort\]: H-index](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/13.-counting-sort-h-index.md) - [14. \[shortest path\]: Floyd-Warshall](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/14.-shortest-path-floyd-warshall.md) - [15. \[Linked List\]: reverse list](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/15.-linked-list-reverse-list.md) - [16. \[Linked List\]: swap nodes in pairs](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/16.-linked-list-swap-nodes-in-pairs.md) - [17.\[Linked List\]: Merge k Sorted Lists](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/17.-linked-list-merge-k-sorted-lists.md) - [18.\[Linked list\]:234. Palindrome Linked List](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/18.-linked-list-234.-palindrome-linked-list.md) - [19. \[Linked List\]: Linked List Cycle](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/19.-linked-list-linked-list-cycle.md) - [20. \[Linked List\] Reverse Linked List II](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/20.-linked-list-reverse-linked-list-ii.md) - [21. \[Linked List\] sort a list - asc](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/21.-linked-list-sort-a-list-asc.md) - [22. \[Sort\] Quick Sort](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/22.-sort-quick-sort.md) - [23. \[matrix\] Spiral Matrix](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/23.-matrix-spiral-matrix.md) - [24. \[matrix\] Number of Islands](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/24.-matrix-number-of-islands.md) - [25. \[matrix\] Valid Sudoku](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/25.-matrix-valid-sudoku.md) - [26. \[matrix\] Sudoku Solver](https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/26.-matrix-sudoku-solver.md) --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://algorithm.prettylog.com/algorithm-problems/daily-algorithms.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.