A Bitter Truth About Dynamic Programming

Dynamic programming is not that much tuff as it looks but needs a lot more practice than anything else. but still, it can always surprise you.

Even I struggled a lot but after solving a lot of coding problems, I saw some patterns which can be applied to a similar type of dynamic programming problems and thought of sharing with you all for free.

You can visit my youtube channel "JAVAAID -Coding Interview Preparation" to learn more about it.

I know there are a lot of resources out there on the internet but the problem is they will show you the direct solution but did not tell you, how they have arrived at that solution which will not help much.

But I have tried my best to cover this in my tutorial.

I have created a playlist Dynamic Programming Tutorial For Beginners which covers dynamic programming patterns problems and the most important thing Technique to Solve Any dynamic programming questions.

If you follow the four steps or FAST technique which are mentioned in this video, you will be able to solve any DP problems.

F→ Find the recursive solution
A→ Analyze the solution
S→ Save the result
T→ Tweak the solution

https://youtu.be/ewXklhesC-w

NOTE: If you find this tutorial helpful, please provide your feedback on my youtube video.

Hello Coding Lover,
In this video, I have explained the sliding window technique and how to use it. which is an optimal way to solve maximum size subarray of size K coding interview problem.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

and this question is also asked in Google coding Interview in Telephonic round.

https://youtu.be/__guhvzO540

Hey Guys,
We are on instagram too.
Please follow us on instagram.
@javaaid.algorithms

I am planning to come up with some interesting way to learn ds algo on insta.but need your support, please support us by following us on instagram.

Once we have some good numbers on instagram community, will start that service.

Please follow 👉 @javaaid.algorithms

🙏🙏🙏

Hello Coding Lover,
Just Learn this Amazing technique which is discussed in this tutorial and you will be able to solve more than 10 questions on leetcode.

In this video, I have explained two pointer technique which is the optimal way to solve problems related to arrays, strings and linked list in O(N) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.
https://youtu.be/2wVjt3yhGwg
🔴 DONT CLICK THIS: https://bit.ly/2G4cEuc
#JAVAAID #slidingwindowtechnique #leetcode #javaAidTutorials #programming #dataStructures #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #kanahaiyaGupta #google #facebook #amazon #oracle #linkedin

Hello Coding Lover,
In this video, I have explained a general approach to solve climbing staircase problem which is based on fibonacci pattern.

how to identify the pattern and apply the same to solve such DP problems.

Here I have explained, four different ways to solve this problem.

Recursive Solution
Top-down with memoization
Bottom-up
Efficient solution
https://youtu.be/ftpbBbtyxdE

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

#JAVAAID #staircase #leetcode #javaAidTutorials #programming #dataStructures #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #kanahaiyaGupta #google #facebook #amazon #oracle #gs #walmart

Wishing you and your family a happy HOLI....!!!

Hello friends,
In this video, I have explained the 4 different ways to solve Longest Common Subsequence problem.

Here is the complete video tutorial which explains a generic algorithm with complexity analysis.
🔴 DONT CLICK THIS: https://bit.ly/2G4cEuc

outline:-
1 ) Longest common subsequence using recursion
2) Longest common subsequence recursion with memorization or top-down approach
3) Longest common Subsequence using bottom-up approach using the 2-D array
4) Longest common subsequence using a bottom-up approach using the 1-D array

https://youtu.be/DuikFLPt8WQ

Let's see how many people know the correct answer?

What will be the complexity to find the Length Of The Longest Consecutive 1s In Binary representation of a number?

a) O(n) b) O(logn)
c) O(K) where K is no. of zeros d) None of these.

First comment your option below and then watch the video to know whether you are right or wrong?

https://youtu.be/bc7cxeDy308

Today JAVAAID has hit 10,000 subscribers. Which I have never thought of. I want to thank each and every one of you for subscribing ❤️.

Now we are 10K family now

Interviewer: Do you know Dynamic Programming?
Me: Yes, a little bit.

Interviewer: Not prepared well, it seems, hmm?
Me: No issues, you can ask problem, will try to solve.

Interviewer: Suppose you are in electronics shop and owner went for lunch.
As no one is there in the shop and you thought of stealing the electronics item from his shop.
But you have only one bag which has capacity of 4lbs and you can put the item into your bag to hide.
But due to bag constraint you can only focus small item which are-
Phone having weight 1 lbs and price 150$
Laptop having weight 4 lbs and price 300$
Tablet having weight 3 lbs and price 200$

Write an algorithm to calculate the maximum profit which you can get without caught.
Me: smiled a bit, as all the given values seem familiar to me 🙂

