Explore the fascinating world of algorithms and data structures in this engaging NDC Oslo 2022 conference talk by Tess Ferrandez-Norlander. Dive into a language-agnostic journey through problem-solving techniques, covering graph algorithms, dynamic programming, greedy algorithms, and various data structures. Learn how to build solutions from first principles and combine algorithms to tackle increasingly complex coding challenges. Discover how algorithm puzzles and competitive programming can reignite your passion for coding and enhance your professional skills. From binary search and Big O notation to depth-first search and sliding windows, gain insights into fundamental concepts that form the backbone of all computing. Whether you're looking to refresh your knowledge or learn new problem-solving strategies, this talk offers valuable insights for programmers of all levels.
Overview
Syllabus
Introduction
Fun with Algorithms
Binary Search
Bananas
Binary searches
Big O notation
Data structures
Graphs
Trees
Depth First Search
Dynamic Programming
Sliding Windows
Happy Patrons
How I think about algorithms
What can you do from here
Taught by
NDC Conferences
