LeetCode 2021 Spring Contest - Team
The recap balances bucket upgrades against water-filling rounds, then distributes a bounded connected colouring across a binary tree.
The recap balances bucket upgrades against water-filling rounds, then distributes a bounded connected colouring across a binary tree.
Three solutions determine a product sign, solve a Josephus circle, and use bottom-up DP for minimum side jumps; the fourth is unfinished.
Five problems move from budgeted pairs and a spiral orchestra layout to greedy reordering, a changing maze, and batched tasks.
Solutions truncate a sentence, deduplicate active minutes, minimize absolute difference, and record a subsequence-GCD approach that timed out.
Four solutions use board parity, sentence-end matching, reversed-value differences and memoized remainder states, followed by a rejudge correction.
Auto daily health report solution for BUAA.
Four solutions deduplicate integers, track a permutation reset, replace bracket keys by lookup, and maximize a product by splitting a fixed total.
How to reach a remote server through a jump host using SSH ProxyJump or port forwarding.
Three contest solutions handle ascending runs, order backlogs and a bounded peak; a post-contest binary trie counts XOR pairs in a range.
How my investing journey began, what changed my thinking, and the lessons that still shape it.