Forwarded from HackerRank Solutions
π JAVAAID - Coding Interview Preparation: House Robber Problem | Maximum Sum Sub-sequence Non-Adjacent Pattern | Dynamic programming | EP4
YouTube
Google Coding Interview | House Robber LeetCode Solution | Dynamic programming | EP4
House Robber LeetCode Solution :- In this video, I have explained the pattern to solve house robber leetcode dynamic programming problem which is based on maximum sum subsequence non-adjacent pattern.
I have used FAST method to solve this DP problem.
Afterβ¦
I have used FAST method to solve this DP problem.
Afterβ¦
Forwarded from JAVAAID
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β¦
JAVAAID
https://youtu.be/aL6cU5dWmWM
Great! Now you need to add @youtube as an administrator to this channel.
Forwarded from HackerRank Solutions
YouTube
New Year Chaos HackerRank Solution
In this video, I have solved hackerrank New Year Chaos problem in an easy way.
The complexity of new year chaos hackerrank solution is O (N). This hackerrank problem is a part of Practice | Algorithms | Constructive Algorithms | New Year Chaos hackerrankβ¦
The complexity of new year chaos hackerrank solution is O (N). This hackerrank problem is a part of Practice | Algorithms | Constructive Algorithms | New Year Chaos hackerrankβ¦
Forwarded from HackerRank Solutions
YouTube
Picking Number Hackerrank Solution
In this video, I have solved hackerrank Picking Numbers problem in an easy way.
The complexity of Picking Numbers hackerrank solution is O (N). This hackerrank problem is a part of Practice | Algorithms | Implementation | Picking Numbers hackerrank challenge.β¦
The complexity of Picking Numbers hackerrank solution is O (N). This hackerrank problem is a part of Practice | Algorithms | Implementation | Picking Numbers hackerrank challenge.β¦
Forwarded from JAVAAID
(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
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
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
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
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
YouTube
Ice Cream Parlor HackerRank solution | Two Sum LeetCode Solution
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.
The complexity ofβ¦
Here I have explained three optimal approaches to solve this problem.
Two sum with hashmap or without hashmap.
The complexity ofβ¦
Forwarded from HackerRank Solutions
YouTube
Separate the Numbers HackerRank Solution
separate the Numbers hackerrank solution : In this video, I have solved hackerrank Separate the Numbers problem in an easy way.
This hackerrank problem is a part of Practice | Algorithms | Strings | Separate the Numbers hackerrank challenge.
For simplicityβ¦
This hackerrank problem is a part of Practice | Algorithms | Strings | Separate the Numbers hackerrank challenge.
For simplicityβ¦
Forwarded from JAVAAID
YouTube
Amazon Coding Interview | Longest Common Substring Dynamic programming | EP6
longest common substring using dynamic programming - In this video, I have explained how to solve longest common substring problem in multiple ways.
longest common substring using recursion
longest common substring recursion with memorization or top-downβ¦
longest common substring using recursion
longest common substring recursion with memorization or top-downβ¦
Forwarded from JAVAAID
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
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
YouTube
Longest Common Subsequence(LCS) Dynamic Programming In O(N) Space | EP7
longest common Subsequence efficient algorithm in O(N) space - In this video, I have explained 4 different ways to solve the longest common subsequence problem.
longest common subsequence using recursion
longest common subsequence recursion with memorizationβ¦
longest common subsequence using recursion
longest common subsequence recursion with memorizationβ¦
Forwarded from JAVAAID
YouTube
Minimum Deletions And Insertions To Transform A String Into Another | Dynamic Programming | EP8
Minimum Deletions & Insertions to Transform a String into another - In this video, I have explained how to solve string transformation problem.
I have used LCS method to solve this Minimum Deletions & Insertions to Transform a String into another DP problem.β¦
I have used LCS method to solve this Minimum Deletions & Insertions to Transform a String into another DP problem.β¦
Forwarded from Kanhaiya
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.
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.
Channel name was changed to Β«Data Structures And Algorithms(DSA)Β»
Forwarded from HackerRank Solutions
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
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
YouTube
Count Triplets Hackerrank Solution | Interview Preparation Kit
Count Triplets hackerrank solution: In this video, I have explained how to solve hackerrank Count Triplets problem in O(N) time complexity.
This hackerrank problem is a part of Practice | Interview Preparation Kit| Dictionaries and Hashmaps| Count Tripletsβ¦
This hackerrank problem is a part of Practice | Interview Preparation Kit| Dictionaries and Hashmaps| Count Tripletsβ¦
Forwarded from HackerRank Solutions
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
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
YouTube
Triple sum Hackerrank Solution O(nlogn) | Interview Preparation Kit
triple sum hackerrank solution: In this video, I have solved hackerrank triple sum problem in optimize way.
This hackerrank problem is a part of Practice | Interview Preparation Kit| Search| Triple sum hackerrank challenge.
For simplicity, I have dividedβ¦
This hackerrank problem is a part of Practice | Interview Preparation Kit| Search| Triple sum hackerrank challenge.
For simplicity, I have dividedβ¦
Hey Guys,
If anyone of your friends are interested in learning data structures and algorithms. Please share this link with them.
@dsalgorithms
If anyone of your friends are interested in learning data structures and algorithms. Please share this link with them.
@dsalgorithms
For those who missed it before.
5 different ways to solve House robber problem.
https://youtu.be/ge_Fv2ZQAaE
5 different ways to solve House robber problem.
https://youtu.be/ge_Fv2ZQAaE
YouTube
Google Coding Interview | House Robber LeetCode Solution | Dynamic programming | EP4
House Robber LeetCode Solution :- In this video, I have explained the pattern to solve house robber leetcode dynamic programming problem which is based on maximum sum subsequence non-adjacent pattern.
I have used FAST method to solve this DP problem.
Afterβ¦
I have used FAST method to solve this DP problem.
Afterβ¦
Note on Data Strutures can be found here-
https://lecturenotes.in/notes/11971-note-for-data-structure-using-c-ds-by-mamata-garanayak
https://lecturenotes.in/notes/11971-note-for-data-structure-using-c-ds-by-mamata-garanayak