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मि