Algorithms on graphs
Using maze problem as an example, Marina will tell about different methods of representing graphs and graph traversal algorithms. This talk will be mostly live coding in IDE, with minimal amount of slides.
Lead software engineer in EPAM, defiantly living in Los Angeles. Currently in teleportation to a Solution Architect role. As a part of that she leads a few projects for data science department, and, in spite of a good weather, spends her weekends studying online courses. She has a dream to write a control module for a space rocket on JS.