https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/?envType=study-plan-v2&envId=top-interview-150 class Solution { public: int maxProfit(vector<int>& prices) { int state1 = 0;

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/?envType=study-plan-v2&envId=top-interview-150 class Solution { public: int maxProfit(vector<int>& prices) { int ans = 0; int

https://leetcode.com/problems/rotate-array/description/?envType=study-plan-v2&envId=top-interview-150 class Solution { public: void rotate(vector<int>& nums, int k) { int

https://leetcode.com/problems/majority-element/?envType=study-plan-v2&envId=top-interview-150 class Solution { public: int majorityElement(vector<int>& nums) { int cnt = 0; int

https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/?envType=study-plan-v2&envId=top-interview-150 class Solution { public: int removeDuplicates(vector<int>& nums) { int idx = 0; for