Teach on Udemy

Turn what you know into an opportunity and reach millions around the world.

Learn More

Your cart is empty.

Keep shopping

Master Data Structures , Algorithms & Interview using C++

Name: Master Data Structures , Algorithms & Interview using C++
Rating: 5.0 (1 reviews)

Learn about Arrays, Linked Lists, Trees, Stacks, Queues, Heaps, Search data structure algorithms,Interview Preparation

Created byManik Soni

Last updated 6/2020

English

What you'll learn

Learn, Analyse,Prepared for interview and Implement Data Structure and Algorithms using C++.
Learn various Popular Data Structures and their Algorithms.
Develop your Analytical skills on Data Structure and use then efficiently.
Implementation of Data Structures using C and C++
Become more confident and prepared for your next coding interview
Learn, implement and use different Algorithms

Course content

10 sections • 72 lectures • 12h 46m total length

Introduction2:20
Environment Setup For Windows and Mac0:58
Set up your C++ environment by downloading Dev C++ for Windows and Xcode for Mac, both free, and get a ready-to-use compiler for the course.

Why Arrays are used as Data Structures?8:08
Declaration of Array6:11
Explore five common ways to declare and initialize arrays in C++, including fixed-size, partial initialization, and default values, with guidance for dynamic memory in later sections.
Accessing Array elements4:34
Discover how to access elements in a one-dimensional array using zero-based indexing, pointer arithmetic, and a for loop that iterates over the array.
Static Vs Dynamic Arrays5:25
Static Vs Dynamic Arrays(CODE)4:29
How to increase the Size of an Array?7:34
2D Array Concept10:33
2D Array (CODE)8:41

Introduction to Abstract Data Types(ADT) ?7:49
ADT: Modified Array and Display Operation(Code)10:06
Develop a modified array ADT by defining a structure, allocating dynamic memory for a user-defined size, populating and displaying elements with a loop, and analyzing the display operation's time complexity.
Append and Insert Operation8:13
Append and Insert Operation(CODE)13:01
Explore how to implement append and insert operations for an array, validate capacity and index, shift elements to make room, and update the length accordingly.
Delete Operation4:02
Delete Operation(CODE)9:07
Learn to implement a delete function by validating the target index is within bounds, removing the element at that index, shifting subsequent elements left, and updating the size.
Search :Binary & Linear Operation14:36
Search :Binary & Linear Operation(CODE)9:42
max(),min(),set(),get() and avg() Operations5:18
Explore get, set, max, min, and avg operations on arrays: retrieve, replace, and compare elements, find the maximum and minimum, and compute the average.
max(),min(),set(),get() and avg() Operations(CODE)15:02
Reverse and Shift Operation13:34
Reverse and Shift Operation(CODE)12:19
Merging of 2 Arrays9:15
Merging of 2 Arrays(CODE)5:54
Learn to merge two arrays into a single, sorted array using a three-pointer approach and a while loop in C++, including handling remaining elements to ensure a fully sorted result.

Introduction to Linked List11:20
Node in Linked List3:13
Create and Display Elements in Linked List20:36
Sum and Count Operation in Linked List9:15
Learn to traverse a linked list to compute the sum of node values and count the nodes using a simple loop, starting from the head and moving through next pointers.
Sum and Count Operation in Linked List(CODE)6:28
Insert Node Operation in Linked List14:58
Insert Node Operation in Linked List(CODE)8:51
Delete Operation in Linked List11:22
Delete Operation in Linked List(CODE)6:09
Reverse Operation in Linked List20:22
Reverse Operation in Linked List(CODE)6:24
Introduction to Doubly Linked List7:38
Insert Node Operation in Doubly Linked List20:30
Learn how to insert a node in a doubly linked list using two pointers (start and last), handling start and location insertions, and updating next and previous links.
Insert Node Operation in Doubly Linked List(CODE)7:12
Delete Operation in Doubly Linked List14:09
Delete Operation in Doubly Linked List(CODE)7:45
Reverse in Doubly Linked List(CODE)2:20

Introduction to Trees14:58
Binary Trees7:14
Binary Search Trees(BST)6:57
Searching in Binary Search Tree(BST)21:11
Insertion in Binary Search Trees(BST)17:24
Insertion in Binary Search Trees(BST) :CODE9:39
Tree Traversal(Preorder,Inorder & Postorder)21:22
Tree Traversal(Preorder,Inorder & Postorder):CODE10:47
Find the Height of BST8:36
Deletion in Binary Search Trees(BST)31:08
Deletion in Binary Search Trees(BST) :CODE17:36
Delete a node from a binary search tree by recursively locating and deleting the target, handling leaf, one-child, and two-child cases, and replacing with in-order successor or predecessor.

Requirements

Little bit of programming language experience.
Intension to learn

Description

Data Structures? They're here. Algorithms? Covered. Lots of questions with well-explained solutions?

Learn various Popular Data Structures and their Algorithms.
Develop your Analytical skills on Data Structure and use them efficiently.
Learn Recursive Algorithms on Data Structures.
Implementation of Data Structures using C++

You may be new to Data Structure or you have already Studied and Implemented Data Structures but still, you feel you need to learn more about Data Structure in detail so that it helps you solve challenging problems and used Data Structure efficiently.

Want to land a job at a great tech company like Google, Microsoft, Facebook, Netflix, Amazon, or other companies but you are intimidated by the interview process and the coding questions? Do you find yourself feeling like you get "stuck" every time you get asked a coding question? This course is your answer. Using the strategies, lessons, and exercises in this course, you will learn how to land offers from all sorts of companies.

Many developers who are "self-taught", feel that one of the main disadvantages they face compared to college-educated graduates in computer science is the fact that they don't have knowledge about algorithms, data structures, and the notorious Big-O Notation. Get on the same level as someone with a computer science degree by learning the fundamental building blocks of computer science which will give you a big boost during interviews. You will also get access to our private online chat community with thousands of developers online to help you get through the course.

I have spent many hours combing through interview questions asked at Google, Facebook, and Amazon to make sure you know how to answer questions asked by the most well-paying companies out there. No stone is left unturned, as we discuss everything from the simplest questions all the way to the most complex algorithm questions.

Course Contents

1. Recursion

2. Arrays Representation

3. Array ADT

4. Linked List

5. Stack

6. Queues

7. Trees

8. Binary Search Tree

9. Graphs

10. Interview Practice

Who this course is for:

Students who face problem in Data Structures and Algorithms. This course prepare students for interview questions.
Those students who want a job in big FAANG companies.
Those who want to optimize the solution of a give problem.
Those who want excellent grip in Data Structures and Algorithms.

Master Data Structures , Algorithms & Interview using C++

What you'll learn

Explore related topics

Course content

Introduction2 lectures • 3min

Basic Definations3 lectures • 20min

Arrays8 lectures • 56min

Arrays Abstract Data Types(ADT )14 lectures • 2hr 18min

Linked List17 lectures • 2hr 59min

Stack5 lectures • 1hr 8min

Queue5 lectures • 1hr 1min

Trees11 lectures • 2hr 47min

Graphs6 lectures • 1hr 10min

Course Conclusions & What's Next1 lecture • 5min

Requirements

Description

Who this course is for: