Skip to content

Commit 14022a2

Browse files
authored
Update 1221-split-a-string-in-balanced-strings.md
1 parent cdb2962 commit 14022a2

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

dsa-solutions/lc-solutions/1200-1299/1221-split-a-string-in-balanced-strings.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -155,13 +155,13 @@ public:
155155

156156
### Complexity Analysis
157157

158-
- **Time Complexity**: \( O(n) \)
158+
- **Time Complexity**: O(n)
159159
- The algorithm iterates through each character in the input string exactly once, resulting in a linear time complexity relative to the length of the string \( n \).
160160

161-
- **Space Complexity**: \( O(1) \)
161+
- **Space Complexity**: O(1)
162162
- The algorithm uses a fixed amount of extra space (for the `count` and `ch` variables), regardless of the input size, resulting in constant space complexity.
163163

164164

165165
### References
166166

167-
- **LeetCode Problem**: Split a String in balanced Strings
167+
- **LeetCode Problem**: Split a String in balanced Strings

0 commit comments

Comments
 (0)