Posted on

[Leetcode]1626. Best Team With No Conflicts

You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the sum of scores of all the players in the team.
However, the basketball team is not allowed to have conflicts. A conflict exists if a younger player has a strictly higher score than an older player. A conflict does not occur between players of the same age.
Given two lists, scores and ages, where each scores[i] and ages[i] represents the score and age of the ith player, respectively, return the highest overall score of all possible basketball teams.
Continue reading “[Leetcode]1626. Best Team With No Conflicts”
Posted on

[Leetcode]714. Best Time to Buy and Sell Stock with Transaction Fee

LeetCode_logo

This series of Buy and Sell Stock I~VI on Leetcode is a great practice for Dynamic Programming – State Machine. Therefore I prepared blogs for each of them and hopefully it would help you to understand them better. You can find the relations of them at the bottom and feel free to leave any comments. 

Continue reading “[Leetcode]714. Best Time to Buy and Sell Stock with Transaction Fee”
Posted on

[Leetcode]309. Best Time to Buy and Sell Stock with Cooldown

LeetCode_logo

This series of Buy and Sell Stock I~VI on Leetcode is a great practice for Dynamic Programming – State Machine. Therefore I prepared blogs for each of them and hopefully it would help you to understand them better. You can find the relations of them at the bottom and feel free to leave any comments. 

Continue reading “[Leetcode]309. Best Time to Buy and Sell Stock with Cooldown”
Posted on

[Leetcode]188. Best Time to Buy and Sell Stock IV

LeetCode_logo

This series of Buy and Sell Stock I~VI on Leetcode is a great practice for Dynamic Programming – State Machine. Therefore I prepared blogs for each of them and hopefully it would help you to understand them better. You can find the relations of them at the bottom and feel free to leave any comments. 

Continue reading “[Leetcode]188. Best Time to Buy and Sell Stock IV”
Posted on

[Leetcode]123. Best Time to Buy and Sell Stock III

LeetCode_logo

This series of Buy and Sell Stock I~VI on Leetcode is a great practice for Dynamic Programming – State Machine. Therefore I prepared blogs for each of them and hopefully it would help you to understand them better. You can find the relations of them at the bottom and feel free to leave any comments. 

Continue reading “[Leetcode]123. Best Time to Buy and Sell Stock III”
Posted on

[Leetcode]122. Best Time to Buy and Sell Stock II

LeetCode_logo

This series of Buy and Sell Stock I~VI on Leetcode is a great practice for Dynamic Programming – State Machine. Therefore I prepared blogs for each of them and hopefully it would help you to understand them better. You can find the relations of them at the bottom and feel free to leave any comments. 

Continue reading “[Leetcode]122. Best Time to Buy and Sell Stock II”
Posted on

[Leetcode]121. Best Time to Buy and Sell Stock

LeetCode_logo

This series of Buy and Sell Stock I~VI on Leetcode is a great practice for Dynamic Programming – State Machine. Therefore I prepared blogs for each of them and hopefully it would help you to understand them better. You can find the relations of them at the bottom and feel free to leave any comments.

Continue reading “[Leetcode]121. Best Time to Buy and Sell Stock”