The provided solution can use a simple improvement to reduce time complexity to O((N+M)*Len)
|
|
1
|
133
|
July 22, 2022
|
Provided solution is not optimal
|
|
1
|
370
|
September 8, 2022
|
Why do we need to check for greather than zero? + sc question
|
|
2
|
153
|
September 1, 2022
|
Need help with my almost solution
|
|
1
|
103
|
June 20, 2022
|
For loop logic, can someone explain?
|
|
2
|
168
|
June 10, 2022
|
Why is time complexity O(N∗M∗Len)?
|
|
4
|
358
|
April 13, 2022
|
The solution provided is NOT a sliding window solution
|
|
1
|
178
|
March 10, 2022
|
My solution in O(n) using sliding window. Could anybody take a look at it?
|
|
0
|
187
|
January 10, 2022
|
Why is this problem in the Sliding Window chapter?
|
|
1
|
273
|
December 22, 2021
|
O(N+M) time solution in Java (readable)
|
|
0
|
165
|
November 27, 2021
|
I used the same idea as find_permutation problem
|
|
2
|
202
|
November 7, 2021
|
Given a list of intervals, find the point where the maximum number of intervals overlap
|
|
1
|
187
|
October 18, 2021
|
Can you open up access to the tests on the "Try it yourself" Portions? I'd like to add several more tests to most of the questions
|
|
1
|
460
|
October 6, 2021
|
Why do we do `j+1` when comparing against wordCount?
|
|
1
|
189
|
September 13, 2021
|
Solution with O(N+M) time
|
|
0
|
175
|
May 5, 2021
|
Optimized version following solution of Problem Challenge 1
|
|
2
|
458
|
March 14, 2021
|
Why this problem is similar to Maximum Sum Subarray of Size?
|
|
6
|
691
|
September 7, 2020
|
The for loop makes no sense
|
|
1
|
362
|
September 7, 2020
|
Java. Reusing previous template (map+matched) O(n)
|
|
1
|
223
|
September 1, 2020
|
Optimizing with trie?
|
|
2
|
291
|
August 25, 2020
|
Defective answer!
|
|
1
|
285
|
August 25, 2020
|
Java solution using matched variable and shallow copy
|
|
0
|
179
|
June 15, 2020
|
Wrong Solution for "foxcati"
|
|
1
|
443
|
September 5, 2019
|