0% completed
Cleaner Approach, easy to understand. JAVA
Ali Simsek
Feb 7, 2025
0
21
0
Feb 7, 2025
Alternate solution in C#
Debasis B
Jan 30, 2025
0
2
0
Jan 30, 2025
Can we solve it by using sliding window + DFS?
lejafilip
Aug 29, 2024
0
20
0
Aug 29, 2024
I think this is easier to understand than the official solution.
Mohammed Dh Abbas
May 29, 2024
0
50
0
May 29, 2024
Test case explanation
random979
Jan 3, 2024
0
22
1
Jul 23, 2024
Prefix Sum?
sevillaarvin
Sep 11, 2023
0
50
0
Sep 11, 2023
Why do we have to instantiate pathCount to 0? When i dont do that, i get an over...
Alfonso Vieyra
Sep 29, 2022
0
23
0
Sep 29, 2022
int count =0; HashMap hmap = new HashMap(); public int pathS...
Avinash Agarwal
Apr 6, 2022
0
24
1
Apr 6, 2022
How is the current implementation checking sum of every possible sub-paths? The ...
hj3yoo
Mar 3, 2022
0
26
1
Mar 3, 2022
I think we don't need the list neither the backtracking. We can just do two recu...
Athanasios Petsas
Feb 15, 2022
0
55
4
Mar 27, 2022
The solution works, but confused about the backtracking (`currentPath.pop();`)Af...
Ray
Jan 21, 2022
2
31
2
Jul 27, 2023
struggled with this question. missed having to find all sub paths of current no...
Interviews
Jan 13, 2022
2
47
1
Mar 31, 2024
On this page