Complete C++ Programming With Data Structures And Algorithms

C++ Programming basics to Arrays, Strings, Pointers, Recursion, OOP's, Linked Lists, Stacks, Queues, Trees, Graphs ,DP

What you'll learn
Learn from the very basics concepts like loops ,Arrays 1D and 2D, Functions to advance topics like pointers, Dynamic Memory Allocations ,Recursion ,Strings
Learn Object Oriented Programmings Concepts with Class Object Inheritance Polymorphism Abstraction and Encapsulation and lots more..
Also Learn Data Structures and Algorithms Concepts like Linked List, Stacks and Queues, Trees, BSTs
Learn Dynamic Programming with Advance Algorithms like Kruskals, Prims and Dijastra's Algorithms in Graphs
Get the access of all typed materials
The best is that all Codes which will be typed from the very beginning to enhance your skills in C++ Programming .
Requirements
C++ Compiler and IDE, Like DevC++, CodeBlocks , Xcode etc.
No previous knowledge is required to take this course, course starts from Basics and goes to Advance level like Data Structures and Algorithms.
No Programming knowledge required.
Anyone who wants to learn C++ can join this course .
Description
So you want to learn C++ Programming from Basics to Advance ??Well this can be the course for you where you will learn from basics of C++ to advance topics to C++ likeArrays, Recursion, Pointers , Object Oriented Programing, Linked Lists, Stacks, Queues, ,Trees, BST's ,Dynamic Programming , Graph etc.The best part is you will Learn Data Structures and Algorithms in C++ in the same course.This Course is made for   people who don't have any knowledge about programming & want to get started with  C++ What I will learn ?Basics - Datatypes and Variables, Operators and Expressions, Conditional Statements, Loops, Pointers, Functions, Function Overloading, Oops Concepts, Classes and Objects, Constructors, Destructors, Operator Overloading, Inheritance, Polymorphism, Abstract Classes, Function Overriding, Static Members, Templates, Linked List, Stacks, Queues, Trees, Binary Trees, Binary Search Trees, Priority Queues, Dynamic Programming, GraphsSo, you've heard a lot about C++, but you don't know how to get started? Then this  course is exactly what you need!This course assumes no previous coding experience . It doesn't matter if you have never written any programs or you have no idea about programming… After this course all of this will change. A major focus is problem-solving skills, algorithms and strong fundamentals. Also, the focus of this course will be to make sure that you have done the substantial amount of coding by the end of it. You'll be exposed from very easy to hard level of questions and ConceptsCourse is designed keeping in mind the requirements of beginners. Course starts with fundamentals of logic building and problem solving..This course will enhance the problem solving skills of the students using C++. Course follow step-by-step approach to make students fall in love with programming and ignite their passion of coding with the help of problems ranging to easy to intermediate to expert level.This course will teach you all the fundamentals you need. With more than 50+ hours of video this comprehensive course leaves no stone unturned!You will learn how to program in C++ in a fast and easy way! .This course will teach you C++ in a practical mannerAs for the curriculum, curriculum is designed to make students proficient in programming .You will learn theory and you will also gain lots of practice. During the course we will write many programs that will make you a great programmer.I believe that when learning coding, it is best that you learn it while typing codes on your computer rather than just listening. This course exactly do thatI have made the course as friendly as possible.

Overview

Section 1: Introduction Section

Lecture 1 C++ Course OverView

Lecture 2 Source Codes (Codes are also provided in each Section based on the Topics)

Lecture 3 Installing Dev C++ (For mac users check the resources)

Lecture 4 Basics Of Programming

Lecture 5 DataTypes

Lecture 6 TakingInput

Lecture 7 Finding_SimpleInterest

Lecture 8 ArithmeticOperators

Lecture 9 Fahrenheit to Celsius Conversion Program

Lecture 10 RelationalOperators

Lecture 11 Logical Operators

Lecture 12 Codes of part 1

Section 2: Conditional Statements

