Lesson List
DSA
1. DSA Introduction
00:02:12
2. Types of data structure
00:03:33
3. Time complexity part 1
00:08:27
4. Time complexity calculation
00:04:40
5. Difference between good & bad time complexities
00:07:07
6. Space complexity
00:03:29
7. Array
00:06:41
8. Searching techniques
00:09:11
9. Linear Search
00:04:53
10. Binary Search
00:19:09
11. Bubble Sort
00:06:05
12. Selection sort
00:05:22
13. Counting sort
00:08:11
14. Two Pointer Algorithm
00:07:14
15. Linked List Intro
00:05:51
16. What is node and appending nodes in linked list
00:06:07
17. Traversing Linked List
00:06:39
18. Use Case of linked list
00:00:52
19. stack
00:06:58
20. Queue
00:04:50
21. Deque
00:01:33
22. Hash Table part-1
00:05:27
23. hash table part 2
00:07:43
24. What is recursion
00:08:59
25. When do we need recursion
00:06:01
26. merge sort part-1
00:07:10
27. merge sort part-2
00:04:17
28. Quick sort
00:09:07
29. memorization
00:05:25
30. dynamic programming
00:08:07
31. greedy algorithm
00:06:29
32. Greedy
00:02:45
33. Binary tree introduction
00:10:56
34. BST
00:07:00
35. Inorder Traversal
00:06:24
36. Graph algorithm introduction
00:05:32
37. Graph Traversal
00:07:03
38. Connected components
00:05:54
39. Cycle detection in undirected graph
00:04:55
40. Bipartite Graph
00:09:32
Recorded (New)
01. Binary Search Problem
01:43:22
02. Two Sum
01:08:04
03. Linked List CRUD
01:04:28
04. Stack, Queue and Deque
00:49:36
05. Hash Table
00:58:19
06. Merge Sort
00:51:19
07. BST Problem Solving Day 2
00:48:14
08. DFS and Cycle Detection in a Graph
00:57:34
09. Greedy Algorithm
00:36:19
10. Dynamic Programming
00:48:21
Zoom Live Link
Bookmark This Following Link
00:00:00
Live Sessions (Batch-02)
01. Orientation Class
01:06:53
02. Linear Search
01:42:34
03. Binary Search
01:38:40
04. Bubble Sort and Selection Sort
01:07:16
05. Complexity Analysis
01:40:45
06. Space Complexity and Two Pointer Algorithm
01:27:39
07. Linked List Day 01
01:28:53
08. Types of Linked List
00:59:54
09. Linked List Problem Solving
01:30:56
10. Stack Queue Problem Solving
01:30:25
11. Hash Map
01:05:51
12. Recursion Part 01
00:49:42
13. Recursion Part 02
00:35:06
14. Quick Sort
00:49:10
15. Binary Tree
01:00:12
16. Tree Traversing – BFS & DFS
01:31:42
17. Binary Tree Problem Solving
01:01:40
18. Graph Creation
01:02:59
19. Graph Traversal BFS
00:50:38
20. Shortest path algorithm & Bipartite Graph
00:58:04
21. Tropological Sorting
00:50:54
Live Sessions (Batch-01)
Orientation Class
02:10:54
01. Linear Search & Binary Search – 18/11/22
02:11:20
02. Binary Search Problem Solving (Day 1)
01:31:24
03. Binary Search Problem Solving (Day 2)
01:47:31
04. Complexity Analysis
01:50:49
05. Two Pointer Algorithm (Day 1)
01:28:36
06. Two Pointer Algorithm (Day 2)
01:48:28
07. Linked List Day 01
01:17:10
08. Linked List Day 02
01:31:51
09. Types of Linked List
01:00:05
10. Problem Solving – Linked List
01:34:57
11. Stack and Queue Day 01
00:58:01
12. Stack and Queue – Problem Solving
01:43:43
13. Hash Table Day 01
01:09:17
14. Hash Table Day 02
01:41:14
15. Sorting Day 01
01:13:54
16. Recursion Day 01
00:45:15
17. Recursion Day 2
01:10:26
18. Merge Sort
01:34:11
19. Quick Sort
01:32:14
20. Binary Tree Day – 01
00:46:42
21. Binary Tree Day – 02
01:32:22
22. Binary Search Day – 03
01:11:46
23. Binary Search Day – 04
01:45:59
24. Graph Introduction
01:11:03
25. Graph Traversal
01:50:02
26. Cycle Detection
01:06:29
JavaScript (Optional)
1. Who is this Course For
00:03:10
2. How To Follow This Course
00:07:48
3. Environment Setup
00:04:48
4. Hello World – First Program
00:06:25
5. Variables in JavaScript
00:17:49
6. Naming Conversion
00:05:25
7. Comments
00:05:3
8. Connecting to HTML
00:07:29
9. What is Data Types
00:08:48
10. Primitive Data Types
00:12:42
11. typeof Operator
00:08:02
12. Type Conversion
00:17:13
13. Number and Math Methods
00:29:26
14. String Methods
00:25:28
15. What is Array
00:06:02
16. Array Traversing
00:11:11
17. Array Manipulation
00:15:17
18. Multidimensional Array
00:05:50
19. Arithmetic Operator
00:08:43
20. Comparison Operator
00:12:14
21. Logical Operator
00:09:48
22. Assignment Operator
00:06:56
23. Ternary Operator
00:03:11
24. Understanding Control Structure
00:03:14
25. If Statements
00:04:00
26. If Else Statements
00:01:57
27. If Else Statements
00:03:46
28. Switch Statements
00:09:19
29. What is Loops
00:05:53
30. For Loops
00:13:27
31. While Loops
00:07:46
32. Do While Loops
00:03:24
33. Nested Loops
00:05:09
34. For of Loops
00:02:39
35. What is Function
00:03:30
36. Declare and Invoke
00:07:19
37. Parameter vs Arguments
00:04:14
38. return Keyword
00:04:01
39. Function Expression
00:03:16
40. Intro to Object Literal
00:11:13
41. Property and Methods
00:09:37
42. Delete a Property
00:03:22
43. Comparing Object
00:02:56
44. Iteration Through Properties
00:04:51
45. What is DOM
00:04:24
46. DOM Selection
00:11:11
47. DOM Manipulation
00:22:29
48. Events
00:12:34
49. Intro to Problem Solving
00:12:03
50. Problem Solving with JavaScript
00:14:03
Facebook Group Link
Facebook Group
00:00:00
Go to Course Home
3. Time complexity part 1
← Previous
Next →
Login
Remember Me
Forgot Password?
Login
Sign Up
Remember me
Forgot Password?
Sign In
I accept the
Terms of Service and Privacy Policy
Sign Up
Lost your password? Please enter your username or email address. You will receive a link to create a new password via email.
Email Reset Link
[]
Insert/edit link
Close
Enter the destination URL
URL
Link Text
Open link in a new tab
Or link to existing content
Search
No search term specified. Showing recent items.
Search or use up and down arrow keys to select an item.
Cancel