Mô tả

Brand new course ready for the 2024 hiring season! Join a course taught by industry experts that have actually worked both at top tech firms. Graduates of this course are now working at Google, Tesla, Amazon, Apple, IBM, JP Morgan, Facebook + other top tech companies.

This is the ultimate resource to prepare you for coding interviews. Everything you need in one place!

WHAT OUR LEARNERS ARE SAYING:

5 STARS - This was an amazing course. I was a beginner in data structures and algorithms, but I have learned so much that I would consider myself intermediate-advanced. For anyone looking to deepen their understanding of these data structures, their implementation, or their real-world use, I completely recommend buying this course.

5 STARS -  This is the best course on data structure compare to all data structure course .all the topic of data structure has been completed in this course .if anyone want to learn data structure then you can go for it. thank you sir for making this course on udemy

5 STARS -  I liked this course very much! It clears out your basics quite well and is does totally what Harsh and Ankit claim they'll do. I would recommend this to everyone who wants to learn Data Structures and Algorithms, especially if you had a phobia for coding like I did. I now love coding! All thanks to them.

5 STARS -  This course is really amazing. instructor is going beyond and beyond each and every thing was my beyond expectations. really mastery course it is.

5 STARS -  Hands-on course. The teaching style is excellent. If you are looking for a DSA course and a beginner then your search end here. Just go for it guys. Many thanks to the instructor for creating this course

5 STARS - This is the best computer science course I've taken. If you need to learn C++ and pass your technical interviews, this is the course to take. The explanations in the videos are extremely thorough, and I have reached out to the instructor several times on various questions, and he's always quick to respond and very helpful. In my experience, every MOOC that said its instructors would actively help you with problems lied, EXCEPT FOR THIS COURSE. TAKE THIS COURSE!

5 STARS - This is the BEST COURSE on C++ Data Structures & Algorithms. The Instructors are the BEST. They Draw Everything out and Then EXPLAIN THE CONCEPTS VERY WELL & then CODE it. Also I Love Doing the LEETCODE ProblemSets. Absolutely Fantastic. Above my Expectations. I am taking this course for COMPETITIVE PROGRAMMING. It is the BEST COURSE. Thank you very much Ankit and Harsh. You guys are the BEST!

Course Highlights

  • Quality Problems with hands-on code

  • Intuitive & Detailed Explanations

  • HD Videos

  • Deep focus on Problem Solving

  • Broaden your mindset

  • STL Powerful features

  • 250+ HD Lectures

  • 200+ quality Problems

  • 60+ hours of interactive content

  • Code Evaluation Exercises

  • Doubt Solving within 6 hours

  • Practice Exercises

  • Real Time Feedback

  • Lifetime Access

  • Industry vetted curriculum

  • Completion Certificate

Overview of Topics

  • Arrays, Strings, Vectors, Binary Search

  • Stacks, Queues, Linked Lists

  • Binary Trees, BSTs, Heaps

  • Hashing, Pattern Matching, Tries

  • Brute force, Recursion

  • Sliding Window, Two Pointer

  • Sorting & Searching, Greedy

  • Graphs Algorithms, Dynamic Programming

So you want to learn and master Data Structure and Algorithm , I have done it. I have cracked interviews of top product based companies and landed job offers from many companies (Amazon, Samsung , Microsoft, Flipkart ...)

This course is totally designed, with interative lectures, good quality problems, and is deeply focussed on problem solving. If you want to learn  breath & depth of topics, this course is for you.

So i have created this course keeping in mind university syllabus and also to make you ready to get those valuable internships and placements.

You will top your university exams and will become interview ready at the same time.

I know how professors teach in colleges , they just discuss theory , but hey I am not a professor instead a bro. I will teach you things which really matter . Also i have shared many tips and tricks in the course .

So what are you waiting for ??

Master Data Structure and Algorithms , top you university exam and get those valuable internships and placements

Still have doubt , see the course content , no one is teaching you variation of binary search , every other instructor will teach you standard binary search. I am also teaching Dynamic Programming which is difficult to teach and other instructors are not teaching this but its a very important topic and you must know it.

We are solving 30+ problems on Recursion ,

Note :  This course is 100% practical

My approach is very simple : discuss the relevant theory and then solve lots of problems . I teach concepts by solving lots of problems  and you should be ready to solve lots of problems as Assignments , Quizzes etc

Every Data Structure is discussed, analysed and implemented with a Practical line-by-line coding.

Source code for all Programs is available for you to download

