|
Alternate solution for Longest Substring with Distinct Characters (hard). Is this right?
|
|
1
|
133
|
June 17, 2022
|
|
Confused `windowStart = Math.max(windowStart, charIndexMap.get(rightChar) + 1);`
|
|
5
|
577
|
May 25, 2022
|
|
Instead of window_start = max(window_start, char_index_map[right_char] + 1) why not just set char_index_map = {}
|
|
0
|
104
|
May 23, 2022
|
|
Window_start = max(window_start, char_index_map[right_char] + 1)
|
|
0
|
218
|
April 15, 2022
|
|
A item with same Key already exists
|
|
1
|
210
|
March 1, 2022
|
|
Python Soln Using Previous Two Problems Algorithm
|
|
1
|
247
|
October 14, 2021
|
|
Window_start = max(window_start, char_index_map[right_char] + 1)?
|
|
3
|
402
|
October 6, 2021
|
|
"No-repeat Substring" alternate solution?
|
|
1
|
222
|
September 10, 2021
|
|
Wouldn't this be a simpler solution to understand
|
|
1
|
227
|
September 10, 2021
|
|
My O(N + N) solution based on the previous problems but using a Set
|
|
1
|
226
|
August 22, 2021
|
|
Solution using Medium implementation, Does this work (Should still be O(n))?
|
|
0
|
154
|
April 12, 2021
|
|
Simpler solution, am I missing something?
|
|
1
|
263
|
March 31, 2021
|
|
Since we are checking the HashMap/Array, does it mean a O(N^2) complexity?
|
|
1
|
161
|
January 7, 2021
|
|
Confused on solution
|
|
1
|
344
|
January 7, 2021
|
|
No Repeat Substring - Without Trick
|
|
0
|
226
|
December 23, 2020
|
|
My Solution Needs No HashMap
|
|
2
|
391
|
August 22, 2020
|
