Этот материал находится в платной подписке. Оформи премиум подписку и смотри или слушай Algorithms and Data Structures, а также все другие курсы, прямо сейчас!
Купить сейчас
  • Урок 1. 00:31:07
    001 Staircase ascent
  • Урок 2. 00:18:20
    002 Convert to Roman
  • Урок 3. 00:18:42
    003 Correct binary search
  • Урок 4. 01:01:40
    004 Splitting a chocolate bar
  • Урок 5. 00:14:06
    005 What a programmer can learn from Polya
  • Урок 6. 00:34:24
    006 Finding duplicates
  • Урок 7. 00:23:45
    007 Fizzbuzz sum
  • Урок 8. 00:22:54
    008 Just iterate
  • Урок 9. 01:25:55
    009 Analysis practice
  • Урок 10. 00:07:50
    010 The enormous difference between polynomial and exponential
  • Урок 11. 00:24:20
    011 Building an intuition for common running times
  • Урок 12. 00:06:39
    012 Best worst and average case
  • Урок 13. 00:11:45
    013 The benefits and pitfalls of asymptotic analysis
  • Урок 14. 00:07:13
    014 Big O big omega and big theta
  • Урок 15. 00:39:51
    015 Parenthesis match
  • Урок 16. 00:49:35
    016 Doubly linked list
  • Урок 17. 00:40:47
    017 Basic calculator
  • Урок 18. 00:54:40
    018 Practice using stacks
  • Урок 19. 00:08:17
    019 Hazards of using linkedlists
  • Урок 20. 00:06:16
    020 What is an abstract data type
  • Урок 21. 00:09:23
    021 Motivating stacks and queues and an intuition for when to use them
  • Урок 22. 00:04:15
    022 Motivating linked lists
  • Урок 23. 01:15:56
    023 Merge sort
  • Урок 24. 00:23:04
    024 Fast exponentiation
  • Урок 25. 00:39:16
    025 Quicksort
  • Урок 26. 01:36:28
    026 Divide and conquer intuition and convex hull problem
  • Урок 27. 01:08:54
    027 Process tree
  • Урок 28. 01:27:36
    028 Word ladder
  • Урок 29. 00:50:23
    029 Jug pouring
  • Урок 30. 00:53:20
    030 Knights tour
  • Урок 31. 00:55:56
    031 Maze solver
  • Урок 32. 01:25:31
    032 Trees graphs and flipping pancakes
  • Урок 33. 00:37:18
    033 Dijkstras algorithm and A search
  • Урок 34. 00:20:08
    034 Depth-first and breadth-first search
  • Урок 35. 00:25:18
    035 Helping Michael with Word Ladder analysis
  • Урок 36. 00:47:19
    036 House robber
  • Урок 37. 00:32:43
    037 Perfect squares
  • Урок 38. 00:54:01
    038 Minimal grid path
  • Урок 39. 00:54:09
    039 Edit distance
  • Урок 40. 01:03:17
    040 Introduction to dynamic programming
  • Урок 41. 00:39:58
    041 QA problem solving technique and wrapup