Leetcode Challenge with DeepMind & Mila Scientists!

Support us! https://www.patreon.com/mlst
MLST Discord: https://discord.gg/aNPkGUQtc5

We solve a leetcode challenge on the whiteboard together with Dr. Petar Veličković, Dr. Andrew Dudzik and Andreea Deac. The challenge is to build a cache system using the best combination of data structures to give the best time complexity. We hope this provides some educational value for those who aspire to work in FAANG one day (or interested in algorithms and data structures!) and would like to witness a demonstration of what great looks like in an interview situation from folks at the very top of this field. The solution made use of trees, linked lists and hash tables. Note that Petar et al did not know the question in advance.

Host: Dr. Tim Scarfe

Guest bios:

Dr. Petar Veličković is a Staff research scientist at DeepMind. Petar's interests are on graph representation learning for algorithmic reasoning. This new and exciting direction seeks to understand and employ the expressive power of GNNs for modelling classical algorithms.

https://petar-v.com/

Dr. Andrew Dudzik is a Research Engineer at DeepMind and has a PhD in mathematics from Berkeley

https://scholar.google.com/citations?user=DdFjaEEAAAAJ&hl=en&oi=ao

Andreea Deac is a PhD student in Machine Learning at Mila (previously interned at DeepMind) and is broadly interested in how learning can be improved through the use of graph representations, having previously worked on neural algorithmic reasoners for implicit planning and applications to biotechnology, focusing on drug discovery.

https://andreeadeac22.github.io/
https://twitter.com/andreeadeac22

Видео Leetcode Challenge with DeepMind & Mila Scientists! канала Machine Learning Street Talk