From 430b1ac5014b3c1335d5c075e3c05ae4694bdd78 Mon Sep 17 00:00:00 2001
From: PranavPuranik <54378813+PranavPuranik@users.noreply.github.com>
Date: Tue, 31 Dec 2019 06:42:56 -0500
Subject: [PATCH] contents: link to LeetCode's Longest Common Subsequence
 question (#150)

---
 contents/algorithms/dynamic-programming.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contents/algorithms/dynamic-programming.md b/contents/algorithms/dynamic-programming.md
index d8879fe3..773f075e 100644
--- a/contents/algorithms/dynamic-programming.md
+++ b/contents/algorithms/dynamic-programming.md
@@ -20,7 +20,7 @@ Sometimes you do not need to store the whole DP table in memory, the last two va
 - [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)
 - [Coin Change](https://leetcode.com/problems/coin-change/)
 - [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)
-- [Longest Common Subsequence](https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/)
+- [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)
 - [Word Break Problem](https://leetcode.com/problems/word-break/)
 - [Combination Sum](https://leetcode.com/problems/combination-sum-iv/)
 - [House Robber](https://leetcode.com/problems/house-robber/) and [House Robber II](https://leetcode.com/problems/house-robber-ii/)