• Урок 1. 00:01:36
    Introduction
  • Урок 2. 00:01:56
    How to use this course
  • Урок 3. 00:04:24
    Big O Introduction
  • Урок 4. 00:06:17
    Big O Exercises
  • Урок 5. 00:09:20
    Formalizing Big O
  • Урок 6. 00:05:33
    Big O Simplification
  • Урок 7. 00:04:51
    Space complexity
  • Урок 8. 00:06:30
    Logarithms
  • Урок 9. 00:08:05
    Binary Search Algorithm
  • Урок 10. 00:05:46
    Binary Search Implementation
  • Урок 11. 00:10:29
    Sliding Window Technique
  • Урок 12. 00:05:04
    Sliding Window Implementation
  • Урок 13. 00:09:09
    Explanation - Move Zeroes - Easy #283
  • Урок 14. 00:02:29
    Code - Move Zeroes - Easy #283
  • Урок 15. 00:02:34
    [Custom Input - NEW] - Move Zeroes
  • Урок 16. 00:11:59
    Explanation - Boats to Save People - Medium #881
  • Урок 17. 00:03:59
    Code - Boats to Save People - Medium #881
  • Урок 18. 00:05:40
    [Custom Input - NEW] - Boats to save people
  • Урок 19. 00:10:21
    Explanation - Valid Mountain Array - Easy #941
  • Урок 20. 00:03:50
    Code - Valid Mountain Array - Easy #941
  • Урок 21. 00:02:33
    [Custom Input - NEW] - Valid Mountain Array
  • Урок 22. 00:11:40
    Explanation - Container With Most Water - Medium #11
  • Урок 23. 00:05:00
    Code - Container With Most Water - Medium #11
  • Урок 24. 00:04:30
    [Custom Input - NEW] - Container with most water
  • Урок 25. 00:12:01
    Explanation - Longest Substring Without Repeating Characters - Medium #3
  • Урок 26. 00:02:51
    Code - Longest Substring Without Repeating Characters - Medium #3
  • Урок 27. 00:01:39
    [Custom Input - NEW] - Longest Substring Without repeating characters
  • Урок 28. 00:17:35
    Explanation - Find First and Last Position of Element in Sorted Array-Medium #34
  • Урок 29. 00:09:24
    Code - Find First and Last Position of Element in Sorted Array - Medium #34
  • Урок 30. 00:03:03
    [Custom Input - NEW] - Find first and last position of element in sorted array
  • Урок 31. 00:07:26
    Explanation - First Bad Version - Easy #278
  • Урок 32. 00:03:34
    Code - First Bad Version - Easy #278
  • Урок 33. 00:05:55
    [Custom Input - NEW] - First Bad Version - Easy #278
  • Урок 34. 00:08:38
    Explanation - Missing Number - Easy #268
  • Урок 35. 00:01:48
    Code - Missing Number - Easy #268
  • Урок 36. 00:01:34
    [Custom Input - NEW] - Missing Number - Easy #268
  • Урок 37. 00:05:00
    Explanation - Count Primes - Easy #204
  • Урок 38. 00:03:44
    Code - Count Primes - Easy #204
  • Урок 39. 00:01:29
    [Custom Input - NEW] - Count Primes - Easy #204
  • Урок 40. 00:05:05
    Explanation - Single Number - Easy #136
  • Урок 41. 00:00:55
    Code - Single Number - Easy #136
  • Урок 42. 00:01:00
    [Custom Input - NEW] - Single Number - Easy#136
  • Урок 43. 00:03:08
    Explanation - Robot Return to Origin - Easy #657
  • Урок 44. 00:01:54
    Code - Robot Return to Origin - Easy #657
  • Урок 45. 00:02:03
    [Custom Input - NEW] - Robot Return to Origin - Easy #657
  • Урок 46. 00:06:14
    Explanation - Add Binary - Easy #67
  • Урок 47. 00:05:19
    Code - Add Binary - Easy #67
  • Урок 48. 00:02:24
    [Custom Input - NEW] - Add Binary - Easy #67
  • Урок 49. 00:05:33
    What are hash tables ?
  • Урок 50. 00:07:06
    Collision handling
  • Урок 51. 00:03:48
    Collision handling techniques comparison
  • Урок 52. 00:06:51
    Explanation - Two Sum - Easy #1
  • Урок 53. 00:02:26
    Code - Two Sum - Easy #1
  • Урок 54. 00:02:13
    [Custom Input] - Two Sum - Easy #1
  • Урок 55. 00:05:00
    Explanation - Contains Duplicate - Easy #217
  • Урок 56. 00:02:06
    Code - Contains Duplicate - Easy #217
  • Урок 57. 00:01:43
    [Custom Input] - Contains Duplicate - Easy #217
  • Урок 58. 00:03:41
    Explanation - Majority Element - Easy #169
  • Урок 59. 00:01:54
    Code - Majority Element - Easy #169
  • Урок 60. 00:03:23
    [Custom Input] - Majority Element - Easy #169
  • Урок 61. 00:06:06
    Explanation - Group Anagrams - Medium #49
  • Урок 62. 00:03:44
    Code - Group Anagrams - Medium #49
  • Урок 63. 00:03:16
    [Custom Input] - Group Anagrams - Medium #49
  • Урок 64. 00:09:03
    Explanation - 4Sum II - Medium #454
  • Урок 65. 00:04:36
    Code - 4Sum II - Medium #454
  • Урок 66. 00:05:47
    [Custom Input] - 4Sum II - Medium #454
  • Урок 67. 00:14:35
    Explanation - LRU Cache - Medium #146
  • Урок 68. 00:04:49
    Code - LRU Cache - Medium #146
  • Урок 69. 00:04:10
    [Custom Input] - LRU Cache - Medium #146
  • Урок 70. 00:20:09
    Explanation - Minimum Window Substring - Hard #76
  • Урок 71. 00:10:20
    Code - Minimum Window Substring - Hard #76
  • Урок 72. 00:07:30
    What are Linked Lists ?
  • Урок 73. 00:05:02
    Singly linked list creation implementation
  • Урок 74. 00:07:32
    Singly linked list insertion implementation
  • Урок 75. 00:04:29
    Singly linked list deletion implementation
  • Урок 76. 00:02:59
    Doubly Linked Lists
  • Урок 77. 00:08:45
    Doubly linked lists creation implementation
  • Урок 78. 00:10:23
    Doubly linked lists insertion implementation
  • Урок 79. 00:08:47
    Doubly linked list deletion implementation
  • Урок 80. 00:07:11
    Explanation - Merge Two Sorted Lists - Easy #21
  • Урок 81. 00:05:22
    Code - Merge Two Sorted Lists - Easy #21
  • Урок 82. 00:06:02
    [Custom Input - NEW] - Merge Two Sorted Lists - Easy #21
  • Урок 83. 00:04:51
    Explanation - Linked List Cycle - Easy #141
  • Урок 84. 00:01:55
    Code - Linked List Cycle - Easy #141
  • Урок 85. 00:04:41
    [Custom Input - NEW] - Linked List Cycle - Easy #141
  • Урок 86. 00:08:30
    Explanation - Reverse Linked List - Easy #206
  • Урок 87. 00:02:10
    Code - Reverse Linked List - Easy #206
  • Урок 88. 00:04:12
    [Custom Input - NEW] - Reverse Linked List - Easy #206
  • Урок 89. 00:09:53
    Explanation - Add Two Numbers - Medium #2
  • Урок 90. 00:04:49
    Code - Add Two Numbers - Medium #2
  • Урок 91. 00:06:41
    [Custom Input - NEW] - Add Two Numbers - Medium #2
  • Урок 92. 00:07:28
    Explanation - Remove Nth Node From End of List - Medium #19
  • Урок 93. 00:02:36
    Code - Remove Nth Node From End of List - Medium #19
  • Урок 94. 00:04:36
    [Custom Input - NEW] - Remove Nth Node From End of List - Medium #19
  • Урок 95. 00:07:38
    Explanation - Odd Even Linked List - Medium #328
  • Урок 96. 00:04:04
    Code - Odd Even Linked List - Medium #328
  • Урок 97. 00:05:33
    [Custom Input - NEW] - Odd Even Linked List - Medium #328
  • Урок 98. 00:09:26
    Explanation - Merge K Sorted Lists - Hard #23
  • Урок 99. 00:08:02
    Code - Merge K Sorted Lists - Hard #23
  • Урок 100. 00:22:25
    Explanation - Subsets - Medium #78
  • Урок 101. 00:03:03
    Code - Subsets - Medium #78
  • Урок 102. 00:20:01
    Explanation - Letter Combinations of a Phone Number - Medium #17
  • Урок 103. 00:06:02
    Code - Letter Combinations of a Phone Number - Medium #17
  • Урок 104. 00:28:24
    Explanation - Word Search - Medium #79
  • Урок 105. 00:09:09
    Code - Word Search - Medium #79
  • Урок 106. 00:29:00
    Explanation - Combination Sum - Medium #39
  • Урок 107. 00:03:51
    Code - Combination Sum - Medium #39
  • Урок 108. 00:11:59
    Explanation - Palindrome Partitioning - Medium #131
  • Урок 109. 00:05:29
    Code - Palindrome Partitioning - Medium #131
  • Урок 110. 00:04:03
    What are stacks ?
  • Урок 111. 00:02:43
    Stacks Implementation
  • Урок 112. 00:03:28
    What are Queues
  • Урок 113. 00:02:17
    Queues Implementation
  • Урок 114. 00:04:05
    What are Graphs ?
  • Урок 115. 00:07:57
    Directed Graph Implementation - Adjacency List
  • Урок 116. 00:10:14
    Directed Graph Implementation - Adjacency Matrix
  • Урок 117. 00:07:29
    Undirected Graph Implementation - Adjacency List
  • Урок 118. 00:06:12
    Undirected Graph Implementation - Adjacency Matrix
  • Урок 119. 00:08:57
    Depth First Search (DFS)
  • Урок 120. 00:08:09
    DFS implementation
  • Урок 121. 00:08:35
    Breadth First Search (BFS)
  • Урок 122. 00:07:55
    BFS Implementation
  • Урок 123. 00:11:13
    Dijkstra's Algorithm
  • Урок 124. 00:08:13
    Explanation - network delay time - Medium #743
  • Урок 125. 00:08:55
    Code - network delay time - Medium #743
  • Урок 126. 00:11:40
    What are trees ?
  • Урок 127. 00:03:33
    Trees Implementation
  • Урок 128. 00:04:23
    In-order Traversal Technique
  • Урок 129. 00:04:48
    In-order traversal implementation
  • Урок 130. 00:04:05
    Pre-order Traversal Technique
  • Урок 131. 00:03:20
    Pre-order traversal implementation
  • Урок 132. 00:03:54
    Post-order Traversal Technique
  • Урок 133. 00:03:20
    Post-order traversal implementation
  • Урок 134. 00:06:44
    What is a binary search tree (BST)
  • Урок 135. 00:10:46
    Binary Search tree creation and insertion implementation
  • Урок 136. 00:06:31
    Binary search tree searching Implementation
  • Урок 137. 00:07:10
    BInary search tree deletion implementation
  • Урок 138. 00:08:30
    Explanation - Symmetric Trees - Easy #101
  • Урок 139. 00:02:45
    Code - Symmetric Trees - Easy #101
  • Урок 140. 00:12:04
    Explanation - Maximum Depth of Binary Tree - Easy #104
  • Урок 141. 00:02:15
    Code - Maximum Depth of Binary Tree - Easy #104
  • Урок 142. 00:06:31
    Explanation - Path Sum - Easy #112
  • Урок 143. 00:02:36
    Code - Path Sum - Easy #112
  • Урок 144. 00:14:46
    Explanation- Lowest Common Ancestor of a Binary Tree - Medium #236
  • Урок 145. 00:03:05
    Code- Lowest Common Ancestor of a Binary Tree - Medium #236
  • Урок 146. 00:10:30
    Explanation - Kth Smallest Element in a BST - Medium #230
  • Урок 147. 00:01:57
    Code - Kth Smallest Element in a BST - Medium #230
  • Урок 148. 00:11:01
    Explanation - Serialize and Deserialize Binary Tree - hard #297
  • Урок 149. 00:05:20
    Code - Serialize and Deserialize Binary Tree - hard #297
  • Урок 150. 00:23:45
    Explanation - Binary Tree Maximum Path Sum - Hard #124
  • Урок 151. 00:03:28
    Code - Binary Tree Maximum Path Sum - Hard #124
  • Урок 152. 00:06:07
    Explanation - Min Stack - Easy #155
  • Урок 153. 00:02:28
    Code - Min Stack - Easy #155
  • Урок 154. 00:09:19
    Explanation - Valid Parenthesis - Easy #20
  • Урок 155. 00:04:19
    Code - Valid Parenthesis - Easy #20
  • Урок 156. 00:10:54
    Explanation - Binary Tree Level Order Traversal - Medium #102
  • Урок 157. 00:03:23
    Code - Binary Tree Level Order Traversal - Medium #102
  • Урок 158. 00:14:44
    Explanation - Binary Tree Zigzag Level Order Traversal - Medium #103
  • Урок 159. 00:04:06
    Code - Binary Tree Zigzag Level Order Traversal - Medium #103
  • Урок 160. 00:10:28
    Explanation - Binary Tree Postorder Traversal - Medium #145
  • Урок 161. 00:02:14
    Code - Binary Tree Postorder Traversal - Medium #145
  • Урок 162. 00:06:52
    What is Dynamic Programming ?
  • Урок 163. 00:06:44
    Explanation - House Robber - Easy #198
  • Урок 164. 00:03:57
    Code - House Robber - Easy #198
  • Урок 165. 00:08:35
    Explanation - Best Time to Buy and Sell Stock - Easy #121
  • Урок 166. 00:02:13
    Code - Best Time to Buy and Sell Stock - Easy #121
  • Урок 167. 00:04:52
    Explanation - Climbing Stairs - Easy #70
  • Урок 168. 00:03:05
    Code - Climbing Stairs - Easy #70
  • Урок 169. 00:13:04
    Explanation - Coin Change - Medium #322
  • Урок 170. 00:04:04
    Code - Coin Change - Medium #322
  • Урок 171. 00:08:42
    Explanation - Unique Paths - Medium #62
  • Урок 172. 00:03:18
    Code - Unique Paths - Medium #62
  • Урок 173. 00:22:44
    Explanation - Longest Palindromic Substring - Medium #5
  • Урок 174. 00:04:25
    Code - Longest Palindromic Substring - Medium #5
  • Урок 175. 00:21:55
    Explanation - Trapping Rain Water - Hard #42
  • Урок 176. 00:04:22
    Code - Trapping Rain Water - Hard #42
Этот материал находится в платной подписке. Оформи премиум подписку и смотри LeetCode In Python: 50 Algorithms Coding Interview Questions, а также все другие курсы, прямо сейчас!
Премиум