Skip to content

Instantly share code, notes, and snippets.

Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save jianminchen/fc107fa4b3ea178c55a5154d95b4d122 to your computer and use it in GitHub Desktop.
Save jianminchen/fc107fa4b3ea178c55a5154d95b4d122 to your computer and use it in GitHub Desktop.
10:00 pm mock interview talk and sharing with the peer - an algorithm engineer
// Algorithms by Corman & others (Leiserson, Rievest...)
// hackerrank -
// https://www.hackerrank.com/jianminchen_fl
// code review - stackexchange.com
// https://codereview.stackexchange.com/users/123986/jianmin-chen
// 1000 reputation - less than 1000 - 479 - give reputation - not famous
// http://juliachencoding.blogspot.ca/
// Kruskal algorithm - 2018 my favorite - minimum spanning tree /
// island count - II, union find, it is used kruskal algorithm
// failed - disjoint set data structure / ask over hackerrank - algorithm
// quick find - union find - different - concept - play hackerrank
// advanced level 10 hours score 0 -> answer -> based on mathematics,
// statistics - difficult - major 5 challenge - 18 - 22, 30 - 12 abstract algorithm
//
// recursive algorithm -
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment