Dear CF community,

I am writing to share with you my recent technical talk on the new SSSP algorithm that “beat Dijkstra”, which I gave as one of my university assignments this year. (Disclaimer: I am not one of the coauthors of that paper. It is a result by Duan, Mao, Mao, Shu and Yin in July 2025, and you can view their original paper here!)

I would appreciate your comments on this technical talk or any existing videos on my YouTube channel! If you would like to submit your feedback anonymously, you may do so in this opinion box. :) Finally, if my channel sounds like something that could help you improve with your CP/technical interview prep journey, then make sure to subscribe to my channel!

Thank you all for your kind support, and I look forward to creating more interesting content for the community.