Hi Coding Lover,

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.

https://youtu.be/BZdnvTBO4vI

Note: if you find it useful, please do not forget to like and share your feedback in comments.


🔴 DONT CLICK THIS: https://bit.ly/2G4cEuc

Thank you so much guys for being a part of JAVAID 1K family.

🆕 JAVAAID - Coding Interview Preparation: House Robber Problem | Maximum Sum Sub-sequence Non-Adjacent Pattern | Dynamic programming | EP4

(Re-post)
Hi guys,

If you have not watched this tutorial just because it,s long ,you are missing alot.

In this tutorial, i have explained each and every thing which you need to know to deal with knapsack algorithm.

I have covered five different algorithms to solve this problem with proof.
https://youtu.be/aL6cU5dWmWM

Hello Coding lover,


In this video, I have solved hackerrank Ice Cream Parlor problem in an easy way which is based on Two Sum LeetCode problem.

Here I have explained three optimal approaches to solve this problem.
Two sum with hashmap or without hashmap.


https://youtu.be/7sEHjHef2zo

Note: if you find it useful, please do not forget to like and share your feedback in comments.


🔴 DONT CLICK THIS: https://bit.ly/2G4cEuc

Hello Coding lover,

In this video, I have explained 4 different ways to find the length of Longest Common Subsequence problem.

**Table of contents in short**-
Recursive Solution
Top down approach with memoization
Bottom-up approach using 2-D array
Bottom-up approach using 1-D array

https://youtu.be/DuikFLPt8WQ

Note: if you find it useful, please do not forget to like and share your feedback i

Hey Everyone,

I was on Diwali vacation and visited my home town. So I could not upload any content during these days.
But now I am back to work.
Will see you soon with new content.

Hi Coding Lover,

Today, I have explained the technique to solve Count Triplets hackerrank problem in O(N) time.
Note: if you find it useful, please do not forget to like and share your feedback in comments.

https://youtu.be/tBFZMaWP0W8

🔴 DONT CLICK THIS: https://bit.ly/2G4cEuc

Hi Coding Lover,

Today, I have explained the technique to solve Triple sum hackerrank problem in optimize way.

Note: if you find it useful, please do not forget to like, comment and share with your friends.

https://youtu.be/pVkHLciuank