0% completed
broken test
her ta
Feb 5, 2025
0
11
0
Feb 5, 2025
BROKEN TEST Your Input"catfoxscat" ["cat", "foxs"] Output[] Expected[] when it should be Expected[0,3]
sean.maginnis.sm
Jan 25, 2025
1
17
1
Apr 20, 2025
This problem can be solved effectively in O(NL).
AnonymousAdam
Sep 2, 2024
0
38
0
Sep 2, 2024
O(NL) Solution. Where N is the length of the input string text, and L is the length of each word in words.
Mohammed Dh Abbas
Jul 12, 2024
0
31
1
May 31, 2025
What is the pattern for longest palindromic substring?
K D
Aug 17, 2022
1
23
0
Apr 21, 2024
public static List wordConcatenation(String inputString, String [] wordsList) { ...
Sukumar
Aug 9, 2022
0
16
1
Apr 21, 2024
does anyone know what the OR 0 means in the JS code?if (wordsSeen[word] > (wordF...
linochoa11690
May 12, 2022
1
7
1
Jul 22, 2024
The solution is not Sliding Window. For example, this is equivalent to Solution ...
Fah Pariyavuth
Feb 24, 2022
31
128
4
Jul 10, 2024
This needs a code comment on the first loop's signature.
Ada
Feb 13, 2022
5
29
4
Apr 21, 2024
I'm wondering why the time complexity is O(N * M * Len) and not O(N * M)?
Alexander Bondarenko
Jan 9, 2022
2
34
1
Feb 24, 2022