Data Structures Algorithms Essentials using C++

Data Structures & Algorithms Essentials using C++, available at $94.99, has an average rating of 4.4, with 252 lectures, 97 quizzes, based on 3459 reviews, and has 19558 subscribers.

You will learn about Core concepts & internals of Data Structures Trees, Linked Lists, Heaps, Graphs Build all data structures from scratch Object Oriented Programming Basics Brute Force & Optimisation Techniques Space Time Complexity Analysis Hash Functions, Collision Handling Recursion & Backtracking Dynamic Memory & Pointers Create your own DS library! C++ Standard Template Library Basics Project – Design & Implement Shopping Cart This course is ideal for individuals who are Beginner level programmers or Students who want to learn data structures or Students from Computer Science & related branches or Working professionals who want to brush up internals of hashmaps, heaps, graphs etc It is particularly useful for Beginner level programmers or Students who want to learn data structures or Students from Computer Science & related branches or Working professionals who want to brush up internals of hashmaps, heaps, graphs etc.

Enroll now: Data Structures & Algorithms Essentials using C++

Summary

Title: Data Structures & Algorithms Essentials using C++

Price: $94.99

Average Rating: 4.4

Number of Lectures: 252

Number of Quizzes: 97

Number of Published Lectures: 248

Number of Published Quizzes: 97

Number of Curriculum Items: 349

Number of Published Curriculum Objects: 345

Original Price: 鈧?,900

Quality Status: approved

Status: Live

What You Will Learn

Core concepts & internals of Data Structures

Trees, Linked Lists, Heaps, Graphs

Build all data structures from scratch

Object Oriented Programming Basics

Brute Force & Optimisation Techniques

Space Time Complexity Analysis

Hash Functions, Collision Handling

Recursion & Backtracking

Dynamic Memory & Pointers

Create your own DS library!

C++ Standard Template Library Basics

Project – Design & Implement Shopping Cart

Who Should Attend

Beginner level programmers

Students who want to learn data structures

Students from Computer Science & related branches

Working professionals who want to brush up internals of hashmaps, heaps, graphs etc

Target Audiences

Beginner level programmers

Students who want to learn data structures

Students from Computer Science & related branches

Working professionals who want to brush up internals of hashmaps, heaps, graphs etc

Are you a beginner looking to enter the world of Data Structures or intermediate programmer wondering what happens behind a Hash-table?

Welcome to Data Structures & Algorithms, Essentials Course – the only course you need to understand the core concepts behind Data Structures & build a solid programming foundations using C++ . The course is taught by an expert instructor Prateek Narang from Google, who is not just a software engineer but also has mentored thousands of students in becoming great programmers & developers and is top rated on Udemy for his amazing teaching skills.

Every software application revolves around data, performing different operations like Insert, Delete, Update & Search. To be a great software developer, understanding of Data Structures & Algorithms is must and this course provides you a deep understanding of the topic by covering both the theory and hands-on-implementation of each data structure from scratch.

The Course contains 20+ hours of interactive video content & dozens of coding exercises, teaching you all essential concepts starting from ground zero. Each section covers data structure in great detail, with Coding Exercises & real life examples. Here is what you will learn –

Programming Concepts
Bit masking

Object Oriented Programming Basics

Pointers & Dynamic Memory (C++)

Recursion

Data Structures Foundation

Array, 2D Array, Strings, Vectors

Linked Lists, Stacks, Queues

Trees, BST, Tries

Heaps/Priority Queues

Hash-tables, Collision Handling

Graphs

Algorithms Foundation

Brute Force, Backtracking

Sorting & Searching

Divide & Conquer

Dynamic Programming

The course is designed for beginner & intermediate programmers. We try to make not so easy topics look easy with intuitive explanations & interactive video lectures with dozens of memes 馃槈 The course finishes with a final mini project – a command line app for an online shopping cart combining principles from Object Oriented Programming & Data Structures.

