DSA - Level 1 - Best Time to Buy and Sell Stocks - 2 (Infinite Transactions) Dynamic Programming

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that. NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the second variation of the buy and sell stock problem series where we are required to find the maximum amount which can be obtained from selling stocks at different prices in infinite transactions. In this problem, 1. You are given a number n, representing the number of days. 2. You are given n numbers, where ith number represents price of stock on ith day. 3. You are required to print the maximum profit you can make if you are allowed infinite transactions. Note - There can be no overlapping transaction. One transaction needs to be closed (a buy followed by a sell) before opening another transaction (another buy) To attempt and submit this question, click here: https://www.pepcoding.com/resources/online-java-foundation/dynamic-programming-and-greedy/buy-and-sell-stocks-ita-official/ojquestion For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation # Have a look at our result: https://www.pepcoding.com/placements Follow us on our FB page: https://www.facebook.com/pepcoding Follow us on Instagram: https://www.instagram.com/pepcoding Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education