Forwarded from HackerRank Solutions
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
๐๐๐
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.
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.
YouTube
Dynamic Programming Techniques | Dynamic Programming Tutorial | EP2
Dynamic Programming Techniques :-In this video, I have explained the technique to solve any dynamic programming problems and that technique is named as FAST in short.
After watching this video, you will be able to solve any dynamic programming problem. Soโฆ
After watching this video, you will be able to solve any dynamic programming problem. Soโฆ
Forwarded from HackerRank Solutions
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
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
YouTube
Sliding Window Technique | Google Coding Interview | Maximum Size SubArray Of Size K
Sliding Window Technique: In this video, I have explained sliding window technique which is the 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โฆ
There are a lot of coding interview problems which can be solved by using thisโฆ
Forwarded from HackerRank Solutions
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
๐๐๐
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
๐๐๐
Forwarded from HackerRank Solutions
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
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
YouTube
Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time
Two Pointer Algorithm For Coding Interview: 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โฆ
There are a lot of coding interview problems which canโฆ
Forwarded from HackerRank Solutions
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
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
YouTube
Recursive Staircase Problem | Climbing Stairs | Walmart Coding Interview | EP3
Recursive Staircase Problem :- In this video, I have explained the recursive staircase problem fibonacci series pattern to solve count the number of ways to climb the staircase dynamic programming question. Climbing staircase problem can be solved easilyโฆ
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
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
YouTube
JAVAAID - Coding Interview Preparation
I am Kanahaiya Gupta and currently working as a Software Engineer-||| in Walmart Labs.
I have started this channel to share my knowledge and experience for coding interviews.
JAVAAID is an educational initiative. It aims is to help people for building theirโฆ
I have started this channel to share my knowledge and experience for coding interviews.
JAVAAID is an educational initiative. It aims is to help people for building theirโฆ
Forwarded from ๐๐ฟ๐ฎ๐ฐ๐ธ๐ถ๐ป๐ด ๐ง๐ต๐ฒ ๐๐ผ๐ฑ๐ถ๐ป๐ด ๐๐ป๐๐ฒ๐ฟ๐๐ถ๐ฒ๐
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
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
YouTube
Length Of The Longest Consecutive 1s In Binary Representation Of A Number | BitManipulation
In this video, I have explained efficient way to count maximum number of consecutive 1s in binary string.
Length of the Longest Consecutive 1s in Binary Representation can be solved by using bit manipulation. The complexity of consecutive 1s in binary numbersโฆ
Length of the Longest Consecutive 1s in Binary Representation can be solved by using bit manipulation. The complexity of consecutive 1s in binary numbersโฆ
Forwarded from HackerRank Solutions
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
Now we are 10K family now
Forwarded from HackerRank Solutions
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. ๐
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. ๐
YouTube
01 Knapsack Problem | Amazon Coding Interview | Dynamic programming | EP5
Knapsack Problem Using Dynamic programming : -In this video, I have explained the knapsack problem which is the optimization version of subset-sum.
I have used FAST method to solve this DP problem.
Here are the Outlines:
01:47 Knapsack problem
02:17 Knapsackโฆ
I have used FAST method to solve this DP problem.
Here are the Outlines:
01:47 Knapsack problem
02:17 Knapsackโฆ
Forwarded from HackerRank Solutions
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
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
YouTube
Why You Must Learn Prefix Sum Algorithm? | Need of prefix-sum Algorithm | EP1
You must know how prefix sum algorithm can help you to improve the performance of your code.
This video explains the need of prefix sum algorithm that why you must learn prefix-sum algorithm.
This is the first part of the video and donโt forget to watch theโฆ
This video explains the need of prefix sum algorithm that why you must learn prefix-sum algorithm.
This is the first part of the video and donโt forget to watch theโฆ
Forwarded from HackerRank Solutions
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
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
YouTube
Prefix Sum Algorithm | Prefix Sum Array | Difference Array | Range Sum QueryO(1) | EP2
Prefix sum algorithm is mainly used for range query and the complexity of prefix sum algorithm is O(n).
This video explains the working of prefix sum algorithm.
This is the second part of the video and please watch the first part (why you must learn prefixโฆ
This video explains the working of prefix sum algorithm.
This is the second part of the video and please watch the first part (why you must learn prefixโฆ
Forwarded from HackerRank Solutions
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
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
YouTube
Sliding Window Technique | Google Coding Interview | Maximum Size SubArray Of Size K
Sliding Window Technique: In this video, I have explained sliding window technique which is the 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โฆ
There are a lot of coding interview problems which can be solved by using thisโฆ
Forwarded from HackerRank Solutions
Hello Coding Lover,
Just Learn this ๐๐บ๐ฎ๐๐ถ๐ป๐ด ๐๐ฒ๐ฐ๐ต๐ป๐ถ๐พ๐๐ฒ which is discussed in this tutorial and you will be able to ๐๐ผ๐น๐๐ฒ ๐บ๐ผ๐ฟ๐ฒ ๐๐ต๐ฎ๐ป ๐ญ๐ฌ ๐พ๐๐ฒ๐๐๐ถ๐ผ๐ป๐ ๐ผ๐ป ๐น๐ฒ๐ฒ๐๐ฐ๐ผ๐ฑ๐ฒ which is mentioned in this video.
In this video, I have explained ๐ง๐๐ผ ๐ฃ๐ผ๐ถ๐ป๐๐ฒ๐ฟ ๐ง๐ฒ๐ฐ๐ต๐ป๐ถ๐พ๐๐ฒ which is the optimal way to solve problems related to arrays, strings and linked list in ๐ข(๐ก) 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
Just Learn this ๐๐บ๐ฎ๐๐ถ๐ป๐ด ๐๐ฒ๐ฐ๐ต๐ป๐ถ๐พ๐๐ฒ which is discussed in this tutorial and you will be able to ๐๐ผ๐น๐๐ฒ ๐บ๐ผ๐ฟ๐ฒ ๐๐ต๐ฎ๐ป ๐ญ๐ฌ ๐พ๐๐ฒ๐๐๐ถ๐ผ๐ป๐ ๐ผ๐ป ๐น๐ฒ๐ฒ๐๐ฐ๐ผ๐ฑ๐ฒ which is mentioned in this video.
In this video, I have explained ๐ง๐๐ผ ๐ฃ๐ผ๐ถ๐ป๐๐ฒ๐ฟ ๐ง๐ฒ๐ฐ๐ต๐ป๐ถ๐พ๐๐ฒ which is the optimal way to solve problems related to arrays, strings and linked list in ๐ข(๐ก) 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
YouTube
Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time
Two Pointer Algorithm For Coding Interview: 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โฆ
There are a lot of coding interview problems which canโฆ
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
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
YouTube
Recursion In Data Structures | Recursion Explained | EP1
Recursion In Data Structures: In this video, I have explained the basics of recursion and explain how mathematical modelling of function plays a major role in solving recursive programming problems.
I have discussed the application of recursion as well.โฆ
I have discussed the application of recursion as well.โฆ
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
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
lnkd.in
LinkedIn
This link will take you to a page thatโs not on LinkedIn
Forwarded from HackerRank Solutions
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
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
YouTube
Python Tutor | Java Visualizer -Visualize Code Execution Of C Java JavaScript Python Ruby TypeScript
Python Tutor | java visualizer -Visualize Code Execution Of C C++ Java JavaScript Python Ruby TypeScript:
In this video, I have explained the usage of Python Tutor and java visualizer tool for every programmer and how to get help from your fellow coders.โฆ
In this video, I have explained the usage of Python Tutor and java visualizer tool for every programmer and how to get help from your fellow coders.โฆ
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
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
lnkd.in
LinkedIn
This link will take you to a page thatโs not on LinkedIn
Forwarded from ๐๐ฟ๐ฎ๐ฐ๐ธ๐ถ๐ป๐ด ๐ง๐ต๐ฒ ๐๐ผ๐ฑ๐ถ๐ป๐ด ๐๐ป๐๐ฒ๐ฟ๐๐ถ๐ฒ๐
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
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
lnkd.in
LinkedIn
This link will take you to a page thatโs not on LinkedIn