Back to course home
0% completed
Vote For New Content
Unnecessary short distance calculations
AnonymousManuel
Jan 7, 2025
1
20
0
Oct 18, 2025
Correction required in the solution description
Sachin Dev S
Sep 22, 2024
2
35
1
Jan 2, 2025
failure scenario
anuraagkiran555
Aug 2, 2024
0
24
1
Oct 2, 2024
Time complexity should be O(N*K), where K is the length of the longest word
Bruno Ely
Jan 11, 2024
1
40
2
May 23, 2024
I think this solution needs a part explaining why exactly this algorithm works
Dmitry Gachkovsky
Dec 3, 2023
0
52
1
Aug 21, 2025
Isn't it more accurate to call this a one-pointer approach?
izanmubarak
Aug 16, 2023
2
48
0
Dec 23, 2023