Lesson List

Online Classroom (JOIN NOW)

Facebook Group Link

Live Sessions

DSA

1. DSA Introduction00:02:12
2. Types of data structure00:03:33
3. Time complexity part 100:08:27
4. Time complexity calculation00:04:40
5. Difference between good & bad time complexities00:07:07
6. Space complexity00:03:29
7. Array00:06:41
8. Searching techniques00:09:11
9. Linear Search00:04:53
10. Binary Search00:19:09
11. Bubble Sort00:06:05
12. Selection sort00:05:22
13. Counting sort00:08:11
14. Two Pointer Algorithm00:07:14
15. Linked List Intro00:05:51
16. What is node and appending nodes in linked list00:06:07
17. Traversing Linked List00:06:39
18. Use Case of linked list00:00:52
19. stack00:06:58
20. Queue00:04:50
21. Deque00:01:33
22. Hash Table part-100:05:27
23. hash table part 200:07:43
24. What is recursion00:08:59
25. When do we need recursion00:06:01
26. merge sort part-100:07:10
27. merge sort part-200:04:17
28. Quick sort00:09:07
29. memorization00:05:25
30. dynamic programming00:08:07
31. greedy algorithm00:06:29
32. Greedy00:02:45
33. Binary tree introduction00:10:56
34. BST00:07:00
35. Inorder Traversal00:06:24
36. Graph algorithm introduction00:05:32
37. Graph Traversal00:07:03
38. Connected components00:05:54
39. Cycle detection in undirected graph00:04:55
40. Bipartite Graph00:09:32

JavaScript (Optional)

Go to Course Home
3. Time complexity part 1
← Previous Next →
[]
Phone

Phone

Need Help?
Hide