From 7ec1c6c80fee6cf2e3f043980305333848bdd519 Mon Sep 17 00:00:00 2001
From: squenson1 <125811472+squenson1@users.noreply.github.com>
Date: Sat, 4 Jan 2025 19:58:56 +0000
Subject: [PATCH] Update longest_increasing_subsequence.py

Counter-example that doesn't return the longest increasing subsequence
---
 dynamic_programming/longest_increasing_subsequence.py | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/dynamic_programming/longest_increasing_subsequence.py b/dynamic_programming/longest_increasing_subsequence.py
index d839757f6da5..d349fe3ce37a 100644
--- a/dynamic_programming/longest_increasing_subsequence.py
+++ b/dynamic_programming/longest_increasing_subsequence.py
@@ -11,6 +11,12 @@
 Example:
     ``[10, 22, 9, 33, 21, 50, 41, 60, 80]`` as input will return
     ``[10, 22, 33, 41, 60, 80]`` as output
+
+Sorry, this doesn't work for this counter-example:
+    ``[28, 26, 12, 23, 35, 39]`` as input will return
+    ``[26, 35, 39]`` as output
+    instead of
+    ``[12, 23, 35, 39]`` as output
 """
 
 from __future__ import annotations