With this complete course, you will become an expert in the core fundamentals of programming, Data Structures, Algorithms and its functioning with one of the most popular programming languages,C and C++. The involvement of the practical technique of problem-solving will give learners a better understanding of the concepts of the course. Learn to design efficient algorithms and become ready for future best jobs in the industry.

As if this was not enough , I have shared tips and tricks on how to become good in competitive programming ( yes i have did CP in college)

Source code for all Programs is available for you to download

Sign up today!

Bạn sẽ học được gì

Learn the strengths and weaknesses of a variety of data structures, so you can choose the best data structure for your data and applications

Learn many of the algorithms commonly used to sort data, so your applications will perform efficiently when sorting large datasets

Code an implementation of each data structure, so you understand how they work under the covers

Develop your Analytical skills on Data Structure and use then efficiently.

Improve your problem solving skills and become a stronger developer

Learn everything you need to ace difficult coding interviews

Yêu cầu

  • Basic knowledge of Programming in C++
  • NO experience with data structures or computer science needed!

Nội dung khoá học

40 sections

Installing Code Blocks

2 lectures
Installing Code Blocks - 1
08:32
Installing Code Blocks - 2
08:26

DS : Arrays

7 lectures
Arrays Introduction
23:06
Problem : Sum of Array Elements
06:22
Problem : Largest Element in Array
13:11
Problem : Swap 2 numbers
09:40
Problem : Print Array in Reverse Order
05:30
Problem : Reverse Array
09:13
Segmentation Fault in Array
03:45

DS : Character Array

6 lectures
Introduction
14:42
Length of String
05:56
cin.getline()
19:02
Reverse string
11:15
Inbuilt functions
34:18
Print all prefixes
09:24

DS : Matrix or 2D Array

3 lectures
Introduction to 2D Arrays
21:47
Initialise and pass 2D Arrays to function
14:22
How 2D Arrays are stored in Memory ?
18:20

DS : String

1 lectures
String
33:41

OOPS - Basics

11 lectures
Introduction to OOPS
10:21
Creating objects
24:32
Getters and Setters
14:34
Constructors
19:06
Constructor and this keyword
20:25
Copy Constructor
10:55
Copy Assignment Operator & Destructor
15:29
Play with Constructor
05:16
Fraction Class
23:15
Fraction Class Continuation
09:57
Complex Number Class
06:43

OOPS-Advanced

9 lectures
Shallow and Deep Copy
15:03
Our Own Copy Constructor
13:50
Initialisation List
17:25
Constant Function
11:54
Static Members
22:05
Operator Overloading - 1
19:46
Operator Overloading - 2
30:43
Operator Overloading - 3
18:16
Dynamic Array Class
39:55

DS : Vectors

3 lectures
Vectors
27:36
Vector Quiz
6 questions
Spiral Order Matrix
18:30

Basic Sorting Algorithm

4 lectures
Selection Sort Algorithm ( Explain + Code )
30:49
Bubble Sort Algorithm ( Explain + Code )
21:34
Optimized Bubble Sort Algorithm (Explain + Code )
08:08
Inbuilt Sort : Standard Template Library (STL)
06:31

Binary Search Algorithm

4 lectures
Linear Search Algorithm ( Explain + Code )
15:17
Problem with Linear Search
02:31
Binary Search Algorithm (Explain)
16:54
Binary Search Algorithm (Code)
15:13

Recursion - 1 Basics

10 lectures
Introduction to recursion
23:12
Recursion and PMI
16:15
Fibonacci Number
10:24
Power
05:52
Print Numbers
14:43
Numbers of Digits
11:18
Sum of Digits
09:37
Multiplication
09:59
Count Zeroes
09:01
Geometric Sum
08:33

Recursion - 2 Intermediate

10 lectures
Check if Array is sorted
26:55
Sum of Array
18:50
Check if element is present
27:53
First Index of element
09:50
Last Index of element
27:41
Print All position of element
05:20
Count Occurrence of element- First Approach
04:57
Count Occurrence of element- Second Approach
05:28
Store All Position of element
15:52
Check Palindrome
11:47

Recursion - 3 Advanced

12 lectures
Print and Reverse Print Recursively
07:04
Length Recursively
04:51
Replace Character Recursively
06:58
Remove Character Recursively
10:03
Remove Consecutive Duplicates
09:36
Print All Subsequences of String
21:03
Store All Subsequences of String
03:08
Convert String to Integer
11:16
Print All Permutation of String
10:55
Staircase Problem
11:19
Tower of Hanoi
10:13
Print Steps in Tower of Hanoi
11:21

