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 ista.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

🙏🙏🙏

Hi Guys,

I need your support to grow this community, please do like and comment on youtube video.

if you find it useful and do share with your friends also.
I am trying my best to provide better High-quality tutorial for you all.

would really appreciate your support.!!
🙏🙏🙏

Hi Guys,

I need your support to grow this community, please do like and comment on youtube video.

if you find it useful and do share with your friends also.
I am trying my best to provide better High-quality tutorial for you all.

would really appreciate your support.!!
🙏🙏🙏

Prerequisite:
https://youtu.be/DuikFLPt8WQ

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

🙏🙏🙏

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. 😀