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.
Could you please STOP your narcissism and STOP SPAMMING people to advertise your video?
It's ok the one with solution is there to help on your doorstep everytime you're stuck
However I only use c to solve the programs but after viewing the whole video I find that his solution contains some things possible only in java which comes out as a time waste.
Thanks for your feedback but i am trying my best to provide generic algorithm which can be used in any programming language.
In most of the cases, we use map in java but array is an equivalent data structure which can be used in place of map and do the same thing.
If you came across such senario, please let us know.
I hope it will help.
I will have to understand the said topic to use its equivalent in c that will take time.