Tag archive

#dynamic programming

Topic-specific entry points for internal linking, discovery, and deeper subject exploration.

3 articles

Floyd-Warshall Algorithm in Java: All-Pairs Shortest Paths

While Dijkstra's algorithm finds the shortest path from a single source to all other nodes, the Floyd-Warshall algorithm finds the shortest paths between all pairs of vertices in a weighted graph. It is a classic example…

Apr 19, 20263 min read

Deep Dive

#dsa#java#graph

DSAIntermediate

Kadane's Algorithm in Java: Maximum Sum Subarray

Finding the Maximum Sum Subarray is a classic problem that can be solved in $O(n^2)$ using brute force. However, Kadane's Algorithm allows us to solve it in a single pass ($O(n)$ time and $O(1)$ space). It is a beautiful…

Apr 19, 20262 min read

Deep Dive

#dsa#java#algorithms

DSABeginner

Longest Common Subsequence (LCS) in Java: Dynamic Programming Guide

The Longest Common Subsequence (LCS) problem is a foundation of many string comparison tools, including git diff and bioinformatics software. A subsequence is a sequence that appears in the same relative order, but not n…

Apr 19, 20263 min read

Deep Dive

#dsa#java#algorithms