Урок 1. 00:07:57
1.01-intro
Урок 2. 00:09:07
1.02-tracker
Урок 3. 00:07:08
2.01-first-problem
Урок 4. 00:01:47
2.02-solve-it-yourself
Урок 5. 00:12:21
2.03-where-to-code
Урок 6. 00:04:38
2.04-variables
Урок 7. 00:06:23
2.05-functions
Урок 8. 00:10:43
2.06-classes
Урок 9. 00:03:12
2.07-lists-part1
Урок 10. 00:09:41
2.08-lists-part2
Урок 11. 00:03:32
2.09-tuple
Урок 12. 00:07:51
2.10-for-loop-part-1
Урок 13. 00:13:18
2.11-for-loop-part-2
Урок 14. 00:07:11
2.12-strings-part1
Урок 15. 00:05:49
2.13-strings-part-2
Урок 16. 00:09:06
2.14-strings-max-number-of-words
Урок 17. 00:03:43
2.15-list-comprehensions
Урок 18. 00:11:39
2.16-if-then
Урок 19. 00:09:30
2.17-while-loop
Урок 20. 00:04:53
2.18-final-value-of-variable-after-performing-operations
Урок 21. 00:04:44
2.18-integer-divison-and-modulus
Урок 22. 00:00:32
2.19-outro
Урок 23. 00:03:59
2.20-break-and-continue
Урок 24. 00:05:25
3.01-array-richest-customer-wealth
Урок 25. 00:09:37
3.02-array-sign-of-the-product
Урок 26. 00:07:05
3.03-array-kids-with-greatest-number-of-candies
Урок 27. 00:04:43
3.04-array-shuffle-the-array
Урок 28. 00:10:28
3.05-array-average-salary-excluding-min-and-max
Урок 29. 00:11:06
3.06-array-can-place-flowers
Урок 30. 00:07:03
3.07-array-decompress-run-length-encoded-list
Урок 31. 00:06:54
3.08-array-replace-elements-with-greatest-on-the-right-side-part1
Урок 32. 00:12:16
3.09-array-replace-elements-with-greatest-on-the-right-side-part2
Урок 33. 00:07:02
3.10-array-replace-elements-with-greatest-on-the-right-side-part3
Урок 34. 00:08:53
3.11-array-big-O-intro
Урок 35. 00:08:19
3.12-array-maximum-product-of-two-elements-in-an-array-part1
Урок 36. 00:05:53
3.13-array-maximum-product-of-two-elements-in-an-array-part2
Урок 37. 00:04:18
3.14-array-maximum-product-of-two-elements-in-an-array-part3
Урок 38. 00:04:42
3.15-array-left-and-right-sum-diffirences-part1
Урок 39. 00:07:48
3.16-array-left-and-right-sum-diffirences-part2
Урок 40. 00:05:07
3.17-array-find-pivot-index
Урок 41. 00:13:20
4.01-matrix-toeplitz-matrix
Урок 42. 00:09:32
4.02-matrix-matrix-diagonal-sum
Урок 43. 00:10:45
4.03-matrix-transpose-matrix
Урок 44. 00:14:06
4.04-space-complexity
Урок 45. 00:09:07
5.01-tricky-max-consequtive-ones
Урок 46. 00:09:42
5.02-tricky-longest-continious-increasing-subsequence
Урок 47. 00:10:09
5.03-tricky-find-the-highest-altitude
Урок 48. 00:10:33
5.04-tricky-monotonic-array-part1
Урок 49. 00:07:08
5.05-tricky-monotonic-array-part2
Урок 50. 00:14:26
5.06-tricky-valid-mountin-array
Урок 51. 00:15:28
5.07-tricky-best-time-to-buy-and-sell-stock-part1
Урок 52. 00:07:22
5.08-tricky-best-time-to-buy-and-sell-stock-part2
Урок 53. 00:11:50
5.09-tricky-summary-ranges-part1
Урок 54. 00:09:10
5.10-tricky-summary-ranges-part2
Урок 55. 00:06:57
6.01-strings-find-words-containing-characters
Урок 56. 00:02:05
6.02-comment-about-manual-approach
Урок 57. 00:06:16
6.03-strings-shuffle-string
Урок 58. 00:15:32
6.04-strings-student-attendance-record-i
Урок 59. 00:10:20
6.05-strings-length-of-last-word
Урок 60. 00:08:39
6.06-strings-goal-parser-interpretation
Урок 61. 00:05:45
6.07-strings-split-a-string-in-balanced-strings
Урок 62. 00:06:50
6.08-strings-reverse-string
Урок 63. 00:08:59
6.09-strings-truncate-sentence
Урок 64. 00:05:34
7.01-divmod-fizz-buzz
Урок 65. 00:05:04
7.02-divmod-divisible-and-non-divisible-sums-difference
Урок 66. 00:13:05
7.03-divmod-subtract-the-product-and-sum-of-digits-of-an-integer
Урок 67. 00:09:20
7.04-divmod-add-digits
Урок 68. 00:16:13
7.05-divmod-plus-one
Урок 69. 00:11:08
7.06-divmod-plus-one-brute-force
Урок 70. 00:18:10
8.01-hashset-jewels-and-stones
Урок 71. 00:02:06
8.02-hash-is-db
Урок 72. 00:09:29
8.03-hashset-manual
Урок 73. 00:07:08
8.04-hashset-intersection-and-difference-problems
Урок 74. 00:15:51
8.05-hashset-contains-duplicate
Урок 75. 00:08:37
8.06-hashset-missing-number
Урок 76. 00:08:41
8.07-hashset-path-crossing
Урок 77. 00:14:05
8.08-hashset-count-the-number-of-consistent-strings
Урок 78. 00:12:53
9.01-hashtable-user-guide
Урок 79. 00:14:26
9.02-hashtable-first-unique-character-in-a-string
Урок 80. 00:10:34
9.03-hashtables-sum-of-unique-elements
Урок 81. 00:11:18
9.04-hashtables-ransome-note
Урок 82. 00:09:56
9.05-hashtables-valid-anagram
Урок 83. 00:18:17
9.06-hashtables-find-words-that-can-be-formed-by-characters
Урок 84. 00:10:47
9.07-hashtables-unique-number-of-occurences
Урок 85. 00:19:38
9.08-hashtables-two-sum
Урок 86. 00:16:53
9.09-hashtables-how-many-numbers-are-smaller-than-the-current-number
Урок 87. 00:16:49
9.10-hashtables-number-of-good-pairs
Урок 88. 00:13:12
9.11-hashtables-count-number-of-pairs-with-absolute-difference-k
Урок 89. 00:15:07
9.12-hashtable-group-anagrams
Урок 90. 00:02:53
9.13-dict-as-if
Урок 91. 00:19:57
10.01-two-pointers-reverse-vowels-of-a-string
Урок 92. 00:19:00
10.02-two-pointers-valid-palindrome
Урок 93. 00:11:45
10.03-two-pointers-find-first-palindromic-string-in-the-array
Урок 94. 00:10:46
10.04-two-pointers-move-zeroes
Урок 95. 00:08:16
10.05-two-pointers-remove-duplicates-from-sorted-array
Урок 96. 00:14:36
10.06-two-pointers-squares-of-sorted-array
Урок 97. 00:11:42
10.07-two-pointers-two-sum-ii
Урок 98. 00:17:43
10.08-two-pointers-reverse-string-ii
Урок 99. 00:26:04
10.09-two-pointers-longest-palindromic-substring
Урок 100. 00:22:59
11.01-binary-search-binaray-search
Урок 101. 00:09:27
11.02-binary-search-log(n)-time-complexity
Урок 102. 00:19:39
11.03-binary-search-guess-number-higher-or-lower
Урок 103. 00:15:42
11.04-binary-search-first-bad-version
Урок 104. 00:19:42
11.05-binary-search-search-insert-position
Урок 105. 00:21:15
11.06-binary-search-maximum-count-of-positive-integer-and-negative-integer
Урок 106. 00:11:34
11.07-binary-search-valid-perfect-square
Урок 107. 00:14:48
11.08-binary-search-sqrtx
Урок 108. 00:04:27
11.09-overflow
Урок 109. 00:08:34
12.01-why-linked-list
Урок 110. 00:11:42
12.02-linked-list-in-python
Урок 111. 00:08:41
12.03-linked-list-traverse
Урок 112. 00:15:17
12.04-linked-list-middle-of-the-linked-list
Урок 113. 00:14:51
12.05-linked-list-how-to-debug-in-replit
Урок 114. 00:13:51
12.06-linked-list-middle-of-the-linked-list-leopard
Урок 115. 00:14:31
12.07-linked-list-linked-list-cycle
Урок 116. 00:13:14
12.08-linked-list-remove-linked-list-elements-part1
Урок 117. 00:21:36
12.09-linked-list-remove-linked-list-elements-part2
Урок 118. 00:16:15
12.10-linked-list-remove-duplicates-from-sorted-list
Урок 119. 00:16:13
12.11-linked-list-reverse-linked-list
Урок 120. 00:27:49
12.12-linked-list-merge-two-sorted-lists
Урок 121. 00:19:15
12.13-linked-list-palindrome-linked-list-part1
Урок 122. 00:15:29
12.13-linked-list-palindrome-linked-list-part2
Урок 123. 00:22:21
12.14-linked-list-intersection-of-two-linked-lists
Урок 124. 00:15:12
13.01-stack-remove-all-adjacent-duplicates-in-string-part1
Урок 125. 00:15:12
13.02-stack-theory
Урок 126. 00:14:28
13.03-stack-remove-all-adjacent-duplicates-in-string-part2
Урок 127. 00:14:51
13.04-stack-make-the-string-great
Урок 128. 00:12:44
13.05-stack-backspace-string-compare
Урок 129. 00:11:00
13.06-stack-maximum-nesting-depth-of-the-parentheses
Урок 130. 00:21:52
13.07-stack-valid-parentheses
Урок 131. 00:07:54
13.08-stack-daily-temperatures-part1
Урок 132. 00:22:15
13.09-stack-daily-temperatures-part2
Урок 133. 00:20:35
14.01-binary-tree-with-stack-binary-tree
Урок 134. 00:13:33
14.02-binary-tree-traversal
Урок 135. 00:12:13
14.03-binary-tree-binary-tree-preorder-traversal
Урок 136. 00:11:51
14.04-binary-tree-binary-tree-preorder-traversal-part2
Урок 137. 00:12:16
14.05-binary-tree-maximum-depth-of-binary-tree
Урок 138. 00:13:39
14.06-binary-tree-sum-of-left-leaves
Урок 139. 00:14:41
14.07-binary-tree-path-sum
Урок 140. 00:17:20
14.08-binary-tree-same-tree
Урок 141. 00:07:35
14.09-binary-tree-with-stack-invert-binary-tree
Урок 142. 00:16:07
14.10-binary-tree-with-stack-search-in-a-binary-search-tree
Урок 143. 00:19:58
14.11-binary-tree-with-stack-validate-bst
Урок 144. 00:13:08
14.12-binary-tree-with-stack-binary-tree-paths-part1
Урок 145. 00:07:27
14.13-binary-tree-with-stack-binary-tree-paths-part2
Урок 146. 00:12:54
14.14-binary-tree-with-stack-path-sum-ii
Урок 147. 00:21:05
15.01-recursion-is-not-magic
Урок 148. 00:15:20
15.02-recursion-print-range
Урок 149. 00:18:31
15.03-recursion-examples-of-iterative-tasks
Урок 150. 00:16:52
15.04-recursion-is-power-of-three
Урок 151. 00:25:41
15.05-recursion-running-sum-of-1d-array
Урок 152. 00:21:15
15.06-recursion-fibonacci-number
Урок 153. 00:17:41
16.01-binary-tree-with-recursion-preorder-traversal
Урок 154. 00:16:13
16.02-binary-tree-with-recursion-postorder-traversal
Урок 155. 00:21:45
16.03-binary-tree-with-recursion-inorder-traversal
Урок 156. 00:24:57
16.04-binary-tree-with-recursion-maximum-depth-of-binary-tree
Урок 157. 00:19:42
16.05-binary-trees-with-recursion-sum-of-left-leaves
Урок 158. 00:26:10
16.06-binary-tree-with-recursion-path-sum
Урок 159. 00:06:55
16.07-binary-tree-with-recursion-invert-binary-tree
Урок 160. 00:17:43
16.08-binary-search-tree-with-recursion-search-in-a-binary-search-tree
Урок 161. 00:21:10
16.09-binary-search-tree-with-recursion-validate-binary-search-tree
Урок 162. 00:22:07
16.10-binary-tree-with-recursion-path-sum-ii
Урок 163. 00:07:18
17.01-what-is-queue
Урок 164. 00:14:47
17.02-bfs
Урок 165. 00:17:26
17.03-bfs-binary-tree-level-order-traversal
Урок 166. 00:08:03
17.04-bfs-binary-tree-right-side-view
Урок 167. 00:09:26
17.05-bfs-binary-tree-zigzag-level-order-traversal
Урок 168. 00:14:53
17.06-bfs-binary-tree-level-order-traversal-with-dfs
Урок 169. 00:07:44
17.07-bfs-binary-tree-zigzag-level-order-traversal-dfs
Урок 170. 00:23:21
18.01-backtracking-binary-tree-paths
Урок 171. 00:15:56
18.02-backtracking-permutations-part1
Урок 172. 00:14:08
18.03-backtracking-permutations-part2
Урок 173. 00:16:21
18.04-backtracking-subsets
Урок 174. 00:12:30
18.05-backtracking-combinations
Урок 175. 00:21:28
18.06-backtracking-combination-sum
Урок 176. 00:15:53
18.07-backtracking-letter-combinations-of-a-phone-number
Урок 177. 00:19:30
19.01-advanced-dfs-diameter-of-binary-tree
Урок 178. 00:11:11
19.02-advanced-dfs-balanced-binary-tree
Урок 179. 00:17:55
19.03-advanced-dfs-symmetric-tree
Урок 180. 00:19:30
19.04-advanced-dfs-lowest-common-ancestor
Урок 181. 00:19:32
19.05-advanced-dfs-flood-fill
Урок 182. 00:16:08
19.06-advanced-dfs-number-of-islands
Урок 183. 00:20:02
19.07-advanced-dfs-word-search
Урок 184. 00:11:34
19.08-advanced-dfs-all-paths-from-source-to-target
Урок 185. 00:23:07
19.09-advanced-dfs-course-schedule
Урок 186. 00:19:30
20.01-advanced-dfs-diameter-of-binary-tree
Урок 187. 00:21:13
20.02-dynamic-programming-fib-memoization-part2
Урок 188. 00:05:24
20.03-lru-cache
Урок 189. 00:16:23
20.04-dynamic-programming-fib-tabulation
Урок 190. 00:24:26
20.05-dynamic-programming-climbing-stares
Урок 191. 00:17:33
20.06-dynamic-programming-min-cost-climing-stairs
Урок 192. 00:14:14
20.07-dynamic-programming-min-cost-climbing-stairs-memo
Урок 193. 00:19:12
20.08-dynamic-programming-house-robber
Урок 194. 00:15:20
20.09-dynamic-programming-maximum-subarray
Урок 195. 00:17:59
20.10-dynamic-programming-unique-paths
Урок 196. 00:15:29
20.11-dynamic-programming-minimun-sum-path
Урок 197. 00:15:13
20.12-dynamic-programming-minimum-path-sum-part2
Урок 198. 00:22:33
20.13-dynamic-programming-coin-change-part1
Урок 199. 00:19:11
20.14-dynamic-programming-coin-change-part2
Урок 200. 00:11:25
21.01-sorting-selection-sort
Урок 201. 00:15:26
21.02-sorting-insertion-sort
Урок 202. 00:09:00
21.03-sorting-bubble-sort
Урок 203. 00:20:03
21.04-sorting-counting-sort
Урок 204. 00:11:38
21.05-sorting-merge-sort-part1
Урок 205. 00:12:33
21.06-sorting-merge-sort-part2
Урок 206. 00:17:06
21.07-sorting-quick-sort
Урок 207. 00:14:48
22.01-bit-manipulations-overview
Урок 208. 00:11:20
22.02-bit-manipulations-power-of-two
Урок 209. 00:18:15
22.03-bit-manipulations-number-of-1-bits
Урок 210. 00:07:54
22.04-bit-manipulations-hamming-distance
Урок 211. 00:14:36
22.05-bit-manipulations-number-compliment
Урок 212. 00:06:55
22.06-bit-manipulations-single-number
Урок 213. 00:16:52
23.01-sliding-window-maximum-average-subarray-i
Урок 214. 00:15:51
23.02-sliding-window-contains-duplicate-ii
Урок 215. 00:11:54
23.03-sliding-window-minimum-recolors-to-get-k-consecutive-black-blocks
Урок 216. 00:14:14
23.04-sliding-window-max-consecutive-ones-iii
Урок 217. 00:17:58
23.05-sliding-window-longest-substring-without-repeating-characters
Урок 218. 01:32:54
24.01-heap-heap
Урок 219. 01:39:24
24.02-heap-last-stone-weight
Урок 220. 01:38:23
24.03-heap-kth-largest-element-in-an-array
Урок 221. 01:26:28
24.04-heap-top-k-frequent-words
Урок 222. 01:57:44
27. 1. 2024-09-14 16.59.45 A4
Урок 223. 01:53:30
28. 2. 2024-09-28 16.59.06 A4
Урок 224. 01:18:05
29. 3. 2024-10-12 16.57.39 A4
Урок 225. 01:34:54
30. 4. 2024-10-26 16.58.34 A4
Урок 226. 01:28:44
31. 5. 2024-11-09 16.58.29 A4
Урок 227. 01:23:50
32. 6. 2024-11-23 16.57.15 A4
Урок 228. 00:12:32
33. 7. 2024-12-07 10.57.55 A4
Урок 229. 00:17:07
37. 8. 2024-12-21 16.58.49 A4
Урок 230. 00:13:13
35. 9. 2025-01-04 16.57.37 A4
Урок 231. 00:22:12
36. 10. 2025-01-18 16.58.13 A4
