https://karthikmuru.github.io/ Recent content 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. https://karthikmuru.github.io/about/ Wed, 24 Aug 2016 17:51:42 +0000 https://karthikmuru.github.io/about/ Resume: Resume Github: karthikmuru Linkedin: karthikmurugesan28 https://karthikmuru.github.io/resume/ Mon, 01 Jan 0001 00:00:00 +0000 https://karthikmuru.github.io/resume/ Resume: Resume Email: murugesan.karthik@outlook.com LinkedIn: karthikmurugesan28 Projects: Projects Education Degree: Master of Science Major: Computer Science University: Arizona State University Graduation Year: 2023 Degree: Bachelor of Technology Major: Information Technology University: Anna University Graduation Year: 2018 Skills Languages: Java, Python, C/C++, SQL (MySQL, Postgres), NoSQL, JavaScript, Ruby Frameworks: Java Spring, Ruby on Rails, Node.js, Flask Tools, Databases, and OS: AWS (Lambda, SQS, SNS, EC2, DynamoDB, S3), Pytorch, Tensorflow, Git, Linux/Unix, Docker, Kubernetes