• Урок 1. 00:01:56
    Welcome to the Course!
  • Урок 2. 00:02:51
    Development Environment Setup - Windows
  • Урок 3. 00:04:21
    Development Environment Setup - macOS
  • Урок 4. 00:02:22
    Development Environment Setup - Ubuntu
  • Урок 5. 00:06:18
    Course GitHub Repository and How to Run Tests
  • Урок 6. 00:13:04
    Python Crash Course (Optional)
  • Урок 7. 00:00:15
    How to use this Course
  • Урок 8. 00:00:15
    Strings Section Introduction
  • Урок 9. 00:07:31
    Valid Palindrome (LC #125)
  • Урок 10. 00:08:06
    Longest Palindromic Substring (LC #5)
  • Урок 11. 00:05:08
    Longest Substring Without Repeating Characters - Part 1 (LC #3)
  • Урок 12. 00:03:44
    Longest Substring Without Repeating Characters - Part 2 (LC #3)
  • Урок 13. 00:05:32
    Valid Anagram (LC #242)
  • Урок 14. 00:05:29
    Group Anagrams (LC #49)
  • Урок 15. 00:05:29
    Valid Parentheses (LC #20)
  • Урок 16. 00:05:35
    [Now You Try] Backspace String Compare (LC #844)
  • Урок 17. 00:07:55
    Encode and Decode Strings (LC #271)
  • Урок 18. 00:00:28
    Dynamic Programming Section Introduction
  • Урок 19. 00:05:35
    Climbing Stairs (LC #70)
  • Урок 20. 00:05:08
    House Robber - Part 1 (LC #198)
  • Урок 21. 00:04:20
    House Robber - Part 2 (LC #198)
  • Урок 22. 00:03:22
    Jump Game - Part 1 (LC #55)
  • Урок 23. 00:04:41
    Jump Game - Part 2 (LC #55)
  • Урок 24. 00:02:40
    Jump Game - Part 3 (LC #55)
  • Урок 25. 00:03:53
    Longest Increasing Subsequence - Part 1 (LC #300)
  • Урок 26. 00:04:33
    Longest Increasing Subsequence - Part 2 (LC #300)
  • Урок 27. 00:04:59
    Coin Change - Part 1 (LC #322)
  • Урок 28. 00:05:05
    Coin Change - Part 2 (LC #322)
  • Урок 29. 00:04:58
    Unique Paths (LC #62)
  • Урок 30. 00:00:31
    Arrays Section Introduction
  • Урок 31. 00:02:57
    Contains Duplicate (LC #217)
  • Урок 32. 00:05:58
    Product of Array Except Self (LC #238)
  • Урок 33. 00:05:13
    Container With Most Water (LC #11)
  • Урок 34. 00:04:27
    Best Time to Buy and Sell Stock (LC #121)
  • Урок 35. 00:04:02
    Two Sum (LC #1)
  • Урок 36. 00:04:48
    3Sum - Part 1 (LC #15)
  • Урок 37. 00:05:33
    3Sum - Part 2 (LC #15)
  • Урок 38. 00:05:59
    Longest Consecutive Sequence (LC #128)
  • Урок 39. 00:02:46
    Maximum Subarray - Part 1 (LC #53)
  • Урок 40. 00:02:59
    Maximum Subarray - Part 2 (LC #53)
  • Урок 41. 00:03:10
    Maximum Product Subarray - Part 1 (LC #152)
  • Урок 42. 00:04:03
    Maximum Product Subarray - Part 2 (LC #152)
  • Урок 43. 00:04:57
    Find Minimum in Rotated Sorted Array - Part 1 (LC #153)
  • Урок 44. 00:04:11
    Find Minimum in Rotated Sorted Array - Part 2 (LC #153)
  • Урок 45. 00:00:39
    Intervals Section Introduction
  • Урок 46. 00:05:04
    Meeting Rooms (LC #252)
  • Урок 47. 00:02:46
    Non-overlapping Intervals - Part 1 (LC #435)
  • Урок 48. 00:04:28
    Non-overlapping Intervals - Part 2 (LC #435)
  • Урок 49. 00:04:54
    Merge Intervals (LC #56)
  • Урок 50. 00:04:21
    Meeting Rooms II - Part 1 (LC #253)
  • Урок 51. 00:05:25
    Meeting Rooms II - Part 2 (LC #253)
  • Урок 52. 00:00:28
    Matrix Section Introduction
  • Урок 53. 00:02:41
    Spiral Matrix - Part 1 (LC #54)
  • Урок 54. 00:05:40
    Spiral Matrix - Part 2 (LC #54)
  • Урок 55. 00:03:49
    Set Matrix Zeroes - Part 1 (LC #73)
  • Урок 56. 00:06:11
    Set Matrix Zeroes - Part 2 (LC #73)
  • Урок 57. 00:08:25
    Word Search (LC #79)
  • Урок 58. 00:00:13
    Design (Practical Data Structures) Section Introduction
  • Урок 59. 00:07:54
    Shuffle an Array (LC #384)
  • Урок 60. 00:05:22
    Moving Average from Data Stream (LC #346)
  • Урок 61. 00:05:24
    Range Sum Query - Immutable - Part 1 (LC #303)
  • Урок 62. 00:05:02
    Range Sum Query - Immutable - Part 2 (LC #303)
  • Урок 63. 00:03:43
    Min Stack - Part 1 (LC #155)
  • Урок 64. 00:05:14
    Min Stack - Part 2 (LC #155)
  • Урок 65. 00:03:51
    Implement Queue using Stacks - Part 1 (LC #232)
  • Урок 66. 00:05:54
    Implement Queue using Stacks - Part 2 (LC #232)
  • Урок 67. 00:03:23
    Insert Delete GetRandom O(1) - Part 1 (LC #380)
  • Урок 68. 00:07:33
    Insert Delete GetRandom O(1) - Part 2 (LC #380)
  • Урок 69. 00:00:26
    Linked List Section Introduction
  • Урок 70. 00:03:22
    Reverse Linked List (LC #206)
  • Урок 71. 00:03:23
    Linked List Cycle (LC #141)
  • Урок 72. 00:05:02
    [Now You Try] Middle of the Linked List (LC #876)
  • Урок 73. 00:05:07
    Remove Nth Node From End of List (LC #19)
  • Урок 74. 00:04:56
    [Now You Try] Remove Linked List Elements (LC #203)
  • Урок 75. 00:05:00
    Merge Two Sorted Lists (LC #21)
  • Урок 76. 00:06:39
    Reorder List (LC #143)
  • Урок 77. 00:06:52
    Copy List with Random Pointer (LC #138)
  • Урок 78. 00:02:05
    Introduction - Trees and Graphs
  • Урок 79. 00:02:25
    Number of Islands (LC #200)
  • Урок 80. 00:05:13
    Invert Binary Tree (LC #226)
  • Урок 81. 00:05:56
    Maximum Depth of Binary Tree (LC #104)
  • Урок 82. 00:04:51
    [Now You Try] Maximum Depth of Binary Tree, *Iterative* (LC #104)
  • Урок 83. 00:12:24
    Binary Tree Level Order Traversal (LC #102)
  • Урок 84. 00:13:15
    Same Tree (LC #100)
  • Урок 85. 00:07:46
    Subtree of Another Tree (LC #572)
  • Урок 86. 00:11:49
    Validate Binary Search Tree (LC #98)
  • Урок 87. 00:00:25
    Lowest Common Ancestor of a Binary Search Tree - Part 1 (LC# 235)
  • Урок 88. 00:06:43
    Lowest Common Ancestor of a Binary Search Tree - Part 2 (LC# 235)
  • Урок 89. 00:03:28
    Kth Smallest Element in a BST (LC #230)
  • Урок 90. 00:04:00
    Verify Preorder Serialization of a Binary Tree - Part 1 (LC #331)
  • Урок 91. 00:04:43
    Verify Preorder Serialization of a Binary Tree - Part 2 (LC #331)
  • Урок 92. 00:03:51
    Implement Trie (Prefix Tree) (LC #208)
  • Урок 93. 00:04:12
    Add and Search Word - Data structure design (LC #211)
  • Урок 94. 00:06:40
    Number of Connected Components in an Undirected Graph (LC #323)
  • Урок 95. 00:06:07
    [Now You Try] Detect Cycle in Directed Graph
  • Урок 96. 00:04:22
    Course Schedule (LC #207)
  • Урок 97. 00:11:32
    [Now You Try] Detect Cycle in an Undirected Graph
  • Урок 98. 00:06:41
    Graph Valid Tree (LC #261)
  • Урок 99. 00:09:13
    Clone Graph (LC #133)
  • Урок 100. 00:00:20
    Heaps Section Introduction
  • Урок 101. 00:07:07
    Kth Largest Element in an Array (LC #215)
  • Урок 102. 00:07:06
    K Closest Points to Origin (LC #973)
  • Урок 103. 00:07:22
    Top K Frequent Elements (LC #347)
  • Урок 104. 00:09:19
    Merge k Sorted Lists (LC #23)
  • Урок 105. 00:00:20
    Congratulations!
Этот материал находится в платной подписке. Оформи премиум подписку и смотри Python & LeetCode | The Ultimate Interview BootCamp, а также все другие курсы, прямо сейчас!
Премиум