Yearly Goal for 2025 Ceph Development Dashboard Customization Parameter Design and Optimization Best Practice + Management: Manage a 1-3 person team Summarize 3 best practices Coding C/Rust Rewrite a bioinformatics tool using C or Rust UseC/Rust in production Open source code Software copyright Keep ARTS Weekly Update Do at least one algorithm problem every week Write at least one Share every week Complete at least one Review every week Learn at least one Tip every week Sports Run 1200km in a year Full marathon under 4 hours 8 pack abs Other Learn English Write blog in English

1.Algorithm 2944. Minimum Number of Coins for Fruits class Solution: def minimumCoins(self, prices: List[int]) -> int: n = len(prices) @cache # Cache decorator to avoid duplicate calculations of dfs results (memoization) def dfs(i: int) -> int: if i * 2 >= n: return prices[i - 1] # i starts from 1 return min(dfs(j) for j in range(i + 1, i * 2 + 2)) + prices[i - 1] return dfs(1) 2.