Best time to buy and sell stock 2 | Valley peak approach | Leetcode #122

This video explains a very important problem from april 30 days coding challenge on leetcode which is also important for software company interviews. I have explained the best time to buy and sell stock by using recursion, memoization and the most optimal valley peak approach. The optimal time is just O(N) for this problem in just O(1) extra space. As usual, CODE LINK is given below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)


CODE LINK: https://gist.github.com/SuryaPratapK/...

• #education
• #programming_interview_questions
• #coding_interview_questions
• #programming_tutorials
• #computer_science
• #codeforces
• #geeksforgeeks
• #information_technology
• #programming
• #best_time_to_buy_and_sell_stock_2
• #best_time_to_buy_and_sell_stock
• #leetcode
• #valley_peak_approach
• #maximize_profit_on_selling_stock
• #maximize_profit
• #memoization
• #recursion
• #backtracking
• #30_days_coding_challenge
• #leetcode_april_coding_challenge
• #day_5
• #april_5_leetcode
• #april_2020
• #techdose
• #stock_interview_question