Conquer DSA

Website will stop working after August 3rd,2024

About Program

In this program, become DSA master at super speed in 6 months.

𝐂𝐨𝐧𝐪𝐮𝐞𝐫 𝐃𝐒𝐀: Comprehensive Video Lessons
𝐒𝐨𝐥𝐯𝐞 𝐋𝐢𝐤𝐞 𝐚 𝐏𝐫𝐨: Curated DSA Problems
𝐂𝐚𝐫𝐞𝐞𝐫 𝐍𝐚𝐯𝐢𝐠𝐚𝐭𝐨𝐫: Professional Guidance
𝐎𝐧𝐞-𝐨𝐧-𝐎𝐧𝐞 𝐌𝐞𝐧𝐭𝐨𝐫𝐬𝐡𝐢𝐩: Personalized Coaching
𝐂𝐨𝐦𝐦𝐮𝐧𝐢𝐭𝐲 𝐂𝐨𝐧𝐧𝐞𝐜𝐭: Join Vibrant Student Network
𝐏𝐫𝐨𝐠𝐫𝐞𝐬𝐬 𝐏𝐮𝐥𝐬𝐞: Weekly Accountability Checks
All the important Data Structures and Algorithms
𝐁𝐞𝐠𝐢𝐧𝐧𝐞𝐫 𝐅𝐫𝐢𝐞𝐧𝐝𝐥𝐲 Basic to advanced
𝐄𝐯𝐞𝐫𝐲𝐝𝐚𝐲 𝐥𝐢𝐯𝐞 𝐜𝐥𝐚𝐬𝐬𝐞𝐬
𝐇𝐚𝐧𝐝𝐩𝐢𝐜𝐤𝐞𝐝 questions 300
𝐌𝐨𝐜𝐤 𝐎𝐧𝐥𝐢𝐧𝐞 DSA coding rounds
𝐌𝐨𝐜𝐤 𝐎𝐧𝐥𝐢𝐧𝐞 Aptitude tests
Discussion sessions after Mock Tests

Curriculum

Course Overview
This is an overview on how the course is designed and how you are going to progress here.

How to Practice Problems?

00:00

Fundamentals
Here you will learn how to write your first program using C++.

What the hell is “Coding”?

04:54
Get ready! it’s “Our First Code”.

07:25
Variables?

11:32
Arithmetic Operators?

06:03
Conditionals with Relational Operators

11:20
Conditionals with Logical Operators

07:50
Let’s Understand If-else in detail

20:00
Increment and Decrement operators

08:28
What’s “Loop” doing here?

10:54
Loops in detail – Part I

22:00
Loops in detail – Part II

04:30
Nested Loops – Loop inside Loop.

07:27
Pretty Patterns – I

20:00
Pretty Patterns – II

12:00
What the hell are “Functions”?

04:06
Let’s Code some “Functions”.

05:33
Functions in Detail

27:07
Time Complexity – a must to know!

11:39
Time Complexity In Detail

17:00
What’s Space Complexity?

04:16
Leetcode

05:38
Conditionals (Problems)

00:00
Loops (Problems)

00:00
Standard Mathematical Techniques (Problems)

00:00
Nested Loop (Problems)

00:00
Ad – Hoc (Problems)

00:00

Array/Vector
Array and Vector basics

Our first Ladder – “Array”

10:58
How to write an “Array” ?

07:43
Let’s Code “Array”

09:59
Another species of Array – “2D Arrays”

04:26
Upgraded version of Arrays – “Vectors”.

06:25
Vectors In Detail

33:00
Let’s Code – 2D Array & Vector.

10:36
Array fundamentals (Problems)

00:00
Counting + Kadane + 2 Pointer + Shifting Techniques (Problems)

00:00
2DArray (Problems)

00:00
Memory Reuse (Problems)

00:00
Ranges in Array (Problems)

00:00
Array Emulation (Problems)

00:00
Rearrangement (Problems)

00:00

Map

Strings

Sliding Window

Binary Search

Recursion

That’s where real Coding starts – Recursion

09:04
Parts of Recursion

09:11
Let’s go on a Date with our partner.

02:50
Fibonaaci using Recursion.

05:23
Code the “Fibonaaci”.

04:47
Just give me Factorial of a number”.

04:01
Code “Factorial of a number” using Recursion.

03:21
Give me “Power Of Two”

00:00
Hey, Print first N natural Numbers

00:00
The amazing “Tower of Hanoi” Problem

00:00
let’s Code – Tower of Hanoi

00:00
Naive Recursion (Problems)

00:00
Pick – Don’t Pick (Problems)

00:00
Backtracking (Problems)

00:00

Pointers

Linked List

Stacks and Queues

Tree

What the hell is a tree?

07:19
Damn! Our Tree has a height !

08:22
Let’s code “Height of a Tree”

08:22
What? Diameter of a Tree?

02:51
Let’s Code “Diameter of a Tree”.

07:11
How to walk on a Tree? Traversals?

03:52
Preorder Traversal

10:02
Inorder Traversal

05:29
Postorder Traversal

05:17
Level Order Traversal

08:51
Another species of Binary Trees – “BST”

04:49
Why is it called “Binary Search Tree”?

07:19
BST Traversal (Problems)