For those who want to know how I answered for this problem here is the link-
https://youtu.be/aL6cU5dWmWM

Moral: Not only candidate even Interviewer also watches tutorials to judge the candidate. 😀

This tutorial ranked number 1 on Google and YouTube.so thought of sharing with you all.

If you are a competitive programmer or preparing for competitive programming or solve coding problems online then you would have come across one algorithm called prefix sum.
But most of people do know the benefit of this algorithm.

Here is the tutorial which explains why you must know prefix-sum algorithm.

https://youtu.be/scD312I7kkE
#tutorial #coding #programming #learntocode #algorithm #prefixsum #competitiveprogramming

This tutorial also 𝗿𝗮𝗻𝗸𝗲𝗱 𝗻𝘂𝗺𝗯𝗲𝗿 𝟭 on 𝗚𝗼𝗼𝗴𝗹𝗲 and 𝗬𝗼𝘂𝗧𝘂𝗯𝗲.so thought of sharing 𝗣𝗮𝗿𝘁-𝟮 with you all.

If you are a 𝗰𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗽𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗲𝗿 or preparing for 𝗰𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗽𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 or solve coding problems online then you would have come across one algorithm called 𝗽𝗿𝗲𝗳𝗶𝘅 𝘀𝘂𝗺.

Here is the 𝗣𝗮𝗿𝘁-𝟮 of my previous tutorial which explains what is 𝗽𝗿𝗲𝗳𝗶𝘅 𝘀𝘂𝗺 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺 and how it works?
https://www.youtube.com/watch?v=pVS3yhlzrlQ

How many of you thought that I have solved the problem in an interview but still did not 𝗴𝗲𝘁 𝘁𝗵𝗲 𝗼𝗳𝗳𝗲𝗿 or did not get what I expected?

If this has happened to you then this tutorial will be going to an eye-opener for you.

Generally, the candidate solves the problem with a brute force approach but ignore the optimize solution.
If you know this technique you can 𝗱𝗿𝗮𝘀𝘁𝗶𝗰𝗮𝗹𝗹𝘆 𝗿𝗲𝗱𝘂𝗰𝗲 𝘁𝗵𝗲 𝘁𝗶𝗺𝗲 𝗰𝗼𝗺𝗽𝗹𝗲𝘅𝗶𝘁𝘆 𝗼𝗳 𝘆𝗼𝘂𝗿 𝘀𝗼𝗹𝘂𝘁𝗶𝗼𝗻 𝗳𝗿𝗼𝗺 𝗢(𝗻²) 𝘁𝗼 𝗢(𝗻) and you can get a slight advantage in your interview.


And this technique is known as 𝗦𝗹𝗶𝗱𝗶𝗻𝗴 𝗪𝗶𝗻𝗱𝗼𝘄 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is useful for solving problems related to 𝗮𝗿𝗿𝗮𝘆𝘀 𝗼𝗿 𝘀𝘁𝗿𝗶𝗻𝗴𝘀.

https://youtu.be/__guhvzO540

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

#slidingwindow #technique #algorithms #code #programming #coding #slidingwindowalgorithm

Hello Coding Lover,

In this video tutorial, I have explained the beautiful problem-solving technique called 𝗥𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻 and its applications.

If you can visualize this 2D image in 3D then probably you would have heard of 𝗥𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻.

𝑺𝒐𝒎𝒆 𝒕𝒊𝒎𝒆𝒔 𝒎𝒂𝒌𝒊𝒏𝒈 𝒂 𝒕𝒉𝒖𝒎𝒃𝒏𝒂𝒊𝒍 𝒘𝒊𝒍𝒍 𝒕𝒂𝒌𝒆 𝒎𝒐𝒓𝒆 𝒕𝒊𝒎𝒆 𝒕𝒉𝒂𝒏 𝒕𝒖𝒕𝒐𝒓𝒊𝒂𝒍 :)

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

https://youtu.be/Sf-LR7OI-Ww

#JAVAAID #recursion #leetcode #javaAidTutorials #programming #dataStructures #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #kanahaiyaGupta #google #facebook #amazon #oracle #linkedin

Have you ever thought of how 𝗿𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻 𝘄𝗼𝗿𝗸𝘀 𝗶𝗻𝘁𝗲𝗿𝗻𝗮𝗹𝗹𝘆?
if not, watch this video to know the 𝗶𝗻𝘁𝗲𝗿𝗻𝗮𝗹𝘀 𝗼𝗳 𝗿𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻.

