001 Staircase ascent
002 Convert to Roman
003 Correct binary search
004 Splitting a chocolate bar
005 What a programmer can learn from Polya
006 Finding duplicates
007 Fizzbuzz sum
008 Just iterate
009 Analysis practice
010 The enormous difference between polynomial and exponential
011 Building an intuition for common running times
012 Best worst and average case
013 The benefits and pitfalls of asymptotic analysis
014 Big O big omega and big theta
015 Parenthesis match
016 Doubly linked list
017 Basic calculator
018 Practice using stacks
019 Hazards of using linkedlists
020 What is an abstract data type
021 Motivating stacks and queues and an intuition for when to use them
022 Motivating linked lists
023 Merge sort
024 Fast exponentiation
025 Quicksort
026 Divide and conquer intuition and convex hull problem
027 Process tree
028 Word ladder
029 Jug pouring
030 Knights tour
031 Maze solver
032 Trees graphs and flipping pancakes
033 Dijkstras algorithm and A search
034 Depth-first and breadth-first search
035 Helping Michael with Word Ladder analysis
036 House robber
037 Perfect squares
038 Minimal grid path
039 Edit distance
040 Introduction to dynamic programming
041 QA problem solving technique and wrapup
