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분