Lecture 13 Conditional Statements

Lecture 14 Finding The Greatest Number Code

Lecture 15 Grading a Student Code

Section 3: While Loop

Lecture 16 While Loop

Lecture 17 Syntax of While Loop

Lecture 18 finding sum of N numbers

Lecture 19 sum of Even Numbers

Lecture 20 Prime Number Code and Pattern Printing Introdution

Lecture 21 Codes of part 2 and part 3

Section 4: Patterns

Lecture 22 Pattern 1

Lecture 23 Pattern 2

Lecture 24 Triangle Pattern

Lecture 25 Increment and Decrement Operators

Section 5: For loop

Lecture 26 For loop Introduction

Lecture 27 Scope of Variables

Lecture 28 Understanding Break and Continue

Lecture 29 Factorial of a given Number

Lecture 30 Reversing a given Number

Lecture 31 Palindrome Number

Lecture 32 Fibonacci Nth Number

Lecture 33 Codes of part 4 and 5

Section 6: Functions

Lecture 34 Functions Introduction and Calculating nCr

Lecture 35 From N given numbers Find Prime Numbers

Lecture 36 How Function Call Works

Lecture 37 Scope in Functions

Lecture 38 Pass By Value In Functions

Lecture 39 Codes of part 6

Section 7: Arrays

Lecture 40 Arrays Introduction

Lecture 41 Finding Max and Min in an Array

Lecture 42 Arrays and Functions 1

Lecture 43 Arrays and Functions 2

Lecture 44 Reversing an Array

Lecture 45 Linear Search

Lecture 46 Finding Duplicates in Array

Section 8: Sorting and Seaching Algorithms

Lecture 47 Binary Search

Lecture 48 Selection Sort

Lecture 49 Bubble Sort Algorithm

Lecture 50 Insertion Sort

Lecture 51 code of part 7 and 8

Section 9: Strings(Character Arrays)

Lecture 52 Length of String

Lecture 53 Reversing a String

Lecture 54 Dry Run for Reversing a String Program

Lecture 55 Replace Characters

Lecture 56 Inbuilt Functions and finding Prefixes of Strings

Section 10: Two Dimensional Arrays

Lecture 57 Two Dimensional Arrays

Lecture 58 Sum and Maximum In Two Dimensional Array

Lecture 59 Sum Of columns

Lecture 60 How are 2D arrays Stored

Lecture 61 Codes of part 9 and 10

Section 11: Pointers Understanding

Lecture 62 Pointers Introduction

Lecture 63 Pointers and Arrays 1

Lecture 64 Pointers and Arrays 2

Lecture 65 Character Array Pointers

Lecture 66 Pointers with Functions

Lecture 67 Double Pointers

Section 12: Dynamic Memory Allocation

Lecture 68 Pass By Reference

Lecture 69 Dynamic Memory Allocation

Lecture 70 Memory Leakage Handling

Lecture 71 Two Dimensional Arrays Dynamically

Lecture 72 Constant Variables

Lecture 73 Codes of part 11 and 12

Section 13: Recursion 1

Lecture 74 Factorial Using Recursion

Lecture 75 PMI in recursion

Lecture 76 Print Numbers in Increasing and Decreasing Order

Lecture 77 Power of a Number

Lecture 78 Fibonacci Using Recursion

Lecture 79 Fibonacci Output Explaination in Recursion

Lecture 80 Sorted Array

Lecture 81 Sorted Array 2

Lecture 82 Sum of array

Lecture 83 Finding Number

Lecture 84 First Index of Duplicate Numbers

Lecture 85 Last Index of Duplicate Numbers

Section 14: Recursion 2

Lecture 86 Length of String using Recursion

Lecture 87 Remove All X

Lecture 88 Inbuilt Strings

Lecture 89 Substring

Lecture 90 Code Of Finding Substring

Lecture 91 Print Substring Without Using Extra Array

Lecture 92 code of part 13 and 14

Section 15: Object Oriented Programming 1

