Videos / DSA

Episode 1 of 22 · DSA, end to end

C++ for problem solving: enough of the language to compete

Chapters

1. The limit on the page0:00
2. Nothing pauses on you0:17
3. Compiled, then run0:34
4. Memory in a straight line0:50
5. The library you don't write1:07
6. Learn the subset only1:24
7. Five lines, running1:41
8. What each include buys1:59
9. Reading the input2:19
10. When there is no count2:37
11. The flush nobody asked for2:54
12. Untie the streams3:11
13. The odometer rolls3:27
14. Where int runs out3:45
15. The multiply happens first4:04
16. Size is unsigned4:24
17. Reduce at every step4:43
18. What survives the modulus5:00
19. The photocopy5:19
20. What the copy costs5:37
21. One ampersand, no copy5:53
22. Say which one you mean6:11
23. The loop copies too6:29
24. A reference owns nothing6:47
25. The toolbox opens7:04
26. How vector grows7:21
27. Size it before you fill it7:38
28. Pair, and its order7:56
29. Sort, and its promise8:12
30. The rest of the algorithm header8:29
31. A verdict with no line8:45
32. Print to the other stream9:02
33. State what you believe9:17
34. Turn the checks on9:35
35. Keep two commands9:54
36. Make your own failing test10:13
37. Enough to compete10:30

C++ for problem solving: enough of the language to compete. Every competitive problem comes with a time limit printed at the top of the page. Often two seconds. Your solution is correct or it is not, and then it is fast enough or it is not.

Mark as watchedSaved in this browser only.