1. Урок 1.00:03:45
    Introduction to Course
  2. Урок 2.00:08:04
    Two Sum problem Statement and O(n^2) Solution
  3. Урок 3.00:03:12
    Implementation of O(n^2) naive solution
  4. Урок 4.00:11:07
    Optimizing Further for O(nlogn) Solution
  5. Урок 5.00:10:13
    Implementing the O(nlogn) Solution
  6. Урок 6.00:01:41
    Problem Statement
  7. Урок 7.00:06:44
    O(n^2) Naive Solution
  8. Урок 8.00:05:10
    O(n^2) Naive Solution Implementation
  9. Урок 9.00:09:14
    O(n) Solution idea and optimizations
  10. Урок 10.00:04:58
    O(n) Solution Implementation
  11. Урок 11.00:02:20
    Problem Statement
  12. Урок 12.00:06:14
    O(n^3) Naive Solution
  13. Урок 13.00:08:29
    O(nlogn) Improved Solution
  14. Урок 14.00:05:36
    Implementation of O(nlogn) solution
  15. Урок 15.00:14:07
    Optimizing further and reaching O(n) Solution
  16. Урок 16.00:08:15
    Implementation of O(n) Solution
  17. Урок 17.00:03:09
    Problem Statement
  18. Урок 18.00:05:36
    Incorrect Approaches/Algorithms to the Problem
  19. Урок 19.00:17:51
    Recursive Algorithm Solution That runs in O(n^2) Time
  20. Урок 20.00:05:01
    Implementation of O(n^2) Recursive Algorithm
  21. Урок 21.00:11:40
    Optimizing further With Stacks to get O(n) Solution Idea
  22. Урок 22.00:09:59
    O(n) Solution Implementation
  23. Урок 23.00:05:31
    Problem Statement and Example
  24. Урок 24.00:12:54
    Naive O(n^2) Solution with additional boolean array
  25. Урок 25.00:15:57
    Implementation of O(n^2) Solution
  26. Урок 26.00:11:46
    Optimizing on the last algorithm to an O(n) Solution
  27. Урок 27.00:06:38
    Implementation of O(n) Solution
  28. Урок 28.00:03:41
    Problem Statement
  29. Урок 29.00:08:34
    Bruteforce Algorithm Idea: O(nk) Solution
  30. Урок 30.00:04:38
    Bruteforce Implementation and Time Limit Exceeded
  31. Урок 31.00:13:47
    Optimizing Using Hashmaps to get O(n) Solution on average
  32. Урок 32.00:04:33
    Implementing the O(n) Solution
  33. Урок 33.00:04:29
    Problem Statement
  34. Урок 34.00:05:39
    O(n!) Brute force Solution
  35. Урок 35.00:11:41
    O(n^2) Solution idea for Valid anagram
  36. Урок 36.00:07:27
    O(n^2) Solution Implementation
  37. Урок 37.00:05:41
    O(nlogn) Solution by Optimizing bottleneck
  38. Урок 38.00:03:23
    O(nlogn) Solution Implementation
  39. Урок 39.00:08:12
    O(n) Solution Idea, The final optimization with Hashtable
  40. Урок 40.00:09:15
    O(n) Solution Implementation
  41. Урок 41.00:01:27
    Problem Statement
  42. Урок 42.00:05:19
    O(nlogn) Naive Solution Idea
  43. Урок 43.00:02:01
    O(nlogn) Naive Solution Implementation
  44. Урок 44.00:12:52
    O(nlogk) Optimized Solution Using a Heap
  45. Урок 45.00:03:07
    Implementation of O(nlogk) Heap Solution
  46. Урок 46.00:02:24
    Problem Statement
  47. Урок 47.00:14:51
    Idea of O(n^2Logn) Naive Solution and O(n^2logk) Optimized Solution using Heap
  48. Урок 48.00:19:08
    Implementation of O(n^2Logn) and O(n^2Logk) Solutions
  49. Урок 49.00:02:01
    Problem Statement
  50. Урок 50.00:12:15
    O(n) Recursive Solution Idea
  51. Урок 51.00:02:11
    O(n) Solution implementation
  52. Урок 52.00:01:44
    Problem Statement
  53. Урок 53.00:06:56
    O(n) Recursive Solution Idea
  54. Урок 54.00:04:20
    O(n) Solution Implementation
  55. Урок 55.00:02:01
    Problem Statement
  56. Урок 56.00:07:47
    O(n) Recursive Solution Idea
  57. Урок 57.00:02:47
    O(n) Solution Implementation