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м