We will stream today.
10.30 or 11.00
We will wrap it up a bit quickly as I have a flight to catch at 3 am 🥲
10.30 or 11.00
We will wrap it up a bit quickly as I have a flight to catch at 3 am 🥲
Deleted yesterday’s bharatpe post!
Reason: some ex ceo on some other post reached out on twitter, and the management called and are willing to pay the fnf amount and other dues.
Power of social media 🔥
Reason: some ex ceo on some other post reached out on twitter, and the management called and are willing to pay the fnf amount and other dues.
Power of social media 🔥
https://www.linkedin.com/posts/rajarvp_striver-activity-6902534721897664512-Ff7x
In case you missed it.
In case you missed it.
Linkedin
Raj Vikramaditya on LinkedIn: #striver | 149 comments
Deleted this post yesterday since the management reached out and has agreed to pay fnf amount. They are ready to give the experience/release letter as ... 149 comments on LinkedIn
takeUforward pinned «https://www.linkedin.com/posts/rajarvp_striver-ad-takeuforward-activity-6903249597158821888-Pt6K»
https://youtu.be/qOXUa_OQXI4
Today's late night problem solving stream, do participate in the contest!
Today's late night problem solving stream, do participate in the contest!
YouTube
Codestudio Contest 11 Editorial | Live Problem Solving | Striver
Check our Website: https://www.takeuforward.org/
In case you are thinking to buy courses, please check below:
Link to get 20% additional Discount at Coding Ninjas: https://bit.ly/3wE5aHx
Code "takeuforward" for 15% off at GFG: https://practice.geeksfo…
In case you are thinking to buy courses, please check below:
Link to get 20% additional Discount at Coding Ninjas: https://bit.ly/3wE5aHx
Code "takeuforward" for 15% off at GFG: https://practice.geeksfo…
Dp 25 at 2:00 PM, this video is 54 minutes long, but I have explained in a lot of depth, so that the next set of partition video gets covered in ~20 mints
DP 26 at 2:15 PM
Partition DP starts today 🔥
DP 26 at 2:15 PM
Partition DP starts today 🔥
DP26. Matrix Chain Multiplication | Bottom-Up | Tabulation
https://youtu.be/pDCXsbAw5Cg
The tabulation method of MCM explained! Other DP series has this missing, so added, and I can guarantee you, you will find this super easy.
https://youtu.be/pDCXsbAw5Cg
The tabulation method of MCM explained! Other DP series has this missing, so added, and I can guarantee you, you will find this super easy.
YouTube
DP 49. Matrix Chain Multiplication | Bottom-Up | Tabulation
Lecture Notes/C++/Java Codes: https://takeuforward.org/dynamic-programming/striver-dp-series-dynamic-programming-problems/
Problem Link: https://bit.ly/3nXqfce
First Part of the Video: https://youtu.be/vRVfmbCFW7Y
Pre-req for this Series: https://www.y…
Problem Link: https://bit.ly/3nXqfce
First Part of the Video: https://youtu.be/vRVfmbCFW7Y
Pre-req for this Series: https://www.y…
I was recording one video of Partition DP, and realised this is a tougher concept, so should come after DP on Strings, hence we will do DP on Strings, and two videos of MCM uploaded will be numbered properly afterwards. Thanks :)
Doing this so that, people don't drop out in between because of a sudden elevation of difficulty level
Sequence we will follow:
1D Dp
Dp on Grids
Dp on Subsequences (Knapsack etc)
Dp on Strings (8/9 problems)
Dp on Stocks. (6)
Dp on Longest Increasing Subsequence (though i don't consider this on dp :P ) (4)
MCM DP (6)
Dp on Squares/Rectangles (4)
Bitmask DP (2 problems just to know the concepts)
Dp on Trees (4 problems)
Dp on Graphs (2 problems dp on distance and others)
1D Dp
Dp on Grids
Dp on Subsequences (Knapsack etc)
Dp on Strings (8/9 problems)
Dp on Stocks. (6)
Dp on Longest Increasing Subsequence (though i don't consider this on dp :P ) (4)
MCM DP (6)
Dp on Squares/Rectangles (4)
Bitmask DP (2 problems just to know the concepts)
Dp on Trees (4 problems)
Dp on Graphs (2 problems dp on distance and others)
From dreaming of Google.
to
Google reaching out to me to share the program.
Long way. ♥️
https://www.linkedin.com/posts/rajarvp_girlhackathon-girlhackathon-striver-activity-6904801406142828544-o0Bu
to
Google reaching out to me to share the program.
Long way. ♥️
https://www.linkedin.com/posts/rajarvp_girlhackathon-girlhackathon-striver-activity-6904801406142828544-o0Bu
Linkedin
Raj Vikramaditya on LinkedIn: #GirlHackathon #GirlHackathon #striver | 34 comments
As an engineer, I always dreamt about joining Google. I finally did and the last few months have been nothing less than amazing. I can proudly say that... 34 comments on LinkedIn
Today's video, recorded edited after office and here it is: https://www.youtube.com/watch?v=-zI4mrF2Pb4&list=PLgUwDviBIf0qUlt5H_kiKYaNSqJ81PMMY&index=30
YouTube
DP 26. Print Longest Common Subsequence | Dp on Strings
Check our Website: https://www.takeuforward.org/
In case you are thinking to buy courses, please check below:
Link to get 20% additional Discount at Coding Ninjas: https://bit.ly/3wE5aHx
Code "takeuforward" for 15% off at GFG: https://practice.geeksfo…
In case you are thinking to buy courses, please check below:
Link to get 20% additional Discount at Coding Ninjas: https://bit.ly/3wE5aHx
Code "takeuforward" for 15% off at GFG: https://practice.geeksfo…
https://www.youtube.com/watch?v=_wP9mWNPL5w&list=PLgUwDviBIf0qUlt5H_kiKYaNSqJ81PMMY&index=27
On full force!
On full force!
YouTube
DP 27. Longest Common Substring | DP on Strings 🔥
Check our Website: https://www.takeuforward.org/
In case you are thinking to buy courses, please check below:
Link to get 20% additional Discount at Coding Ninjas: https://bit.ly/3wE5aHx
Code "takeuforward" for 15% off at GFG: https://practice.geeksfo…
In case you are thinking to buy courses, please check below:
Link to get 20% additional Discount at Coding Ninjas: https://bit.ly/3wE5aHx
Code "takeuforward" for 15% off at GFG: https://practice.geeksfo…
Some people were asking the future problems in DP series so that they could try by self:
1. Longest Palindromic Subsequence
2. Minimum Insertions to make a String Palindrome
2.1. Minimum Number of Insertions and Deletions to convert s1 -> s2 (May be or may not add, as its an easy one)
3. Shortest Common Supersequence
4. Edit Distance
5. Wildcard Matching
6. Distinct Subsequences
7. Palindromic Substrings
1. Longest Palindromic Subsequence
2. Minimum Insertions to make a String Palindrome
2.1. Minimum Number of Insertions and Deletions to convert s1 -> s2 (May be or may not add, as its an easy one)
3. Shortest Common Supersequence
4. Edit Distance
5. Wildcard Matching
6. Distinct Subsequences
7. Palindromic Substrings