Algorithms and Data Structures in C++

Algorithms and Data Structures in C++, available at $84.99, has an average rating of 4.45, with 159 lectures, based on 10 reviews, and has 846 subscribers.

You will learn about Algorithmic thinking and concept building 7 HARD, 48 MEDIUM, 20 EASY problems Logical components of data structures and algorithms Array, Matrix, Interval, String, Bits, Linked List, Graph, Tree, Heap and DP Tackle difficult coding interviews Improve yourself to be a stronger developer Plenty of workout problems from Leetcode This course is ideal for individuals who are For students to bootstrap data structures and algorithms. or For programmers to comprehend data structures and algorithms. or For candidates to excel at programming interviews. It is particularly useful for For students to bootstrap data structures and algorithms. or For programmers to comprehend data structures and algorithms. or For candidates to excel at programming interviews.

Enroll now: Algorithms and Data Structures in C++

Summary

Title: Algorithms and Data Structures in C++

Price: $84.99

Average Rating: 4.45

Number of Lectures: 159

Number of Published Lectures: 159

Number of Curriculum Items: 159

Number of Published Curriculum Objects: 159

Original Price: $54.99

Quality Status: approved

Status: Live

What You Will Learn

Algorithmic thinking and concept building
7 HARD, 48 MEDIUM, 20 EASY problems
Logical components of data structures and algorithms
Array, Matrix, Interval, String, Bits, Linked List, Graph, Tree, Heap and DP
Tackle difficult coding interviews
Improve yourself to be a stronger developer
Plenty of workout problems from Leetcode

Who Should Attend

For students to bootstrap data structures and algorithms.
For programmers to comprehend data structures and algorithms.
For candidates to excel at programming interviews.

Target Audiences

For students to bootstrap data structures and algorithms.
For programmers to comprehend data structures and algorithms.
For candidates to excel at programming interviews.

Are you aspiring to master algorithms and data structures? stuck at how to filter best problems with curated logical set?

Welcome to “Algorithms and Data Structures in C++” course. This course will guide you to build logical constructs of programming, algorithms and data structures using C++, an ultimate blend of most curated list of logics from algorithms and data structures.

The Blind-75 is a set of problems from Leetcode, chosen by a Meta engineer in 2018 and it became famous as a great tool to bootstrap algorithms and data structures.

Lectures at this course are framed to reinforce logics around algorithms and data structures. Each problem starts with discussions, transcending to optimized solutions with hands-on-coding with C++.

Here is what you will learn –

Data Structures Covered (in C++)

Structures with list form: Array, Matrix, Interval, String & Bits

Structures formed by links & nodes: Linked List, Tree, Heap & Graph

AND Dynamic Programming

Problem Types

1. Traversal, Transformation and Searching

2. Gauging, Counting and Verification

3. Linking, Optimization and Path selection

4. Interval merging and Insertions.

Links to problems are given at resources section.

Source code (C++) for each lecture is available for you to download.

Enjoy the trajectory of course, have a nice time ahead.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Onboarding Problems (C++ STL Foundation), Part 1/4

Lecture 2: Onboarding Problems (C++ STL Foundation), Part 2/4

Lecture 3: Onboarding Problems (C++ STL Foundation), Part 3/4

Lecture 4: Onboarding Problems (C++ STL Foundation), Part 4/4

Lecture 5: Concepts

Lecture 6: Note

Chapter 2: Bit Manipulation

Lecture 1: Number of 1 Bits

Lecture 2: Check Point #01

Lecture 3: Note

Lecture 4: Missing Number

Lecture 5: Check Point #02

Lecture 6: Counting Bits

Lecture 7: Check Point #03

Lecture 8: Reverse Bits

Lecture 9: Check Point #04

Lecture 10: Sum of Two Integers

Lecture 11: Check Point #05

Chapter 3: Arrays

Lecture 1: Two Sum

Lecture 2: Check Point #06

Lecture 3: Best Time to Buy and Sell Stocks

Lecture 4: Check Point #07

Lecture 5: Contains Duplicate

Lecture 6: Check Point #08

Lecture 7: Product of Array Except Self

Lecture 8: Check Point #09

Lecture 9: Maximum Subarray

Lecture 10: Check Point #10

Lecture 11: Maximum Product Subarray

Lecture 12: Check Point #11

Lecture 13: Find Minimum in Rotated Sorted Array

Lecture 14: Check Point #12

Lecture 15: Search in Rotated Sorted Array

Lecture 16: Check Point #13

Lecture 17: 3Sum

Lecture 18: Check Point #14

Lecture 19: Container With Most Water

Lecture 20: Check Point #15

Chapter 4: Graph Theory

Lecture 1: Clone Graph

Lecture 2: Check Point #16

Lecture 3: Course Schedule

Lecture 4: Check Point #17

Lecture 5: Pacific Atlantic Water Flow

Lecture 6: Check Point #18

Lecture 7: Number of Islands

Lecture 8: Check Point #19

Lecture 9: Longest Consecutive Sequence

Lecture 10: Check Point #20

Lecture 11: Alien Dictionary

Lecture 12: Check Point #21

Lecture 13: Graph Valid Tree

Lecture 14: Check Point #22

Lecture 15: Number of Connected Components in an Undirected Graph

Lecture 16: Check Point #23

Chapter 5: Intervals

Lecture 1: Insert Interval

Lecture 2: Check Point #24

Lecture 3: Merge Intervals

Lecture 4: Check Point #25

Lecture 5: Non-overlapping Intervals

Lecture 6: Check Point #26

Lecture 7: Meeting Rooms

Lecture 8: Check Point #27

Lecture 9: Meeting Rooms II

Lecture 10: Check Point #28

Chapter 6: Linked List

Lecture 1: Reverse a Linked List

Lecture 2: Check Point #29

Lecture 3: Detect Cycle in a Linked List

Lecture 4: Check Point #30

Lecture 5: Merge Two Sorted Lists

Lecture 6: Check Point #31

Lecture 7: Merge K Sorted Lists

Lecture 8: Check Point #32

Lecture 9: Remove Nth Node From End Of List

Lecture 10: Check Point #33

Lecture 11: Reorder List

Lecture 12: Check Point #34

Chapter 7: Matrix

Lecture 1: Set Matrix Zeroes

Lecture 2: Check Point #35

Lecture 3: Spiral Matrix

Lecture 4: Check Point #36

Lecture 5: Rotate Image

Lecture 6: Check Point #37

Lecture 7: Word Search

Lecture 8: Check Point #38

Chapter 8: Strings

Lecture 1: Longest Substring Without Repeating Characters

Lecture 2: Check Point #39

Lecture 3: Longest Repeating Character Replacement

Lecture 4: Check Point #40

Lecture 5: Minimum Window Substring

Lecture 6: Check Point #41

Lecture 7: Valid Anagram

Lecture 8: Check Point #42

Lecture 9: Group Anagrams

Instructors

Mohammed Yasir Eramangadan
Software Engineer | Udemy Instructor

Rating Distribution

1 stars: 0 votes
2 stars: 0 votes
3 stars: 2 votes
4 stars: 3 votes
5 stars: 5 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!

Menu