In this video, I have 𝗺𝗼𝗱𝗶𝗳𝗶𝗲𝗱 𝗮 𝗽𝗿𝗼𝗴𝗿𝗮𝗺 𝗶𝗻 𝘀𝘂𝗰𝗵 𝗮 𝘄𝗮𝘆 that it will 𝘁𝗲𝗮𝗰𝗵 𝘆𝗼𝘂 𝗮𝗯𝗼𝘂𝘁 𝗿𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻 𝗶𝗻𝘁𝗲𝗿𝗻𝗮𝗹 which will help you in 𝘃𝗶𝘀𝘂𝗮𝗹𝗶𝘇𝗶𝗻𝗴 𝗿𝗲𝗰𝘂𝗿𝘀𝗶𝘃𝗲 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀.

Here are the outlines for easy navigation:-
👉 Recursion Flow Chart
👉 Recursion Execution Flow
👉 Tree Visualization
👉 Memory Visualization
👉 Demo

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

https://lnkd.in/fnEEdKs

#JAVAAID #recursion-visualization #leetcode #javaAidTutorials #programming #recurion-basics #recursion-tutorial #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #kanahaiyaGupta #google #facebook #amazon #oracle #linkedin

Hey Coding Lover,

This is the next tutorial in our recursion series. So far, we have learnt how 𝗿𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻 𝘄𝗼𝗿𝗸𝘀 𝗶𝗻𝘁𝗲𝗿𝗻𝗮𝗹𝗹𝘆?

Now it is time to dig deeper and understand 𝗿𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻 𝘁𝘆𝗽𝗲𝘀 𝗮𝗻𝗱 𝗱𝗶𝗳𝗳𝗲𝗿𝗲𝗻𝗰𝗲 𝗯𝗲𝘁𝘄𝗲𝗲𝗻 𝗶𝘁.

In this video, I have tried my best to explain the 𝗵𝗲𝗮𝗱 𝗮𝗻𝗱 𝘁𝗮𝗶𝗹 𝗿𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻 𝗮𝗻𝗱 𝘁𝗵𝗲 𝗱𝗶𝗳𝗳𝗲𝗿𝗲𝗻𝗰𝗲 𝗯𝗲𝘁𝘄𝗲𝗲𝗻 𝗶𝘁, 𝘃𝗶𝗮 𝗮𝗻𝗶𝗺𝗮𝘁𝗶𝗼𝗻.
which will help you in 𝘃𝗶𝘀𝘂𝗮𝗹𝗶𝘇𝗶𝗻𝗴 𝗿𝗲𝗰𝘂𝗿𝘀𝗶𝘃𝗲 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀.
Here are the outlines for easy navigation:-

👉 [𝟬𝟬:𝟰𝟭] 𝗛𝗲𝗮𝗱 𝗥𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻
👉 [𝟬𝟲:𝟭𝟰] 𝗧𝗮𝗶𝗹 𝗥𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻
👉 [𝟭𝟭:𝟮𝟯] 𝗛𝗲𝗮𝗱 𝗩𝗦 𝗧𝗮𝗶𝗹 𝗥𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻
👉 [𝟭𝟱:𝟬𝟮] 𝗗𝗲𝗺𝗼
👉 [𝟭𝟴:𝟬𝟲] 𝗤𝘂𝗶𝗰𝗸 𝗤𝘂𝗶𝘇?

𝗡𝗼𝘁𝗲: if you find it useful, please do not forget to like and share your feedback in comments.
https://youtu.be/lG6HxO7cDRw
#JAVAAID #headrecursion #tailrecursion #headvstailrecursion #leetcode #javaAidTutorials #programming #recursion-basics #recursion-tutorial #algorithms #coding #competitiveprogramming #google #java #problemsolving #kanahaiyaGupta

Hi Coding Lover,

Here is one more tutorial which will 𝗲𝗻𝗵𝗮𝗻𝗰𝗲 𝘆𝗼𝘂𝗿 𝗱𝗲𝗯𝘂𝗴𝗴𝗶𝗻𝗴 𝘀𝗸𝗶𝗹𝗹𝘀.

Today, I have explained how to 𝘃𝗶𝘀𝘂𝗮𝗹𝗶𝘇𝗲 𝘆𝗼𝘂𝗿 𝗰𝗼𝗱𝗲 𝗲𝘅𝗲𝗰𝘂𝘁𝗶𝗼𝗻 𝗳𝗹𝗼𝘄 and get help from others if you stuck.

It supports most of the language like 𝗖, 𝗖++, 𝗝𝗮𝘃𝗮, 𝗝𝗮𝘃𝗮𝗦𝗰𝗿𝗶𝗽𝘁, 𝗧𝘆𝗽𝗲𝗦𝗰𝗿𝗶𝗽𝘁, 𝗥𝘂𝗯𝘆 etc.

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

