Skip to content

Instantly share code, notes, and snippets.

@lazywithclass lazywithclass/blog-post.md
Last active Mar 21, 2017

Embed
What would you like to do?
[CSE373] Lectures, dynamic programming

[CSE373] Lectures, dynamic programming

CSE373 2012 - Lecture 24 - NP-Completeness Proofs

https://www.youtube.com/watch?v=27Al52X3hd4&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b

CSE373 2012 - Lecture 25 - NP-Completeness Challenge

https://www.youtube.com/watch?v=xCPH4gwIIXM&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b

Dynamic programming

Dynamic Programming for Programming Competitions

https://www.youutube.com/watch?v=Ad0DKl7HUwI

This is actually quite interesting, applying those concepts to some "real world" use cases, one of which will be the Facebook Hacker Cup, which I will try. In the past I've tried it a couple times, never being able to get past the second round, hopefully with this tool I can go one round farther.

The channel where that video comes from seems to have a lot of material on how to apply these concepts to programming competitions, I don't think I can get a job that way (too many smarter people out here), but it will be a terrific exercise when I will be in front of The Whiteboard.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.