Видео курса

  • Урок 1. 00:03:45
    Introduction to Course
  • Урок 2. 00:08:04
    Two Sum problem Statement and O(n^2) Solution
  • Урок 3. 00:03:12
    Implementation of O(n^2) naive solution
  • Урок 4. 00:11:07
    Optimizing Further for O(nlogn) Solution
  • Урок 5. 00:10:13
    Implementing the O(nlogn) Solution
  • Урок 6. 00:01:41
    Problem Statement
  • Урок 7. 00:06:44
    O(n^2) Naive Solution
  • Урок 8. 00:05:10
    O(n^2) Naive Solution Implementation
  • Урок 9. 00:09:14
    O(n) Solution idea and optimizations
  • Урок 10. 00:04:58
    O(n) Solution Implementation
  • Урок 11. 00:02:20
    Problem Statement
  • Урок 12. 00:06:14
    O(n^3) Naive Solution
  • Урок 13. 00:08:29
    O(nlogn) Improved Solution
  • Урок 14. 00:05:36
    Implementation of O(nlogn) solution
  • Урок 15. 00:14:07
    Optimizing further and reaching O(n) Solution
  • Урок 16. 00:08:15
    Implementation of O(n) Solution
  • Урок 17. 00:03:09
    Problem Statement
  • Урок 18. 00:05:36
    Incorrect Approaches/Algorithms to the Problem
  • Урок 19. 00:17:51
    Recursive Algorithm Solution That runs in O(n^2) Time
  • Урок 20. 00:05:01
    Implementation of O(n^2) Recursive Algorithm
  • Урок 21. 00:11:40
    Optimizing further With Stacks to get O(n) Solution Idea
  • Урок 22. 00:09:59
    O(n) Solution Implementation
  • Урок 23. 00:05:31
    Problem Statement and Example
  • Урок 24. 00:12:54
    Naive O(n^2) Solution with additional boolean array
  • Урок 25. 00:15:57
    Implementation of O(n^2) Solution
  • Урок 26. 00:11:46
    Optimizing on the last algorithm to an O(n) Solution
  • Урок 27. 00:06:38
    Implementation of O(n) Solution
  • Урок 28. 00:03:41
    Problem Statement
  • Урок 29. 00:08:34
    Bruteforce Algorithm Idea: O(nk) Solution
  • Урок 30. 00:04:38
    Bruteforce Implementation and Time Limit Exceeded
  • Урок 31. 00:13:47
    Optimizing Using Hashmaps to get O(n) Solution on average
  • Урок 32. 00:04:33
    Implementing the O(n) Solution
  • Урок 33. 00:04:29
    Problem Statement
  • Урок 34. 00:05:39
    O(n!) Brute force Solution
  • Урок 35. 00:11:41
    O(n^2) Solution idea for Valid anagram
  • Урок 36. 00:07:27
    O(n^2) Solution Implementation
  • Урок 37. 00:05:41
    O(nlogn) Solution by Optimizing bottleneck
  • Урок 38. 00:03:23
    O(nlogn) Solution Implementation
  • Урок 39. 00:08:12
    O(n) Solution Idea, The final optimization with Hashtable
  • Урок 40. 00:09:15
    O(n) Solution Implementation
  • Урок 41. 00:01:27
    Problem Statement
  • Урок 42. 00:05:19
    O(nlogn) Naive Solution Idea
  • Урок 43. 00:02:01
    O(nlogn) Naive Solution Implementation
  • Урок 44. 00:12:52
    O(nlogk) Optimized Solution Using a Heap
  • Урок 45. 00:03:07
    Implementation of O(nlogk) Heap Solution
  • Урок 46. 00:02:24
    Problem Statement
  • Урок 47. 00:14:51
    Idea of O(n^2Logn) Naive Solution and O(n^2logk) Optimized Solution using Heap
  • Урок 48. 00:19:08
    Implementation of O(n^2Logn) and O(n^2Logk) Solutions
  • Урок 49. 00:02:01
    Problem Statement
  • Урок 50. 00:12:15
    O(n) Recursive Solution Idea
  • Урок 51. 00:02:11
    O(n) Solution implementation
  • Урок 52. 00:01:44
    Problem Statement
  • Урок 53. 00:06:56
    O(n) Recursive Solution Idea
  • Урок 54. 00:04:20
    O(n) Solution Implementation
  • Урок 55. 00:02:01
    Problem Statement
  • Урок 56. 00:07:47
    O(n) Recursive Solution Idea
  • Урок 57. 00:02:47
    O(n) Solution Implementation

Материалы курса

К этому курсу прилагаются дополнительные материалы. Здесь вы можете скачать их.

Материалы к курсу