Lecture 93 Introduction to OOPs

Lecture 94 Understanding Functions Use in Classes

Lecture 95 Arrow Operators

Lecture 96 Constructors In classes

Lecture 97 this Keyword

Lecture 98 Addition Subtraction and Multiplication Class Implementation

Lecture 99 More On Constructors

Lecture 100 Play With Constructors

Lecture 101 Fraction Class Implementation

Lecture 102 Fraction Class Implementation 2

Lecture 103 Complex Number Class Implementation

Lecture 104 Complex Numbers Continuation

Section 16: Object Oriented Programming 2

Lecture 105 Shallow Copy and Deep copy

Lecture 106 Handling Shallow Copy and Deep copy In Copy Constructors

Lecture 107 Initialisation List

Lecture 108 Constant Functions

Lecture 109 Static Members in Class

Lecture 110 All OOps Code

Section 17: Operator Overloading

Lecture 111 Operator Overloading 1

Lecture 112 Operator Overloading of PreIncrement Operator

Lecture 113 Operator Overloading of PostIncrement Operator

Lecture 114 Operator Overloading 4

Lecture 115 All OOps Codes

Section 18: Dynamic Array Class Implementation

Lecture 116 Dynamic Array Class Implementation

Lecture 117 All OOps Codes

Section 19: Object Oriented Programming 3 (Inheritance)

Lecture 118 Encapsulation and Abstractions

Lecture 119 Inheritance in OOPS

Lecture 120 AccessModifiers in Inheritance

Lecture 121 Constructors and Destructors in Inheritance

Lecture 122 Types of Inheritances

Lecture 123 Hybrid Inheritance

Lecture 124 Polymorphism in OOPs -Compile Time

Lecture 125 Polymorphism in OOPs -Run Time

Lecture 126 Virtual Functions and Abstract Classes

Lecture 127 All OOps Codes

Section 20: Time Complexity and Big O Notation

Lecture 128 Big O Notation

Lecture 129 Bubble Sort Time Complexity

Lecture 130 Selection Sort Time Complexity

Lecture 131 Insertion Sort Time Complexity

Section 21: LinkedList(LL)

Lecture 132 Introduction

Lecture 133 LinkedList Basics

Lecture 134 Taking input and print Linked List

Lecture 135 Take input better and Length of Linked List

Lecture 136 Difference between take Input and take Input Better

Lecture 137 Insert_Element_anyPosition

Lecture 138 Delete Explanation in Linked List

Lecture 139 Delete from any Position Code

Lecture 140 Duplicates removal in Linked List

Lecture 141 Find data in Linked List

Lecture 142 Midpoint_LL

Lecture 143 Merge Sorted Linked Lists

Lecture 144 code of part 21

Section 22: Stacks and Templates

Lecture 145 Introduction

Lecture 146 Template Understanding Code

Lecture 147 Template Understanding Code Part 2

Lecture 148 Stack using Array Code Part 1

Lecture 149 Stack using Array Code Part 2

Lecture 150 Stack Double Function Code

Lecture 151 Stack using Linked List Introduction

Lecture 152 Stack using Linked List Code

Lecture 153 Inbuilt Stack Code

Lecture 154 code of part 22

Section 23: Queues

Lecture 155 Introduction and Implementation Understanding

Lecture 156 Queue using Array Code

Lecture 157 Queue_using_array_Double_Property

Lecture 158 Queue_using_LinkedList_Part1

Lecture 159 Queue_using_LinkedList_Part2

Lecture 160 Inbuilt_queue_CODE

Lecture 161 code of part 23

Section 24: Trees and Vectors

Lecture 162 Trees Introduction

Lecture 163 Vectors_Code

Lecture 164 InputTree Implementation Code

Lecture 165 PrintTree

Lecture 166 LevelWiseInputTree

Lecture 167 Level Wise PrintTree

Lecture 168 FindingNodesTrees

Lecture 169 Sum of Nodes in Trees

