Data Structure & Algorithm Using c++

About Course

Advance your software engineering career by learning algorithms through programming and advanced problem solving. Apply the newly learnt algorithmic techniques to real life problems.

➣ Lifetime Access with Dynamically Updated Content.
➣ Crack Internal Coding Test and Get 100% Referral Guarantee.
➣ Weekly Doubt Clearing Classes.
➣ 100+ Leetcode video solutions with explanations.
➣ Offered by ACM ICPC winners and MAANG engineers.
➣ Student community, Github code review, Interview preparations.

Course Content

1. Time Complexity
DSA Offering Lifetime Access with Updates. Weekly Doubt Clearing Classes 100+ Leetcode video solutions with explanations Offered by ACM ICPC winners and FANG engineers Student community, Github code review, Interview preparations.

1 – Time Complexity

06:48
2 – Big O Notation

10:06
3 – Binary Search and its Recurrence Relation

19:16
4 – Question on Time Complexity I

04:16
5 – Master’s Theorem

10:24
6 – Big O Complexity Comparison

04:37
7 – Question on Time Complexity II

20:27
8 – Occurrence of an integer

04:25
10 – Find Minimum path

16:06
11 – Find Minimum path – Optimization

12:59
12 – Time Complexity Notations

15:49
13 – Examples and Questions

07:09
14 – Key Takeaways

03:09
15 – Recap

03:06
Time Complexity.pdf
Quiz

2. Array

1 – Find the missing and the repeated number in the array

35:30
2 – Find the missing and the repeated number in the array

36:13
2 – 2 Sum problem

19:49
3 – 2 Sum problem

19:49
4 – 3 Sum problem

12:25
5 – Majority Element in the Array

29:35
6 – Recap

02:21
Array.pdf
Array Quiz

3. Linked list

1 – Why do we use Linked List

14:44
2 – What are Linked Lists

06:25
3 – How to create a Linked List

25:57
4 – Deleting a node in a Linked List

16:32
5 – Finding Mid-point of a Linked List

10:36
6 – Detecting Cycle in a Linked List

08:51
7 – Removing Cycle in a Linked List

18:24
8 – Reversing a Linked List

05:21
9 – Big Integer Problem

58:45
10 – Add two big numbers

53:39
11 – Introduction to Doubly Linked List

04:38
12 – Insertion and deletion in Doubly Linked List

11:39
13 – Comparison between Singly Linked List and Doubly Linked List

04:06
Linked List.pdf
Quiz

4. Stack

5. Queue

6 Dictionary and Sets STL

7. Sorting

1 – Merge Sort

30:43
2 – Quick Sort

33:04
3 – Comparison between Merge Sort, Quick Sort and STL

09:16
4 – Count Sort

16:57
5 – Bucket Sort

08:24
6 – Radix Sort

16:54
7 – Comparison between Count Sort and Bucket Sort

02:47
8 – Problem Count Inversions 1

25:19
9 – Discussion Sort a linked list

01:16
10 – Problem Count Inversions 1 Code Discussion

04:11
11 – Problem Sort a linked list

14:20
12 – Problem Nut and Bolt Problem

08:56
Sorting.pdf
Quiz

8. Binary Trees

1 – Introduction to Trees

21:06
2 – Traversal in Binary Trees (Inorder, Preorder, Postorder)

28:01
3 – Level Order Traversal of Binary Trees

10:18
4 – Spiral Order Traversal of Binary Trees

09:34
5 – Views of a Binary Tree (Left, Right)

16:13
6 – Top Bottom View of a Binary Search Tree

21:25
7 – Problem Binary Tree Right Side View

33:23
8 – Problem Validate Binary Search Tree

35:57
9 – Problem Diameter of a Binary Tree

29:10
10 – Post Session Discussion

05:16
11 – Diameter of a Binary Tree

05:07
Binary Trees.pdf
Quiz

9. Binary Search Tree

10. Heap

