51:47dynamic programmingLecture
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
MIT OpenCourseWare
4 HN recommenders
51:47dynamic programmingLecture
MIT OpenCourseWare
4 HN recommenders
24:02coding interviewsDemo
Life at Google
2 HN recommenders
17:50
5:50
26:33
1:04:00c++ data structuresTalk
CppCon
3 HN recommenders
46:06graph databasesTalk
Redis
3 HN recommenders
14:28procedural generation algorithmsExplainer
Martin Donald
3 HN recommenders
1:00:17floating-point string conversionTalk
CppCon
3 HN recommenders
11:48statistics for programmersTalk
O'Reilly
3 HN recommenders
17:58
1:04:30lucene internalsTalk
LuceneSolrRevolution
3 HN recommenders
20:08fast inverse square rootExplainer
Nemean
3 HN recommenders
1:10:10
1:20:11
1:11
1:47:35cache replacement algorithmsTalk
PapersWeLove
3 HN recommenders
26:48algorithmic gerrymanderingExplainer
AlphaPhoenix
2 HN recommenders
17:51measuring land areaExplainer
Stand-up Maths
3 HN recommenders
54:44
12:20
30:37array programming treesTalk
Dyalog User Meetings
3 HN recommenders
47:52
56:03A good mathematical explanation makes the reasoning visible. This section collects videos on mathematics and theoretical computer science, including algorithms, complexity, probability and visual approaches to difficult ideas. It is for learners building foundations as well as programmers looking for the theory behind a familiar technique.
Indie Picks is organized from video metadata and uploader descriptions; it is not a full-video editorial review. HN Library retains community discussions. Sources and data notes