We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 43307f8 commit f7e4aaeCopy full SHA for f7e4aae
articles/minimum-window-with-characters.md
@@ -325,7 +325,7 @@ class Solution {
325
326
### Time & Space Complexity
327
328
-- Time complexity: $O(n ^ 2)$
+- Time complexity: $O(n ^ 2 * m)$
329
- Space complexity: $O(m)$
330
331
> Where $n$ is the length of the string $s$ and $m$ is the total number of unique characters in the strings $t$ and $s$.
@@ -702,7 +702,7 @@ class Solution {
702
703
704
705
-- Time complexity: $O(n)$
+- Time complexity: $O(n + m)$
706
707
708
0 commit comments