Coding Interview Question | Best time to Buy and Sell Stock | One, any number and max K Transactions

LeetCode and InterviewBit Links-
One transaction - https://leetcode.com/problems/best-ti...
https://www.interviewbit.com/problems...

Any number of transactions - https://leetcode.com/problems/best-ti...
https://www.interviewbit.com/problems...

K transactions - https://leetcode.com/problems/best-ti...
https://www.interviewbit.com/problems...

K = 2 transactions - https://leetcode.com/problems/best-ti...
https://www.interviewbit.com/problems...

The video includes following details-
0:00-0:55 - Problem statement
0:55-3:00 - One transaction question in detail
3:00-3:50 - Brute Force for one transaction
3:50-8:05 - Algo for one transaction
8:05-10:30 - Algo for any number of transactions
10:30-12:15 - Peak valley explanation for any number of transactions
12:15-13:20 - Dp visualisation for k transactions
13:20-13:50 - Initial conditions for k transactions
13:50-17:00 - Initial algo for k transactions
17:00-20:00 - Dry run of initial algo
20:00-21:15 - Complexity of Algo and scope of improvement
21:15-23:10 - Improvement of algo
23:10-30:00 - Dry run of final algo
30:00-31:40 - Optimization

Please Subscribe to my channel - keertipurswani
LinkedIn - LinkedIn: keertipurswani
Instagram - https://www.instagram.com/keerti.purs...

• #education
• #dynamic
• #programming
• #leetcode
• #stock
• #transactions
• #intuit
• #google
• #amazon
• #microsoft
• #interviewbit
• #interview
• #hackerrank
• #practise
• #preparation
• #array
• #coding
• #competitive
• #tutorials
• #dp