https://karthikmuru.github.io/posts/ Recent content in Posts on Karthik Murugesan Hugo -- gohugo.io en-us Thu, 01 Dec 2022 02:42:06 +0000 https://karthikmuru.github.io/posts/kadanes-algorithm/ Thu, 01 Dec 2022 02:42:06 +0000 https://karthikmuru.github.io/posts/kadanes-algorithm/ Problem : https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ For this problem we need to find the indices i and j, maximising the equation prices[j] - prices[i], given j > i. Lets first approach the brute force solution of this problem. 1. Brute force: Complexity: O(n^2) This is pretty straight forward. We iterate through the entire array and for each element we check the difference between the indices larger than the current index. Code: 1int maxProfit(vector<int>& prices) { 2 3 int maxProfit = 0; 4 5 for(int i = 0; i < prices.