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நி