Intro to Competitive Programming

Most interesting video ever created. I don't know what I mispronounced but I definitely mispronounced something. Also Junferno's face is not in this video as much due to him falling into a state of anguish mid-recording (he was busy).

Corrections:
- [Visual error at 6:02] "Ultrecht" should be Utrecht
- [Visual error at 10:32] Shortest path from A to C should be ADC, yielding a distance of 1+7=8, making the total distance from A to C to E: 8+12=20

Footnotes:
- Other prominent online judges similar to Codeforces/DMOJ include AtCoder, Leetcode (mostly technical interview-type questions), Codechef, and TopCoder. CSES is an online judge focused on a single problemset. Advent of Code is a Christmas-themed daily programming challenge run annually in December in which only the output of the test cases has to be submitted as opposed to the solution code. Google Foobar is a "secret" Google programming challenge meant to be a recruiting technique targeted towards Google Search users who use keywords related to coding.
- The technical term for a "network of nodes" is a "graph". Algorithms dealing with such graphs are categorised as graph theory algorithms. Nodes are connected by "edges" which may or may not have "weights". A directed graph is a graph in which the edges only go one way. An acyclic graph is a graph which contains no cycles.
- A queue is different from a list in that it is not indexable, but rather just serves the element at the top when polled. A priority queue serves the element with the highest priority (usually implemented with heap). It does not actually "sort itself" but the elements will come out "sorted". The queue is sometimes referred to as "a list" in this video. This is meant to mean a "sequence of elements" and not the "list" data structure that exists in some languages.
- The preferred language for most competitive programming is C++, though other languages are also used. Java, for example, is often used alongside a rewrite of the input reader class, as the built-in Scanner is too slow.

References: "For the absence of a bibliography I offer neither explanation nor apology." -- Edsger W. Dijkstra

Photos courtesy of Wikimedia Commons, GeeksForGeeks, DMOJ

Music tracklist:

Community Captions:
Portuguese (Brazil) - Guilherme BR

[Junferno]

Corrections:
- [Visual error at 6:02] "Ultrecht" should be Utrecht
- [Visual error at 10:32] Shortest path from A to C should be ADC, yielding a distance of 1+7=8, making the total distance from A to C to E: 8+12=20

[staykarbine]

Can't believe I got baited into watching an informative video just because it had a picture of Misato on it

[CevicheK]

He completely lost me when he started explaining that 2D array thing, but then he put Rei Evangelion in the video and completely won me over

[nark]

This video should be renamed from "Intro to Competitive Programming" to "Overexplaining Dijkstra's Algorithm"

[RTDelete]

"this is a list of Kirby antagonists"
...
"Stable marriage"

[ChompDude]

They asked me how well I understood theoretical computer science. I said I had a theoretical degree in computer science. They said welcome aboard.

[holthuizenoemoet]

as a Dutch I'm impressed with the pronunciation of these dutch cities, given Dutch is next to impossible to pronounce.

[hayatotaichi]

I love this kind of low-budget, high-humor videos
also
He explained it very intuitively

[JimmyJonJillakers]

I like to imagine Jun got IP banned from CodeForces for playing Bad Apple on their verdict page

[be]

an evangelion themed competitive programming video
made for me honestly

i immediately love your videos more for taking a brief moment to list the cons of the VPN you used to counter the unintentional endorsement of non-sponsored product use.

[vilmoslengyel]

I should have expected the end but it somehow took me by surprise

[equalturtle]

0:29 I love how you translated this sentence to specifically Chinese Russian and Polish, this describes the top competition pretty well

[weirdcreature]

I can't believe you tricked me into reliving my algorithms and data structures class

[WeAreFailsProduction]

As someone who finished up algorithms as one of my final courses out of college, this would have been a great video to show to our class on Dijkstra's.

[nullinullinullifi]

6:51 the amount of whiplash between these two sentences is too much lmao. I love it

[saga]

7:45 When he started listing the algorithms, I was surprised by the amount of algorithms I never knew. Then I heard “Fecto Elfilis algorithm” and realized “wait.. that doesn’t sound right”

[dingalong]

Somehow the consistent Bad Apple endings manage to keep surprising me. I may have developed early-onset dementia since becoming a viewer.

[i-win]

Competitive programmers realizing their entire livelihood consists of only inverting binary trees 💀

[delayed_control]

The entire explanation of the Dijkstra's algorithm was done in a way that maximized Jun's ability to flex his Dutch pronunciation.