https://youtu.be/TRMKJucB3B8

#JAVAAID #leetcode #javaAidTutorials #programming #recursion-basics #recursion-tutorial #algorithms #coding #competitiveprogramming #google #java #problemsolving #kanahaiyaGupta #pythontutor #execution

Hi Coding Lover,

In this tutorial, I have covered the most common dynamic programming interview question 𝗟𝗼𝗻𝗴𝗲𝘀𝘁 𝗖𝗼𝗺𝗺𝗼𝗻 𝗦𝘂𝗯𝘀𝘁𝗿𝗶𝗻𝗴 which is usually asked in product-based MNC's.

Here I have explained the 𝗳𝗼𝘂𝗿 𝗱𝗶𝗳𝗳𝗲𝗿𝗲𝗻𝘁 𝘄𝗮𝘆𝘀 𝘁𝗼 𝘀𝗼𝗹𝘃𝗲 𝘁𝗵𝗶𝘀 𝗽𝗿𝗼𝗯𝗹𝗲𝗺 and below are the outlines-

𝗧𝗮𝗯𝗹𝗲 𝗼𝗳 𝗖𝗼𝗻𝘁𝗲𝗻𝘁:
👉[00:15] Problem statement
👉[02:17] Longest common substring
👉[03:00] Algorithm
👉[06:54] Recurrence relation
👉[08:00] Recursive solution
👉[09:42] Recurrence tree
👉[11:52] Top-down approach with memoization
👉[13:30] Bottom-up approach/ DP solution
👉[19:20] Demo

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

https://lnkd.in/faC5uGu

#JAVAAID #lcs #longestcommonsubstring #leetcode #javaAidTutorials #programming #algorithms #coding #competitiveprogramming #google #java #problemsolving #kanahaiyaGupta

Hi Coding Lover,
In this tutorial, I have covered one more common dynamic programming interview question 𝗟𝗼𝗻𝗴𝗲𝘀𝘁 𝗖𝗼𝗺𝗺𝗼𝗻 𝗦𝘂𝗯𝘀𝗲𝗾𝘂𝗲𝗻𝗰𝗲 which is also asked in a lot of product-based MNC's.

Here I have explained the 𝗳𝗼𝘂𝗿 𝗱𝗶𝗳𝗳𝗲𝗿𝗲𝗻𝘁 𝘄𝗮𝘆𝘀 𝘁𝗼 𝘀𝗼𝗹𝘃𝗲 𝘁𝗵𝗶𝘀 𝗽𝗿𝗼𝗯𝗹𝗲𝗺 and below are the outlines-

𝗧𝗮𝗯𝗹𝗲 𝗼𝗳 𝗖𝗼𝗻𝘁𝗲𝗻𝘁:
👉[00:10] Problem statement
👉[02:44] Longest common Subsequence
👉[03:39] Algorithm
👉[07:06] Recurrence relation
👉[09:35] Recursive solution
👉[09:42] Recurrence tree
👉[13:22] Top-down approach with memoization
👉[14:51] Bottom-up approach/ DP solution (using 2-D array)
👉[25:10] Bottom-up approach/ DP solution (using 1-D array)
👉[30:11] Demo

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

https://lnkd.in/fNveH-Y

#JAVAAID #lcs #longestcommonsubsequence #leetcode #javaAidTutorials #programming #algorithms #coding #competitiveprogramming #google #java #problemsolving #kanahaiyaGupta

Hey Coding Lover,

In this video, I have explained the 𝗼𝗽𝘁𝗶𝗺𝗶𝘇𝗲𝗱 𝘄𝗮𝘆 𝘁𝗼 𝘀𝗼𝗹𝘃𝗲 𝘂𝘁𝗼𝗽𝗶𝗮𝗻 𝘁𝗿𝗲𝗲 𝗵𝗮𝗰𝗸𝗲𝗿𝗿𝗮𝗻𝗸 𝗽𝗿𝗼𝗯𝗹𝗲𝗺 𝗶𝗻 𝗼𝗻𝗲 𝗹𝗶𝗻𝗲.

This hackerrank problem is a part of Practice | Algorithms| Implementation | utopian tree hackerrank challenge.

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

https://youtu.be/C0YaIr8_mQU

#utopiantree #JAVAAID #HackerRankSolutions #implementation #HackerRank #JavaAidTutorials #programming #DataStructures #algorithms #coding #competitiveprogramming #java #codinginterview #problemsolving #KanahaiyaGupta #hackerrankchallenges