algoexpert
Алгоритмы трудно выучить на бумаге. Каждый из наших вопросов сопровождается видео-объяснением из двух частей для максимального обучения. Это более 50 часов контента, все в ваших руках.
-
Урок 1. 00:28:25Two Number Sum
-
Урок 2. 00:18:54Validate Subsequence
-
Урок 3. 00:21:14Sorted Squared Array
-
Урок 4. 00:21:51Tournament Winner
-
Урок 5. 00:20:13Non-Constructible Change
-
Урок 6. 00:10:52Transpose Matrix
-
Урок 7. 00:24:40Find Closest Value In BST
-
Урок 8. 00:23:55Branch Sums
-
Урок 9. 00:29:45Node Depths
-
Урок 10. 00:09:56Evaluate Expression Tree
-
Урок 11. 00:15:07Depth-first Search
-
Урок 12. 00:18:25Minimum Waiting Time
-
Урок 13. 00:19:00Class Photos
-
Урок 14. 00:28:15Tandem Bicycle
-
Урок 15. 00:14:02Optimal Freelancing
-
Урок 16. 00:22:41Remove Duplicates From Linked List
-
Урок 17. 00:11:56Middle Node
-
Урок 18. 00:31:06Nth Fibonacci
-
Урок 19. 00:19:03Product Sum
-
Урок 20. 00:27:34Binary Search
-
Урок 21. 00:15:29Find Three Largest Numbers
-
Урок 22. 00:19:02Bubble Sort
-
Урок 23. 00:11:59Insertion Sort
-
Урок 24. 00:14:48Selection Sort
-
Урок 25. 00:29:15Palindrome Check
-
Урок 26. 00:21:41Caesar Cipher Encryptor
-
Урок 27. 00:27:04Run-Length Encoding
-
Урок 28. 00:26:57Common Characters
-
Урок 29. 00:28:34Generate Document
-
Урок 30. 00:18:47First Non-Repeating Character
-
Урок 31. 00:10:22Semordnilap
-
Урок 32. 00:27:23Three Number Sum
-
Урок 33. 00:23:13Smallest Difference
-
Урок 34. 00:23:43Move Element To End
-
Урок 35. 00:33:16Monotonic Array
-
Урок 36. 00:33:40Spiral Traverse
-
Урок 37. 00:35:51Longest Peak
-
Урок 38. 00:33:28Array Of Products
-
Урок 39. 00:30:16First Duplicate Value
-
Урок 40. 00:25:40Merge Overlapping Intervals
-
Урок 41. 00:15:41Best Seat
-
Урок 42. 00:11:55Zero Sum Subarray
-
Урок 43. 00:30:49Missing Numbers
-
Урок 44. 00:25:35Majority Element
-
Урок 45. 00:15:05Sweet And Savory
-
Урок 46. 00:51:39BST Construction
-
Урок 47. 00:23:04Validate BSTI
-
Урок 48. 00:19:27BST Traversal
-
Урок 49. 00:40:13Min Height BST
-
Урок 50. 00:29:04Find Kth Largest Value In BST
-
Урок 51. 00:56:58Reconstruct BST
-
Урок 52. 00:29:23Invert Binary Tree
-
Урок 53. 00:23:21Binary Tree Diameter
-
Урок 54. 00:30:16Find Successor
-
Урок 55. 00:26:12Height Balanced Binary Tree
-
Урок 56. 00:24:28Merge Binary Trees
-
Урок 57. 00:21:35Symmetrical Tree
-
Урок 58. 00:14:22Split Binary Tree
-
Урок 59. 00:21:47Max Subset Sum No Adjacent
-
Урок 60. 00:18:56Number Of Ways To Make Change
-
Урок 61. 00:23:55Min Number Of Coins For Change
-
Урок 62. 00:41:58Levenshtein Distance
-
Урок 63. 00:39:20Number Of Ways To Traverse Graph
-
Урок 64. 00:22:36Kadane's Algorithm
-
Урок 65. 00:27:30Stable internships
-
Урок 66. 00:35:02Union Find
-
Урок 67. 00:24:06Single Cycle Check
-
Урок 68. 00:19:35Breadth-first Search
-
Урок 69. 00:43:47River Sizes
-
Урок 70. 00:21:35Youngest Common Ancestor
-
Урок 71. 00:49:05Remove Islands
-
Урок 72. 00:47:20Cycle In Graph
-
Урок 73. 00:33:34Minimum Passes Of Matrix
-
Урок 74. 00:16:11Two-Colorable
-
Урок 75. 00:25:48Task Assignment
-
Урок 76. 00:42:50Valid Starting City
-
Урок 77. 00:57:31Min Heap Construction
-
Урок 78. 00:59:41Linked List Construction
-
Урок 79. 00:21:26Remove Kth Node From End
-
Урок 80. 00:31:57Sum of Linked Lists
-
Урок 81. 00:22:14Merging Linked Lists
-
Урок 82. 00:55:43Permutations
-
Урок 83. 00:26:24Powerset
-
Урок 84. 00:37:06Phone Number Mnemonics
-
Урок 85. 00:47:45Staircase Traversal
-
Урок 86. 00:21:21Blackjack Probability
-
Урок 87. 00:19:02Reveal Minesweeper
-
Урок 88. 00:20:27Search In Sorted Matrix
-
Урок 89. 00:39:53Three Number Sort
-
Урок 90. 00:25:43Min Max Stack Construction
-
Урок 91. 00:19:42Balanced Brackets
-
Урок 92. 00:33:46Sunset Views
-
Урок 93. 00:16:23Best Digits
-
Урок 94. 00:29:52Sort Stack
-
Урок 95. 00:45:43Next Greater Element
-
Урок 96. 00:14:53Reverse Polish Notation
-
Урок 97. 00:16:46Colliding Asteroids
-
Урок 98. 00:26:58Longest Palindromic Substring
-
Урок 99. 00:35:09Group Anagrams
-
Урок 100. 00:29:32Valid IP Addresses
-
Урок 101. 00:48:03Reverse Words In String
-
Урок 102. 00:27:30Minimum Characters For Words
-
Урок 103. 00:18:42One Edit
-
Урок 104. 00:34:31Suffix Trie Construction
-
Урок 105. 00:46:17Four Number Sum
-
Урок 106. 00:28:28Subarray Sort
-
Урок 107. 00:26:32Largest Range
-
Урок 108. 00:59:25Min Rewards
-
Урок 109. 00:33:11Zigzag Traverse
-
Урок 110. 00:23:07Longest Subarray With Sum
-
Урок 111. 00:24:04Knight Connection
-
Урок 112. 00:25:47Count Squares
-
Урок 113. 00:54:11Same BSTs
-
Урок 114. 00:45:49Validate Three Nodes
-
Урок 115. 00:27:32Repair BST
-
Урок 116. 00:31:24Sum BSTs
-
Урок 117. 00:46:24Max Path Sum In Binary Tree
-
Урок 118. 00:55:40Find Nodes Distance K
-
Урок 119. 00:32:52Max Sum Increasing Subsequence
-
Урок 120. 00:54:38Longest Common Subsequence
-
Урок 121. 00:34:13Min Number Of Jumps
-
Урок 122. 00:35:47Water Area
-
Урок 123. 00:43:01Knapsack Problem
-
Урок 124. 00:38:36Disk Stacking
-
Урок 125. 00:44:45Numbers In Pil
-
Урок 126. 00:45:38Maximum Sum Submatrix
-
Урок 127. 00:35:41Maximize Expression|
-
Урок 128. 00:42:52Dice Throws
-
Урок 129. 00:26:41Juice Bottling
-
Урок 130. 01:01:56Dijkstra's Algorithm
-
Урок 131. 01:08:04Topological Sort
-
Урок 132. 00:20:42Kruskal's Algorithm
-
Урок 133. 00:37:41Prim's Algorithm
-
Урок 134. 01:06:24Boggle Board
-
Урок 135. 00:38:40Largest Island
-
Урок 136. 00:33:50Continuous Median
-
Урок 137. 00:29:12Sort K-Sorted Array
-
Урок 138. 00:48:27Laptop Rentals
-
Урок 139. 00:24:22Find Loop
-
Урок 140. 00:28:47Reverse Linked List
-
Урок 141. 00:44:38Merge Linked Lists
-
Урок 142. 00:32:17Shift Linked List
-
Урок 143. 00:29:51Lowest Common Manager
-
Урок 144. 00:44:09Interweaving Strings
-
Урок 145. 00:37:27Solve Sudoku
-
Урок 146. 00:30:57Generate Div Tags
-
Урок 147. 00:45:16Ambiguous Measurements
-
Урок 148. 00:28:43Shifted Binary Search
-
Урок 149. 00:29:45Search For Range
-
Урок 150. 00:35:49Quickselect
-
Урок 151. 00:27:33Index Equals Value
-
Урок 152. 00:46:20Quick Sort
-
Урок 153. 00:29:28Heap Sort
-
Урок 154. 00:40:51Radix Sort
-
Урок 155. 00:46:20Shorten Path
-
Урок 156. 00:48:30Largest Rectangle Under Skyline
-
Урок 157. 00:27:17Longest Substring Without Duplication
-
Урок 158. 00:59:58Underscorify Substring
-
Урок 159. 00:44:42Pattern Matcher
-
Урок 160. 01:08:42Multi String Search
-
Урок 161. 00:19:51Longest Most Frequent Prefix
-
Урок 162. 00:20:21Shortest Unique Prefixes
-
Урок 163. 01:02:09Apartment Hunting
-
Урок 164. 00:52:35Calendar Matching
-
Урок 165. 00:33:56Waterfall Streams
-
Урок 166. 00:53:18Minimum Area Rectangle
-
Урок 167. 00:41:35Line Through Points
-
Урок 168. 00:56:08Right Smaller Than
-
Урок 169. 00:29:15Iterative In-order Traversal
-
Урок 170. 00:41:57Flatten Binary Tree
-
Урок 171. 00:41:45Right Sibling Tree
-
Урок 172. 01:06:25All Kinds Of Node Depths
-
Урок 173. 00:52:34Compare Leaf Traversal
-
Урок 174. 00:48:37Max Profit With K Transactions
-
Урок 175. 01:00:24Palindrome Partitioning Min Cuts
-
Урок 176. 01:15:29Longest Increasing Subsequence
-
Урок 177. 00:44:55Longest String Chain
-
Урок 178. 01:19:51Square of Zeroes
-
Урок 179. 00:59:08Knuth-Morris-Pratt Algorithm
-
Урок 180. 01:00:52A* Algorithm
-
Урок 181. 01:13:27Rectangle Mania
-
Урок 182. 00:51:13Detect Arbitrage
-
Урок 183. 00:46:50Two-Edge-Connected Graph
-
Урок 184. 01:06:28Airport Connections
-
Урок 185. 01:05:40Merge Sorted Arrays
-
Урок 186. 00:54:47LRU Cache
-
Урок 187. 00:48:03Rearrange Linked List
-
Урок 188. 00:33:02Linked List Palindrome
-
Урок 189. 00:33:52Zip Linked List
-
Урок 190. 00:29:30Node Swap
-
Урок 191. 00:46:10Number Of Binary Tree Topologies
-
Урок 192. 00:57:36Non-Attacking Queens
-
Урок 193. 00:32:18Median Of Two Sorted Arrays
-
Урок 194. 00:28:35Optimal Assembly Line
-
Урок 195. 01:17:07Merge Sort
-
Урок 196. 00:38:50Count Inversions
-
Урок 197. 00:30:05Largest Park
-
Урок 198. 00:50:31Smallest Substring Containing
-
Урок 199. 00:45:28Longest Balanced Substring
-
Урок 200. 00:35:11Strings Made Up Of Strings
можно будет и субтитры, и озвученный перевод сделать, если нужно.
For example, for video#87 (reveal minesweeper),
the solution the solution on path 2. Medium > 56. Reveal Minesweeper > 9. TypeScript is not complete.
Same with other many Typescript solutions.
please update the zip code material
Surprised no one else asked for them, are you guys just looking at the solution before giving it a try? Or maybe giving it a try after the solution has been discussed, without looking at the completed code? I'm trying to build a little intuition beyond memorizing solutions though.
It returns an array of numbers with selected number moved to the end, but other numbers are still in the same order they were represented in the initial array.
const moveToEnd = (array, num) => {
let idx = array.indexOf(num);
for (let i = idx + 1; i < array.length; i++){
if (array[i] !== num){
//swap
[array[i], array[idx]] = [array[idx], array[i]];
idx++;
}
}
return array;
}