00:00
Level Order Traversal (Problems)

00:00
Root To Leaf (Problems)

00:00
Simple Tree Ops (Problems)

00:00
Inplace Change (Problems)

00:00
Tree Search (Problems)

00:00
2 Trees (Problems)

00:00
Tree Construction (Problems)

00:00
Traversals (Problems)

00:00

Priority Queues

DP- Dynamic Programming

The Big mountain – Dynamic Programming aka DP

04:51
Versions Of Recursion

03:10
Optimizing Recursive Code – Memoization

07:29
Optimize Further – Tabulation

04:23
Can We Optimize Even More ?? – State Optimization

07:09
Let’s Rob the houses – House Robber (Recursive)

06:47
House Robber Memoization

06:47
House Robber Tabulation

05:40
House Robber State Optimization

07:02
Guideines For DP

02:32
1-D (Problems)

00:00
DP on sequences (Problems)

00:00
Knapsack (Problems)

00:00
Buy and Sell Stocks (Problems)

00:00
2-D Adhoc (Problems)

00:00
Partitioning (Problems)

00:00

Graph

What are “Graphs”?

05:28
What’s Directed Graph?

03:24
Terminologies in Graph

06:25
How to make a Graph using “Adjacency Matrix”?

07:09
Code a Graph using “Adjacency Matrix”.

00:00
How to make a Graph using “Lists”?

08:27
Code a Graph using “Adjacency Lists”.

07:09
DFS? What’s that?

15:27
again? BFS? What’s that?

03:11
What The Hell Is a MST?

05:28
Dijkstra Algorithm Part-1

05:33
Dijkstra Algorithm Part-2

13:53
Kosaraju Algorithm

10:05
Prim’s Algorithm

16:33
What Are Weighted Graphs?

01:51
Topological Sorting

12:29
BFS (Problems)

00:00
DFS (Problems)

00:00
Shortest Path (Problems)

00:00
Connectivity/Bi partitite / Disconnected graphs (Problems)

00:00
Articulation Points (Problems)

00:00

Sorting

Classes

STL

Student Ratings & Reviews

5.0

Total 2 Ratings

2 Ratings

0 Rating

Ashish Jha

1 year ago

One of best platform to prepare for placement and interview.
Before I was facing difficulties in Binary Search and Recursion but after joining this platform, now I have enough confidence in such topics.
Thanks to the great teachers for bringing such a nice platform.

arpit_226

1 year ago

Clarity of Explanation

Level

Beginner
Total Enrolled

325
Duration

100 hours
Last Updated

February 16, 2024

Website will stop working after August 3rd,2024

Conquer DSA

About Program

Key Features

Curriculum

Course Overview This is an overview on how the course is designed and how you are going to progress here.

How to Practice Problems?

Fundamentals Here you will learn how to write your first program using C++.

What the hell is “Coding”?

Get ready! it’s “Our First Code”.

Variables?

Arithmetic Operators?

Conditionals with Relational Operators

Conditionals with Logical Operators

Let’s Understand If-else in detail

Increment and Decrement operators

What’s “Loop” doing here?

Loops in detail – Part I

Loops in detail – Part II

Nested Loops – Loop inside Loop.

Pretty Patterns – I

Pretty Patterns – II

What the hell are “Functions”?

Let’s Code some “Functions”.

Functions in Detail

Time Complexity – a must to know!

Time Complexity In Detail

What’s Space Complexity?

Leetcode

Conditionals (Problems)

Loops (Problems)

Standard Mathematical Techniques (Problems)

Nested Loop (Problems)

Ad – Hoc (Problems)

Array/Vector Array and Vector basics

Our first Ladder – “Array”

How to write an “Array” ?

Let’s Code “Array”

Another species of Array – “2D Arrays”

Upgraded version of Arrays – “Vectors”.

Vectors In Detail

Let’s Code – 2D Array & Vector.

Array fundamentals (Problems)

Counting + Kadane + 2 Pointer + Shifting Techniques (Problems)

2DArray (Problems)

Memory Reuse (Problems)

Ranges in Array (Problems)

Array Emulation​ (Problems)

Rearrangement (Problems)

Map

What’s a “Map”?

Ordered Map V/S Unordered Map

How to code using Map?

Problems

Strings

What are Strings?

Char Array vs String

Do Strings also have Indexing?

Let’s Code using Strings.

Problems

Sliding Window

Window is sliding. How? Sliding Window?

Let’s Code “Sliding Window Maximum”.

Fixed Size Window (Problems)

Variable Size Window (Problems)

Binary Search

What is Binary search?

Let’s Code with Binary Search

Fundamental Binary Search (Problems)

Bool Function Pattern (Problems)

Binary Search on Sort modification (Problems)

Recursion

That’s where real Coding starts – Recursion

Parts of Recursion

Let’s go on a Date with our partner.

Fibonaaci using Recursion.

Code the “Fibonaaci”.

Just give me Factorial of a number”.

Code “Factorial of a number” using Recursion.

Give me “Power Of Two”

Course Overview
This is an overview on how the course is designed and how you are going to progress here.

Fundamentals
Here you will learn how to write your first program using C++.

Array/Vector
Array and Vector basics

Array Emulation (Problems)