KORRA.CODES Algorithms That Finish In Time
Your Bronze solution was correct and the judge failed it anyway, because correct was never the whole test. This segment is about the other half of the verdict: counting the work before you write the code, and the four tools — sorting, binary search on the answer, prefix sums and two pointers, and greed you can defend — that turn a right answer that arrives late into a right answer that arrives.
4 モジュール · 12 レッスン · 7h 32m
メンバーシップで解放lock コース内容
1 Why a Correct Answer Fails 3 レッスン · 1h 25m lock
- play_circle Marked Late Is Marked Wrong 20分
- play_circle The Solution That Times Out 45分
- play_circle Counting Before You Code 20分
2 Sorting and Searching as Tools 3 レッスン · 1h 55m lock
- play_circle What Sorting Buys You 20分
- play_circle The Pallet Count, Done Properly 45分
- play_circle Binary Search on the Answer 50分
3 The Running Total, Two Fingers, and Defensible Greed 3 レッスン · 1h 52m lock
- play_circle The Running Total You Keep 45分
- play_circle Two Fingers on One Array 45分
- play_circle Greedy You Can Defend 22分
4 Four Problems, Each Solved Twice 3 レッスン · 2h 20m lock
- play_circle Pairs at a Fixed Distance 45分
- play_circle The Best Week 40分
- play_circle The Van and the Corridor 55分