From 8ad2139dac9124860b128c9960bce909270ab744 Mon Sep 17 00:00:00 2001
From: adamhmielke <adamhmielke@gmail.com>
Date: Sun, 21 Sep 2025 18:26:31 -0700
Subject: [PATCH] Update is-subsequence.md

Correcting Complexity for 1 problem in is-subsequence
---
 articles/is-subsequence.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/articles/is-subsequence.md b/articles/is-subsequence.md
index 2d725e239..115af2e01 100644
--- a/articles/is-subsequence.md
+++ b/articles/is-subsequence.md
@@ -472,7 +472,7 @@ public class Solution {
 
 ### Time & Space Complexity
 
-- Time complexity: $O(n + m)$
+- Time complexity: $O(m)$
 - Space complexity: $O(1)$
 
 > Where $n$ is the length of the string $s$ and $m$ is the length of the string $t$.