• Урок 1. 00:07:50
    Introduction
  • Урок 2. 00:12:42
    Big O Time Complexity
  • Урок 3. 00:13:28
    Arrays Data Structure
  • Урок 4. 00:03:19
    Arrays Q&A
  • Урок 5. 00:07:20
    Linear Search & Kata Setup
  • Урок 6. 00:08:13
    Binary Search Algorithm
  • Урок 7. 00:06:21
    Pseudo Code Binary Search
  • Урок 8. 00:04:40
    Implementing Binary Search
  • Урок 9. 00:05:46
    Two Crystal Balls Problem
  • Урок 10. 00:06:59
    Implementing Two Crystal Balls
  • Урок 11. 00:08:42
    Bubble Sort
  • Урок 12. 00:09:26
    Implementing Bubble Sort
  • Урок 13. 00:14:47
    Linked List Data Structures
  • Урок 14. 00:04:57
    Linked List Complexity
  • Урок 15. 00:05:50
    Queue
  • Урок 16. 00:07:22
    Implementing a Queue
  • Урок 17. 00:03:30
    Queue Q&A
  • Урок 18. 00:04:43
    Stack
  • Урок 19. 00:07:53
    Implementing a Stack
  • Урок 20. 00:06:09
    Arrays vs Linked List
  • Урок 21. 00:11:46
    ArrayList
  • Урок 22. 00:07:01
    ArrayBuffer
  • Урок 23. 00:14:49
    Data Structures Q&A
  • Урок 24. 00:13:22
    Recursion
  • Урок 25. 00:12:33
    Path Finding: Base Case
  • Урок 26. 00:12:20
    Path Finding: Recursive Case
  • Урок 27. 00:09:13
    Recursion Q&A
  • Урок 28. 00:13:48
    QuickSort Algorithm
  • Урок 29. 00:15:57
    Implementing QuickSort
  • Урок 30. 00:12:38
    Linked List: prepend, insertAt, & append
  • Урок 31. 00:13:14
    Linked List: remove, get, & removeAt
  • Урок 32. 00:04:05
    Linked List Q&A
  • Урок 33. 00:06:00
    Debugging Linked List
  • Урок 34. 00:07:56
    Trees Overview
  • Урок 35. 00:09:27
    Tree Traversals
  • Урок 36. 00:14:59
    Implement Tree Traversal
  • Урок 37. 00:06:24
    Breadth-First Search
  • Урок 38. 00:07:38
    Implement Breadth-First Search
  • Урок 39. 00:04:21
    Search Practice
  • Урок 40. 00:08:06
    Implement Binary Tree Comparison
  • Урок 41. 00:09:51
    Depth-First: Find
  • Урок 42. 00:08:00
    Depth-First: Insert
  • Урок 43. 00:06:53
    Depth-First: Delete
  • Урок 44. 00:04:07
    Binary Search Tree Q&A
  • Урок 45. 00:04:52
    Implement Depth-First Search
  • Урок 46. 00:15:51
    Heap
  • Урок 47. 00:19:08
    Implementing Heap
  • Урок 48. 00:14:29
    Tries
  • Урок 49. 00:07:32
    Graphs Overview
  • Урок 50. 00:13:08
    Searching an Adjacency Matrix
  • Урок 51. 00:08:29
    Implementing BFS on Adjacency Matrix
  • Урок 52. 00:11:35
    Implement DFS on Adjacency List
  • Урок 53. 00:12:35
    Dijkstra's Shortest Path
  • Урок 54. 00:12:04
    Implement Dijkstra's Shortest Path
  • Урок 55. 00:09:19
    Dijkstra's Shortest Path Run Time
  • Урок 56. 00:11:42
    Maps
  • Урок 57. 00:10:38
    LRU Cache
  • Урок 58. 00:03:37
    LRU Cache Setup
  • Урок 59. 00:18:32
    Implementing an LRU Cache
  • Урок 60. 00:03:28
    Wrapping Up