You are viewing a single comment's thread. Return to all comments →
Today, I have explained How To Solve Sparse Arrays hackerrank problem in O(N+Q) time.
In this video tutorial, I have shared one of TIP to optimize the solution.
Please watch this video till the end and let me know, If you have any doubts or a better approach to solve this problem.
and don't forget to mention the points which you have got in the hackerrank platform after solving this challenge.
If interested to know more about the generic algorithm in details-
click here for the video explanation of generic algorithm with complexity analysis.
or you can click on the image too to follow youtube tutorial.
Would really appreciate your feedback like, dislike , comment etc. on my video.