Floyd Algorithm and Its Practical Applications in Graph Problems
Understanding the Floyd-Warshall Algorithm
The Floyd-Warshall algorithm is a classic dynamic programming approach used to compute the shortest paths between all pairs of vertices in a weighted graph. It operates efficiently on dense graphs where the number of edges is close to the square of the number of vertices. With a time complexity of \\(O ...
Posted on Thu, 25 Jun 2026 16:42:24 +0000 by antwonw
Interval Dynamic Programming: Classic Problems and Solutions
Progress: Dynamic Programming - Linear DP, Knapsack, Interval DP
Merging Palindromic Substrings
Tags: Interval DP
Foundation - Longest Palindromic Substring
Problem: Given a string (S), find the length of its longest palindromic substring.
Approach: A longer palindrome can always be constructed by adding identical characters to both ends of a s ...
Posted on Thu, 14 May 2026 05:56:34 +0000 by sb