Unlike most instructors, we are not a salesperson or a marketer. My job is to help you build strong fundamentals in programming & be a successful developer. Through Udemy & Coding Minutes, I am providing this course to you at a fraction of cost of its original cost, so that anyone who is interested to learn can take their skills to the next level. So I hope you sign up today, and I will see you in the course.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Course Orientation!

Lecture 2: Get maximum out of this course?

Chapter 2: Code Repository

Lecture 1: C++ Code Repository

Lecture 2: Java Code Repository

Lecture 3: Exercise Solutions

Chapter 3: Arrays

Lecture 1: Array Introduction

Lecture 2: Arrays – Input, Ouput, Update

Lecture 3: Arrays & Functions – Pass by Reference

Lecture 4: A Note about Space Time Complexity!

Lecture 5: Linear Search

Lecture 6: Binary Search

Lecture 7: Binary Search Code

Lecture 8: Array Reverse

Lecture 9: Printing Pairs

Lecture 10: Printing Subarrays

Lecture 11: Subarray Sum – I (Brute Force)

Lecture 12: Subarray Sum – II (Prefix Sums)

Lecture 13: Subarray Sum – III (Kadanes Algorithm)

Lecture 14: A Note about Coding Exercises!

Lecture 15: Vectors Introduction

Lecture 16: Vectors (Demo)

Lecture 17: Solution – Largest Element

Lecture 18: Solution – Maximum Subarray Sum

Lecture 19: Solution – Lower Bound

Lecture 20: Solution – Sorted Pair Sum

Lecture 21: Solution – K Rotate

Lecture 22: Solution – K-Rotate Optimised (InPlace)

Chapter 4: Basic Sorting Algorithms

Lecture 1: Sorting Introduction

Lecture 2: Bubble Sort

Lecture 3: Bubble Sort Code

Lecture 4: Insertion Sort

Lecture 5: Insertion Sort Code

Lecture 6: Selection Sort

Lecture 7: Selection Sort Code

Lecture 8: Inbuilt Sort & Comparators

Lecture 9: Counting Sort

Lecture 10: Counting Sort Code

Chapter 5: Character Arrays/Strings

Lecture 1: Character Arrays Introduction

Lecture 2: Using cin.get()

Lecture 3: Digits & Spaces

Lecture 4: Using cin.getline()

Lecture 5: Shortest Path

Lecture 6: String Copy, Compare, Concat!

Lecture 7: Solution : Largest String

Lecture 8: Note : String Class

Lecture 9: String Class

Lecture 10: Run Length Encoding

Chapter 6: 2D Arrays

Lecture 1: Introduction to 2D Arrays

Lecture 2: 2D Array Basics

Lecture 3: 2D Character Arrays

Lecture 4: Spiral Print

Lecture 5: Sorted Array Search Code

Lecture 6: Mango Trees

Lecture 7: Sorted Array Search

Chapter 7: Pointers & Dynamic Memory

Lecture 1: Address of Operator

Lecture 2: Pointers

Lecture 3: Dereference Operator

Lecture 4: Reference Variables

Lecture 5: Pass by Reference – Reference Variable

Lecture 6: Pass by Reference – Pointers

Lecture 7: Dynamic Memory Allocation

Lecture 8: Using New & Delete

Lecture 9: 2D Dynamic Array

Chapter 8: Vector Data Structure

Lecture 1: Vector

Lecture 2: Vectors – How they grow?

Lecture 3: Using Vector Container

Lecture 4: 2D Vector using STL

Lecture 5: Vector Class – I

Instructors

Prateek Narang
Instructor & Entrepreneur – Google, Coding Minutes, Scaler

Coding Minutes
Pocket friendly way to learn with experts!

Rating Distribution

1 stars: 46 votes

2 stars: 52 votes

3 stars: 291 votes

4 stars: 1149 votes

5 stars: 1921 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!