Merge Sort & Quick Sort

5 lectures
Merge Sort Introduction
14:38
Merge Sort Solution
16:29
Quick Sort Introduction
13:52
Quick Sort Solution
10:52
Quick Sort Testing
01:40

Time Space Complexity Analysis

11 lectures
Experimental Analysis
15:30
Theoretical Analysis
15:23
Linear Search Time Complexity
03:20
Selection Sort Time Complexity
04:52
Theoretical Analysis Recursive Algorithm
11:55
Merge Sort Time Complexity
07:45
Fibonacci Time Complexity
12:27
Space Complexity Analysis
17:43
Merge Sort Space Complexity
05:43
Fibonacci Space Complexity
04:30
Time & Space Complexity Quiz
9 questions

Advanced Binary Search

2 lectures
Find First & Last Occurence
24:20
Search in Rotated Sorted Array
20:25

Algorithm : Moore Voting : Majority Element

1 lectures
Majority Element
25:46

What are Data Structures ?

1 lectures
Introduction
02:26

DS : Linked List - 1

12 lectures
What is Linked List ?
18:22
Print a Linked List
29:34
Linked List Quiz 1
4 questions
Taking Input - 1
27:50
Taking Input - 2
10:44
Length
11:50
Print ith Node
26:15
Question : Insert Node at ith position
07:24
Solution: Insert Node at ith position
27:41
Question : Delete ith Node
05:21
Solution with Memory Leak : Delete ith Node
21:18
Solution without Memory Leak : Delete ith Node
11:20

DS : Linked List - 2

12 lectures
Length - recursive
07:39
Search in Linked List
06:17
Search in Linked List - Recursive
07:45
Middle Node of List - Slow and Fast Pointer Approach
19:03
Reverse a Linked List
08:21
Remove nth Node from end of list
24:09
Merge 2 sorted List
15:35
Merge 2 sorted List (Recursive)
06:52
Merge Sort on Linked List
18:43
Doubly Linked List
07:05
Circular Singly Linked List
08:45
Circular Doubly Linked List
08:31

DS : Stacks

15 lectures
Stack Introduction
15:16
Stack Quiz 1
9 questions
Stack Implementation using Array Part-1
12:42
Stack Implementation using Array Part-2
18:42
Dynamic Stack
11:18
Stack Quiz 2
8 questions
Templates
34:43
Stack using Templates
10:51
Stack using LL Introduction
21:48
Stack using LL Solution
13:11
Stack Quiz 3
2 questions
Inbuilt Stack
10:10
Balanced Parenthesis
19:54
Evaluate Reverse Polish Notation
23:58
Remove All Adjacent Duplicates
26:40

DS : Queues

11 lectures
Queue Introduction
08:03
Queue Quiz 1
2 questions
Queue using Array Introduction
22:32
Queue using Array Code
39:41
Dynamic Queue
17:06
Queue Quiz 2
8 questions
Queue using LL Introduction
13:15
Queue using LL Solution
14:22
Queue Quiz 3
2 questions
Inbuilt Queue
08:28
Reverse a queue
09:46

DS : Generic Trees

16 lectures
Trees Introduction
09:50
Vectors
27:36
TreeNode Class
14:08
Print Recursive
18:19
Take Input Recursive
17:32
Take Input Level Wise
30:44
Level Order Print Introduction
04:19
Level Order Print Solution
13:21
Count Nodes
06:53
Height of a Tree
11:31
Print All Nodes at Level K
12:54
Count Leaf Nodes
23:28
PreOrder Traversal
10:35
PostOrder Traversal
06:48
Delete Tree
07:03
Destructor
07:44

DS : Binary Tree

22 lectures
Binary Tree Introduction
16:10
Print Tree Recursive
10:49
Take Input Recursive
17:12
Take Input Level Wise
28:46
Level Order Traversal
30:50
Count Nodes
06:16
InOrder Traversal
10:56
PreOrder Traversal
09:20
PostOrder Traversal
08:16
Max Depth of Binary Tree
11:29
Symmetric Binary Tree
12:33
Find Node
07:14
Min Value
18:21
Max Value
08:36
Count Leaf Nodes
13:15
Construct Tree from PreOrder and Inorder Traversal Introduction
20:12
Construct Tree from PreOrder and Inorder Traversal Solution
21:54
Construct Tree from PostOrder and Inorder Traversal Introduction
10:47
Construct Tree from PostOrder and Inorder Traversal Solution
12:57
Diameter of Binary Tree
20:22
Diameter of Binary Tree Better Approach
18:47
Root to Node Path
20:05