11. Graph

1 – Introduction to Graphs

05:21
2 – Representation of Graphs

42:14
3 – Types of Graphs

09:07
4 – Depth First Search Traversal of Graphs

32:57
5 – Breadth First Search Traversal of Graphs

09:42
6 – Comparison between DFS and BFS

03:57
7 – Directed Graph – Cyclic and Acyclic

03:20
8 – Cycles and their Detection

41:37
9 – Topological Sorting

40:59
10 – Shortest Paths – Single Source

36:33
Graphs.pdf
Quiz

12. Dynamic Programming

1 – Sum of array elements

11:55
2 – Rod Cutting Problem

29:03
3 – Coin Change Problem

18:35
4 – Subset Sum Problem

25:19
5 – Knapsack Problem

32:49
6 – Coin Game

47:45
7 – Edit Distance

26:28
8 – Bursting Balloons

21:43
10 – Longest Common Subsequence

16:25
Dynamic Programming.pdf
Quiz

About Course

Course Content

1. Time Complexity DSA Offering Lifetime Access with Updates. Weekly Doubt Clearing Classes 100+ Leetcode video solutions with explanations Offered by ACM ICPC winners and FANG engineers Student community, Github code review, Interview preparations.

1 – Time Complexity

2 – Big O Notation

3 – Binary Search and its Recurrence Relation

4 – Question on Time Complexity I

5 – Master’s Theorem

6 – Big O Complexity Comparison

7 – Question on Time Complexity II

8 – Occurrence of an integer

10 – Find Minimum path

11 – Find Minimum path – Optimization

12 – Time Complexity Notations

13 – Examples and Questions

14 – Key Takeaways

15 – Recap

Time Complexity.pdf

Quiz

2. Array

1 – Find the missing and the repeated number in the array

2 – Find the missing and the repeated number in the array

2 – 2 Sum problem

3 – 2 Sum problem

4 – 3 Sum problem

5 – Majority Element in the Array

6 – Recap

Array.pdf

Array Quiz

3. Linked list

1 – Why do we use Linked List

2 – What are Linked Lists

3 – How to create a Linked List

4 – Deleting a node in a Linked List

5 – Finding Mid-point of a Linked List

6 – Detecting Cycle in a Linked List

7 – Removing Cycle in a Linked List

8 – Reversing a Linked List

9 – Big Integer Problem

10 – Add two big numbers

11 – Introduction to Doubly Linked List

12 – Insertion and deletion in Doubly Linked List

13 – Comparison between Singly Linked List and Doubly Linked List

Linked List.pdf

Quiz

4. Stack

1 Introduction to Stacks

2 Question on Stacks using STL C++

3 Postfix Expression Evaluation

4 Infix to Postfix Evaluation

5 Next Greater Element

Stacks.pdf

Stack Quiz

5. Queue

1 Introduction to queues

2- Sliding Window Question

Queues.pdf

Queue Quiz

6 Dictionary and Sets STL

1- Introduction to Dictionary Set

2- Basics of Dictionary & Sets.pdf

Quiz

7. Sorting

1 – Merge Sort

2 – Quick Sort

3 – Comparison between Merge Sort, Quick Sort and STL

4 – Count Sort

5 – Bucket Sort

6 – Radix Sort

7 – Comparison between Count Sort and Bucket Sort

8 – Problem Count Inversions 1

9 – Discussion Sort a linked list

10 – Problem Count Inversions 1 Code Discussion

11 – Problem Sort a linked list

12 – Problem Nut and Bolt Problem

Sorting.pdf

Quiz

8. Binary Trees

1 – Introduction to Trees

2 – Traversal in Binary Trees (Inorder, Preorder, Postorder)

1. Time Complexity
DSA Offering Lifetime Access with Updates. Weekly Doubt Clearing Classes 100+ Leetcode video solutions with explanations Offered by ACM ICPC winners and FANG engineers Student community, Github code review, Interview preparations.