Update algorithms/stack/minimum_string_length_after_removing_substrings/README.md

Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>

Author: BrianLusina

algorithms/stack/minimum_string_length_after_removing_substrings/README.md

@@ -21,9 +21,9 @@ Example 4:
 Input: s = "ABFCACDB"
 Output: 2
 Explanation: We can do the following operations:
-- Remove the substring "ABFCACDB", so s = "FCACDB".
-- Remove the substring "FCACDB", so s = "FCAB".
-- Remove the substring "FCAB", so s = "FC".
+- Remove the substring "AB", so s = "FCACDB".
+- Remove the substring "CD", so s = "FCAB".
+- Remove the substring "AB", so s = "FC".
 So the resulting length of the string is 2.
 It can be shown that it is the minimum length that we can obtain.
 ```