DS : Binary Search Tree (BST)

15 lectures
Introduction
15:25
Search in BST
09:42
Find Min in BST
04:44
Find Max in BST
04:15
Range Sum in BST
09:38
Validate BST
23:04
Convert Sorted Array to BST
08:23
BST Class Implementation
14:06
BST Class - How to Insert
05:47
BST Class Insert Implementation
14:45
BST Class - How to Delete
16:37
BST Class Delete Implementation
24:55
Convert BST to Sorted Singly List Introduction
08:15
Convert BST to Sorted Singly List Solution
34:18
Types of Balanced BST
17:34

DS : HashMap

10 lectures
Introduction to HashMap
23:09
Inbuilt Hashmap
18:02
Remove Duplicates
17:39
Iterators
27:24
Bucket Array & Hash Function
18:17
Collision Handling
16:25
HashMap Implementation - Insert
34:33
HashMap Implementation - Delete & Search
13:00
Time Complexity & Load Factor
12:24
Rehashing
27:07

DS : Priority Queue

16 lectures
Introduction to Priority Queue
12:07
Ways to implement Priority Queue
11:56
Heaps Introduction
09:23
CBT and its implementation
26:57
Insert & Delete in Heaps
26:07
Example Solution & Max Heap
08:53
Implementation of Priority Queue - Part 1
06:49
Implementation-Insert
14:19
Remove Min Explanation
06:22
Remove Min Solution & Complexity Analysis
23:37
Inplace Heap Sort
23:07
Inplace Heap Sort Solution
20:17
Inbuilt Priority Queue
10:40
K Sorted Array
30:17
K Smallest Element
18:01
Inbuilt Min Priority Queue
14:46

Dynamic Programming : Basic

8 lectures
Introduction & Fibonaci
27:25
Hint : Minimum Steps to 1
09:18
Minimum Steps to 1 Brute Force Method
11:19
Minimum Steps to 1 Memorization Method
14:46
Minimum Steps to 1 Bottom Up Method
13:53
Climbing Stairs Recursive
04:54
Climbing Stairs DP
03:51
Climbing Stairs DP Generalised
08:17

Dynamic Programming : Advanced

6 lectures
Longest Common Subsequence Recursive
12:33
Longest Common Subsequence DP
10:33
Minimum Distance Recursive
12:58
Minimum Distance DP
09:50
0-1 Knapsack Recursive
20:34
0-1 Knapsack DP
11:05

DS : Graph

4 lectures
Graph Introduction
06:59
Graph Terminology
11:25
Graph Implementation
13:42
Adjacency Matrix
08:25

Graph Traversal Algo-> BFS and DFS

8 lectures
DFS Traversal
26:03
BFS Traversal Introduction
06:53
BFS Traversal Solution
13:24
DFS for Disconnected Graph
16:10
BFS for Disconnected Graph
08:23
No of Connected Component
02:10
DFS to find No of Connected component
06:43
BFS to find No of Connected component
02:51

Weighted and Directed Graph

1 lectures
Weighted and Directed Graph
07:42

Spanning Tree

2 lectures
Introduction
09:09
Minimum Spanning Tree
07:10

Algo : Kruskal

3 lectures
Introduction
22:36
Disjoint Set for Cycle Detection
35:00
Kruskal Code
03:17

Algo : Prims

3 lectures
Introduction + Code
21:06
Commutable Islands explain
04:36
Commutable Islands code
13:08

Algo : Dijikstra

3 lectures
Introduction
16:19
Dijikstra Code
04:38
Limitation of Dijikstra
04:24

Algo : Topological Sort

2 lectures
Introduction
16:21
Topological Sort Code
06:00

DS : Trie

3 lectures
Introduction
20:42
Insert in Trie
18:58
Search in Trie
09:08

Project : Design LRU Cache

2 lectures
LRU Cache explain
13:44
LRU Cache code
09:57

Bonus

1 lectures
What to do next?
00:11

Đánh giá của học viên

Chưa có đánh giá
Course Rating
5
0%
4
0%
3
0%
2
0%
1
0%

Bình luận khách hàng

Viết Bình Luận

Bạn đánh giá khoá học này thế nào?

image

Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!

Get khoá học giá rẻ ngay trước khi bị fix.