This course was created with the
course builder. Create your online course today.
Start now
Create your course
with
Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Algorithms & Data Structures 1/3:Greedy,DFS,BFS,Tree,Heap
Orientation
Orientation (0:31)
Algorithm, Array, Search, Greedy Algorithm, Sort
Intro, Learning objectives (0:26)
Algorithm (7:33)
Array (2:08)
Exhuastive Search (3:32)
Greedy Algorithm (5:25)
Sort (6:50)
Summary (0:25)
Subset, Search, Sort
Intro, Learning objectives (0:22)
Two-dimensional Array (2:52)
Subset (5:17)
Search (7:36)
Sort (3:10)
Summary (0:54)
String, Pattern matching and Application
Intro, Learning objectives (0:27)
String (12:15)
Pattern matching (7:57)
Summary (1:00)
Stack, Memoization, DP, DFS
Intro, Learning objectives (0:32)
Concept of stack data structure (5:24)
Application of stack (6:25)
Memoization (1:58)
DP(Dynamic Programming) (2:00)
DFS(Depth First Search) (8:03)
Summary (0:55)
Back-Tracking, Divide and Conquer
Intro, Learning objectives (0:23)
Calculator (9:56)
Back-tracking (8:30)
Divide and conquer (7:28)
Summary (0:37)
Queues Data Structure and BFS(Breadth First Search) Algorithm
Intro, Learning objectives (0:29)
Concept of Queue data structure (3:26)
Type of queue (13:54)
Application of queue (2:50)
BFS(Breadth First Search) (2:48)
Summary (2:11)
List, Insertion sort, Merge sort, Application of List
Intro, Learning objectives (0:36)
List (11:11)
Insertion Sort (3:06)
Merge Sort (2:09)
Application of List (2:47)
Summary (1:33)
Binary Tree, Expression Tree, Binary Search Tree, Heap
Intro, Learning objectives (0:29)
Understanding and expression of Tree (4:20)
Binary Tree (10:12)
Expression Tree (0:58)
Binary Search Tree (4:30)
Heap (3:29)
Summary (1:29)
Divide and conquer
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock