LeetCode

LeetCode note for Best Time to Buy and Sell Stock with Transaction Fee, rebuilt from the original learning note

LeetCode 3932 note: the answer is floor(r^(1/k)) - floor((l-1)^(1/k)); take roots with integer binary search and count 0 too

LeetCode 3931 note: check that every pair of adjacent digits differs by at most 2

LeetCode note for Best Time to Buy and Sell Stock with Cooldown, rebuilt from the original learning note

LeetCode note for House Robber, rebuilt from the original learning note

LeetCode note for Best Time to Buy and Sell Stock IV, rebuilt from the original learning note

LeetCode note for Best Time to Buy and Sell Stock III, rebuilt from the original learning note

LeetCode note for Best Time To Buy And Sell Stock II, rebuilt from the original learning note

LeetCode note for Best Time To Buy And Sell Stock, rebuilt from the original learning note

LeetCode note for Maximum Subarray, rebuilt from the original learning note

LeetCode note for Arithmetic Slices, rebuilt from the original learning note

LeetCode note for Minimum Cost For Tickets, rebuilt from the original learning note