Leetcode | 443. String Compression | Medium | Java Solution

preview_player
Показать описание
This video has the Problem Statement, Solution Walk-through, Code and Dry Run for 443. String Compression, with a Time Complexity of O(n) and Space Complexity of O(1).

Time Stamps ⏱️:
0:00 - Problem Statement
1:18 - Solving the Problem
6:22 - Coding [Java]
10:07 - Time & Space Complexity
____
443. String Compression
Leetcode String Compression
String Compression
String Compression Leetcode Solution
String Compression Java Solution
Leetcode 443
Leetcode 443 solution
Leetcode Solutions Playlist
Leetcode Java Solutions Playlist
Leetcode Easy Solutions
Developer Docs Leetcode
String Compression Developer Docs
Leetcode Medium Solutions Java

Hashtags:
#leetcode #leetcodesolution #java #leetcodedailychallenge
Рекомендации по теме
Комментарии
Автор

Correction: At 5:18, end is at 7 and not 6. So e - s = 7 - 4 = 3. Therefore, c is 3 and not 2.
Please do a dry run and see that e = 7 in the last iteration making it out of bounds.

developer-docs
Автор

c should be 3 not 2 so how do you deal with that cause 6 - 4 to get 2 makes no sense it should be 7 - 4 to get 3 but how do you do that

siobhanmarshall
Автор

understood sir, but there are some minor issues btw great explaination

gayiii