We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Array Manipulation
Array Manipulation
Sort by
recency
|
2420 Discussions
|
Please Login in order to post a comment
This is the solution for my code:
long arrayManipulation(int n, vector> queries) { long res[n], max=0;
}
But only 8/16 TCs are passing. 7/16 TCs are failing with segmentation fault. 1 TC is failing with the wrong answer. I cannot figure it out which part of the code is causing the segmentation fault. Can anyone help?
Wow, parallelPrefix came out to play! This was fun, here are three Java 15 solutions to optimize for 1) runtime 2) space 3) availability, respectively.
timeout error ....
Python / Prefix Sum / Sparse Array
The question is not framed correctly and hence the problem is not easy to comrehend. if this is better framed, a lot of attmpts will be made to solve this challenge.