Lecture 170 Max value in a Tree

Lecture 171 Leaf Nodes in Trees

Lecture 172 differenceHeight_Level_Depth_tree

Lecture 173 Height of a Tree

Lecture 174 Print At Depth K

Lecture 175 Print At Depth K Extension

Lecture 176 code of part 24

Section 25: BinaryTree and Binary Search Tree

Lecture 177 Introduction Binary Tree

Lecture 178 BinaryTree Taking Input and Printing part 1

Lecture 179 Binary Tree Taking Input and Printing 2

Lecture 180 TakingInput LevelWise in Binary Tree

Lecture 181 Print LevelWise

Lecture 182 Number of Nodes in Binary Trees

Lecture 183 Finding Node in Binary Tree

Lecture 184 Binary Tree Traversal

Lecture 185 Height Binary Tree

Lecture 186 PreOrder Traversal

Lecture 187 Inorder Traversal

Lecture 188 Post Order Traversal

Lecture 189 Finding Diameter in Binary Tree

Lecture 190 Diameter Better

Lecture 191 Diameter Better Extension

Lecture 192 Binary Search Tree Introduction

Lecture 193 Searching In Binary Search Tree

Lecture 194 Is BST Program

Lecture 195 code of part 25

Section 26: Priority Queue

Lecture 196 PriorityQueue Introduction

Lecture 197 Heap Order Property

Lecture 198 PriorityQueue Code 1

Lecture 199 Insert Function Implementation

Lecture 200 Remove Minimum Function

Lecture 201 Remove Min Continuation

Lecture 202 Inplace Heap Sort

Lecture 203 Inbuilt Priority Queue

Lecture 204 code of part 26

Section 27: Dynamic Programming 1

Lecture 205 Introduction and Fibonacci Recursive and Memoization Code

Lecture 206 Fibonacci_DynamicProgramming-Code

Lecture 207 MinStepsTo1_RecursiveCODE

Lecture 208 MinStepsTo1_MemoizationCODE

Lecture 209 MinStepsTo1_DynamicProgrammingCODE

Section 28: Dynamic Programming2

Lecture 210 MinCostPath_recursive

Lecture 211 MinCostPath_recursive_EXPLAINATION_DRYRUN

Lecture 212 MinCostPath_Memoization

Lecture 213 MinCostPath_DP

Lecture 214 Longest Common Subsequence(LCS)_recursive

Lecture 215 Longest Common Subsequence(LCS)_Memoization

Lecture 216 Longest Common Subsequence(LCS)_DP

Lecture 217 EditDistance_Recursive

Lecture 218 EditDistance_Memoization

Lecture 219 EditDistance_DP

Lecture 220 0/1KnapSack_recursive

Lecture 221 0/1knapsack_memoizarion_DP

Lecture 222 code of part 27 and 28

Section 29: Graphs and Graphs Algorithms Implementation

Lecture 223 Introduction to graphs

Lecture 224 Graph Implementation

Lecture 225 Introduction to DFS and BFS

Lecture 226 CODE of Depth First Search

Lecture 227 Important Part of Depth First Search

Lecture 228 CODE of Breadth First Search

Lecture 229 Finding Path in a Graph

Lecture 230 Directed Graphs and Weighted Graphs

Lecture 231 Spanning Trees and MST Introduction

Lecture 232 Kruskals Introductions

Lecture 233 Cycle Detection used in Kruskals

Lecture 234 Kruskals Algorithm

Lecture 235 Prims Explaination

Lecture 236 Prims Code

Lecture 237 Prims Output

Lecture 238 Dijastra Algorithm

Lecture 239 Dijastra Algorithm Code

Lecture 240 Dijastra Algorithm Code Output

Lecture 241 code of part 29

Beginners - (Concepts are Covered from Basics to Advance) who are willing to learn C++,Anyone who want enhance C++skills by learning the basics of Object Oriented Programming (OOPS),ANYONE who wants to be a master in C++ Programming Language.