SIGMA-9-CPP
SIGMA-9 CPP DSA by Apna college video tutorials and hands-on projects.
Meet Your Instructor: Apna-College
Apna College stands as one of India's most influential and accessible programming education platforms, founded by the visionary educator Aman Dhattarwal. With a mission to democratize quality coding education, Apna College has transformed the lives of hundreds of thousands of students through their comprehensive, career-oriented curriculum. The platform's signature Sigma series courses cover everything from foundational programming in Java and C++ to advanced MERN stack development and aptitude preparation. Apna College is renowned for breaking down complex technical concepts into simple, engaging lessons that students can follow regardless of their prior experience. Their unique teaching approach combines practical projects, real-world applications, and industry insights, ensuring students are well-prepared for both academic excellence and professional success in the competitive tech industry.
Java ProgrammingC++ ProgrammingMERN Stack
Experience: 5+ years
Students Helped: 200000+
Specialization: Complete Programming Education
Course Overview
This comprehensive course is designed to take you from foundational concepts to advanced implementation in complete programming education. You'll learn through comprehensive curriculum designed with career focus, emphasizing hands-on learning, project-based assignments, and industry-relevant skills, building real-world projects that demonstrate your skills and enhance your portfolio.
Whether you're looking to start a new career in technology or advance your current skills, this course provides the structured learning path and practical experience you need to succeed in today's competitive tech industry.
Course Curriculum
Master C++ programming fundamentals and data structures
Learn object-oriented programming concepts and STL
Implement arrays, linked lists, trees, and graphs in C++
Master sorting and searching algorithms with complexity analysis
Solve competitive programming problems using C++
Understand memory management and advanced C++ features
Course Content
1
How to verify on Discord?
2
Orientation Session (Recording)
3
Extra Live Session 1 (Recording)
4
Extra Live Session 2 (Recording)
5
Extra Live Session 3 (Recording)
6
Linkedin Mentorship Session (with Aman Sir)
7
Coding Platforms Mentorship Session
8
Projects Mentorship Session
9
Resume Building Mentorship Session
10
Aman Sir's session for 1st year
11
Off-Campus Mentorship Session
12
Special Mentorship Session by Aman Sir
13
Message from the Teacher
14
Placements & Internships
15
About the Lectures
16
Pre-requisites
17
What to Install?
18
Using Replit
19
For Mac Users - Setting up C++
20
Using VS Code
21
What are Flowcharts?
22
Components of Flowchart
23
Sum of 2 Numbers
24
Calculate Simple Interest
25
Max of 2 Numbers
26
Print N Natural Numbers
27
Sum of N Natural Numbers
28
Boilerplate Code in C++
29
How does code run?
30
Preprocessor Directive
31
Main Function in C++
32
What is Namespace?
33
Output in C++
34
Print the Pattern
35
Variables in C++
36
Naming Conventions
37
Identify Valid Names
38
Data Types in C++
39
Comments
40
Input in C++
41
Print Average Marks
42
Constants
43
Implicit Type Conversion
44
Explicit Typecasting
45
Practice Qs
46
Arithmetic Operators
47
Unary Arithmetic Operators
48
Assignment Operators
49
Relational Operators
50
Logical Operators
51
If else Statements
52
Practice Qs
53
Else if Statements
54
Practice Qs
55
Practice Qs
56
Ternary Operator
57
Switch Statement
58
Build a Calculator
59
for Loop (in Detail)
60
Print "apna college"
61
Print N Natural Numbers
62
Sum of N Natural Numbers
63
while Loop
64
Practice Qs
65
Practice Qs
66
do while Loop
67
break Statement
68
Practice Qs (break)
69
continue Statement
70
Practice Qs (continue)
71
Check for Prime
72
Check for Prime (Optimized)
73
Nested Loops
74
Nested Loops (Dry Run)
75
Star Pattern
76
Inverted Star Pattern
77
Half Pyramid Pattern
78
Character Pyramid Pattern
79
Hollow Rectangle Pattern
80
Inverted & Rotated Half-Pyramid Pattern
81
Floyd's Triangle Pattern
82
Diamond Pattern
83
Butterfly Pattern
84
What are Functions?
85
Forward Declaration
86
Syntax with Parameters
87
Practice Qs
88
Practice Qs (Factorial)
89
Function call in Memory
90
Scope (Local & Global)
91
Practice Qs (Prime Number)
92
Practice Qs (Binomial Coefficient)
93
Function Overloading
94
Practice Qs (Primes in Range)
95
What is Binary Number System?
96
Convert Binary to Decimal
97
Convert Decimal to Binary
98
Question (Decimal to Binary)
99
Common Numbers in Binary
100
Data Type Modifiers
101
Binary to Decimal (Code)
102
Decimal to Binary (Code)
103
Basic Concepts of Memory
104
AddressOf (&) Operator
105
What are Pointers?
106
Dereference Operator
107
Null Pointers
108
Passing Arguments (Value vs Reference)
109
Reference Variables
110
Practice Qs
111
Practice Qs
112
Basics of Array
113
Creating an Array
114
Output & Input Array
115
Find Largest in Array
116
Arrays are passed by Reference
117
Linear Search
118
Reverse an Array
119
Binary Search
120
Binary Search Code
121
Binary Search (Time Complexity)
122
Array Pointer
123
Pointer Arithmetic 1
124
Pointer Arithmetic 2
125
Pointer Arithmetic 3
126
Pointer Arithmetic 4
127
Print Subarrays
128
Max Sum Subarray (Brute Force)
129
Max Sum Subarray (Slightly Optimized)
130
Kadane's Algorithm for Max Sum Subarray
131
Buy & Sell Stocks
132
Buy & Sell Stocks (Code)
133
Trapping Rainwater
134
Trapping Rainwater (Code)
135
Bubble Sort
136
Bubble Sort (Code)
137
Selection Sort
138
Selection Sort (Code)
139
Insertion Sort
140
Insertion Sort (Code)
141
Counting Sort
142
Counting Sort (Code)
143
In-built Sort in C++
144
Practice Qs
145
Introduction to 2D Arrays
146
Input & Output a 2D Array
147
2D Arrays in Memory
148
Spiral Matrix
149
Spiral Matrix (Code)
150
Diagonal Sum
151
Diagonal Sum (Code)
152
Search in Sorted Matrix
153
Search in Sorted Matrix (Code)
154
Matrix Pointers
155
Matrix Pointers in Functions
156
Revisit Char Data Type
157
Character Array
158
Input Char Array
159
Convert to UpperCase
160
Reverse a Char Array
161
Valid Palindrome
162
cstring Functions
163
OOPs Intro (for Strings)
164
C++ Strings
165
for each Loop
166
String Member Functions
167
Valid Anagram
168
Valid Anagram (Code)
169
Creating a Dynamic Array
170
Dynamic Memory Allocation
171
Static v/s Dynamic Allocation
172
Memory Leak
173
2D Dynamic Arrays
174
What is STL?
175
Vector Introduction
176
Vector Implementation in Memory
177
Pair Sum
178
2D Vectors
179
Practice Qs
180
Bitwise Operators
181
One's Complement
182
Bitwise Shift Operators
183
Practice Qs
184
Check if Odd or Even
185
Get ith Bit
186
Set ith Bit
187
Clear ith Bit
188
Check for Power of 2
189
Update ith Bit
190
Clear Last i Bits
191
Count Set Bits
192
Fast Exponentiation
193
Fast Exponentiation (Code)
194
Classes & Objects
195
Access Modifiers
196
Getters & Setters
197
Encapsulation
198
Constructor
199
Practice Qs
200
Copy Constructor
201
Shallow & Deep Copy
202
Destructor
203
Inheritance
204
Mode of Inheritance
205
Single Inheritance
206
Multi-level Inheritance
207
Multiple Inheritance
208
Hierarchical & Hybrid Inheritance
209
Polymorphism
210
Function Overloading
211
Operator Overloading
212
Function Overriding
213
Virtual Functions
214
Abstraction
215
Pure Virtual Function
216
Static Keyword
217
Static Objects
218
Friend Functions & Class
219
Practice Qs
220
Practice Qs
221
What is Recursion?
222
Dive Deep into Recursion
223
Recursion in Memory
224
Numbers in Decreasing Order
225
Dry Run with Call Stack
226
Stack Overflow
227
Sum of N Natural Numbers
228
Nth Fibonacci
229
Nth Fibonacci (Code)
230
Check if Array Sorted
231
First Occurrence
232
Last Occurrence
233
Print X to the power N
234
X to the power N (Code)
235
Tiling Problem
236
Tiling Problem (Code)
237
Remove Duplicates in String
238
Remove Duplicates (Code)
239
Friends Pairing Problem
240
Friends Pairing (Code)
241
Binary Strings Problem
242
Binary Strings (Code)
243
Binary Strings (Dry Run)
244
Merge Sort Algorithm
245
Merge / Combine Step
246
Merge Sort (Code)
247
Merge Sort (Summary)
248
Quick Sort Algorithm
249
Quick Sort (Code)
250
Worst Case Time Complexity - Quick Sort
251
Search in Rotated Sorted Array
252
Rotated Sorted (Pseudocode)
253
Rotated Sorted (Code)
254
Introduction
255
What is Time Complexity?
256
Constant Time Complexity
257
Big O Notation
258
Big O from Functions
259
Big O Math Formula (Optional)
260
Other Notations
261
What is Space Complexity?
262
Common Time Complexities
263
Constant & Linear TC
264
Quadratic TC
265
Practice Qs 1
266
Practice Qs 2
267
Practice Qs 3
268
Bubble Sort Analysis
269
Logarithmic TC (Binary Search Analysis)
270
O(n) vs O(logn) - Linear vs Log
271
Recursion Time Complexity
272
Recursive Sum of N Numbers
273
Recursive Factorial of N
274
Recursive Nth Fibonacci
275
Merge Sort Analysis
276
Power Function Analysis
277
Practice Qs
278
How to approach Coding Qs?
279
Introduction
280
Backtracking on Arrays
281
Find Subsets
282
Find Subsets (Code)
283
Find Permutations
284
Find Permutations (Code)
285
N Queens Qs Discussion
286
N Queens (Approach)
287
isSafe in N Queens (Approach)
288
N Queens (Time Complexity)
289
N Queens Variations
290
Grid Ways
291
Grid Ways (Code)
292
Grid Ways (Dry Run)
293
Grid Ways (Time Complexity)
294
Grid Ways (Optimization)
295
Sudoku Solver
296
Sudoku Solver (Code)
297
isSafe in Sudoku Solver
298
Introduction to Linked List
299
LL Implementation
300
Push Front in LL
301
Push Back in LL
302
Print LL
303
Insert in Middle of a LL
304
Deleting the Linked List
305
Pop Front in LL
306
Pop Back in LL
307
Iterative Search in LL
308
Recursive Search in LL
309
Reverse a Linked List
310
Find & Remove Nth Node from End
311
Find & Remove Nth (Code)
312
Detect Cycle in a LL
313
Detect a Cycle (Code)
314
Removing Cycle in LL
315
Removing Cycle (Code)
316
Removing Cycle (Math Proof)
317
List in STL
318
Merge Sort on a LL
319
Merge Sort (Split At Mid)
320
Merging 2 Sorted Lists
321
Zig Zag Linked List
322
Zig Zag LL (Alternate Merging)
323
Doubly Linked List (Push Front)
324
Doubly Linked List (Pop Front)
325
Introduction to Stack
326
Stack using Vector
327
Stack using Vector & Class Template
328
Stack using LinkedList
329
Stack in STL
330
Push at Bottom of Stack
331
Push at Bottom (Code)
332
Reverse a String using Stack
333
Reverse a Stack
334
Stock Span
335
Stock Span (Approach)
336
Stock Span (Code)
337
Next Greater Element
338
Next Greater Element (Code)
339
Valid Parentheses
340
Valid Parentheses (Code)
341
Duplicate Parentheses
342
Duplicate Parentheses (Code)
343
Max Area in Histogram
344
Max Area in Histogram (nextSmaller Logic)
345
Max Area in Histogram (Code)
346
Queue Introduction
347
Implementation using LinkedList
348
Circular Queue using Array
349
Queue in STL
350
Queue using 2 Stacks
351
Stack using 2 Queues
352
First non-repeating letter
353
First non-repeating letter (Code)
354
Interleave 2 Queues
355
Interleave 2 Queues (Code)
356
Queue Reversal
357
Double Ended Queue
358
Queue using Deque
359
Stack using Deque
360
Greedy Approach Introduction
361
Activity Selection Problem
362
Activity Selection (Approach)
363
Activity Selection (Code)
364
Activity Selection (Proof)
365
Pairs in C++
366
Fractional Knapsack
367
Fractional Knapsack (Code)
368
Min Absolute Difference of Pairs
369
Max Chain Length
370
Max Chain Length (Code)
371
Indian Coins
372
Indian Coins (Code)
373
Job Sequencing Problem
374
Job Sequencing Variation
375
Binary Trees Introduction
376
Levels & Subtrees
377
Practice Quiz
378
Build Tree from Preorder
379
Preorder Traversal
380
Inorder Traversal
381
Postorder Traversal
382
Level Order Traversal
383
Height of Binary Tree
384
Height of BT (Code)
385
Count of Nodes in BT
386
Sum of Nodes in BT
387
Diameter of a Tree ( Approach 1 )
388
Diameter of a Tree ( Code )
389
Diameter of a Tree ( Approach 2 )
390
Diameter of a Tree ( Code 2 )
391
Subtree of another Tree
392
Subtree of another Tree (isIdentical)
393
Map in C++
394
Top View of a Tree (Horizontal Distance)
395
Top View of a Tree ( Approach )
396
Top View of a Tree ( Code )
397
Kth Level of a Tree
398
Lowest Common Ancestor
399
Lowest Common Ancestor (Code)
400
LCA (Approach 2)
401
LCA (Approach 2) Code
402
Min Distance between Nodes
403
Kth Ancestor of a Node
404
Kth Ancestor (Code)
405
Transform to Sum Tree
406
BST Introduction
407
Search in BST
408
Insert & Build a BST
409
Search in BST (Code)
410
Delete a Node in BST
411
Inorder Successor
412
Delete a Node (Code)
413
Print in Range
414
Root to Leaf Path
415
Validate BST
416
Validate BST (Code)
417
Sorted Array to Balanced BST
418
Sorted Array to Balanced BST (Code)
419
BST to Balanced BST
420
BST to Balanced BST (Code)
421
Largest BST in BT
422
Largest BST in BT (Code)
423
Merge 2 BSTs
424
Heaps & Priority Queue (Introduction)
425
PQ in C++ STL
426
What are Heaps?
427
Building Heaps
428
Push in Heap
429
Push in Heap (Code)
430
Pop in Heap
431
Pop in Heap (Code)
432
Pop in Heap (Dry Run)
433
PQ for Objects
434
PQ for Pairs
435
Heap Sort (Building maxHeap)
436
Heap Sort (Sorting)
437
Nearby Cars
438
Nearby Cars (Code)
439
Connect N Ropes
440
Connect N Ropes (Code)
441
Weakest Soldier
442
Weakest Soldier (Code)
443
Sliding Window Maximum
444
Sliding Window Maximum (Code)
445
Introduction
446
Hash Table Data Structure
447
Hashing (Hash Function)
448
Collisions
449
Building Hash Table
450
Insert in Hash Table
451
Rehashing
452
Search in Hash Table
453
STL Containers
454
Unordered Maps
455
Maps
456
Unordered Sets
457
Sets
458
Majority Element
459
Majority Element (Code)
460
Valid Anagram
461
Valid Anagram (Code)
462
Count Distinct
463
Union & Intersection
464
Itinerary from Tickets
465
Itinerary from Tickets (Code)
466
Zero Sum Largest Subarray
467
Zero Sum Largest Subarray (Code)
468
K Sum Subarray Count
469
K Sum Subarray Count (Code)
470
Tries Introduction
471
Search in Trie
472
Building a Trie DS
473
Insert in Trie
474
Search in Trie
475
Word Break Problem
476
Word Break (Code)
477
Prefix Problem
478
Prefix (Code)
479
StartsWith Problem
480
Count Unique Substrings
481
Count Unique Substrings (Code)
482
Longest Word with all Prefix
483
Longest Word (Code)
484
Introduction to Graphs
485
Types of Graphs
486
Graph using Adjacency List
487
Graph using Adjacency Matrix
488
Edge List & Implicit Graph
489
Building a Graph (Adjacency List)
490
Breadth First Traversal (BFS)
491
BFS Code
492
Depth First Traversal (DFS)
493
DFS Code
494
Has Path Problem
495
Disconnected Components
496
Cycle in Graphs
497
Cycle Detection (Undirected)
498
Cycle Detection Code (Undirected)
499
Undirected approach for Directed
500
Cycle Detection (Directed)
501
Cycle Detection Code (Directed)
502
Cycle Detection Dry Run (Directed)
503
Bipartite Graph
504
Bipartite Graph (Code)
505
Bipartite Graph (Approach 2)
506
All Paths Problem
507
What is Topological Sorting?
508
Topological Sorting (DFS)
509
Topological Sorting Code (DFS)
510
Course Schedule I
511
Course Schedule II
512
Kahn's Algorithm (Indegree)
513
Topoplogical Sorting (Kahn's Algorithm)
514
Kahn's Algorithm Code
515
Kahn's Algo for Cycle Detection
516
Dijkstra's Algorithm (Edge Relaxation)
517
Dijkstra's Algorithm (Approach)
518
Dijkstra's Algorithm (Code)
519
BellmanFord Algorithm (Approach)
520
BellmanFord Algorithm (Code)
521
What is MST?
522
Prim's Algorithm
523
Prim's Algorithm (Code)
524
Min Cost to Connect Points
525
Cheapest Flights within K Stops
526
Cheapest Flights (Code)
527
Disjoint Set (Union Find)
528
Disjoint Set (Code)
529
Kruskal's Algorithm
530
Kruskal's Algorithm (Code)
531
Flood Fill Algorithm
532
Flood Fill (Code)
533
DP Introduction
534
DP using Fibonacci Concept
535
What is DP?
536
Fibonacci using Tabulation
537
Types of DP
538
Important DP Concepts
539
Climbing Stairs (Recursion)
540
Climbing Stairs (Memoization)
541
Climbing Stairs (Tabulation)
542
Variation of Climbing Stairs
543
Knapsack Problems
544
0-1 Knapsack
545
0-1 Knapsack (Recursion Code)
546
0-1 Knapsack (Memoization)
547
0-1 Knapsack (Tabulation)
548
Target Sum Subset
549
Unbounded Knapsack
550
Coin Change Problem
551
Coin Change (Code)
552
Rod Cutting Problem
553
Rod Cutting (Code)
554
Longest Common Subsequence
555
LCS (Memoization)
556
LCS (Tabulation)
557
Longest Common Substring
558
Longest Common Substring (Code)
559
Longest Increasing Subsequence
560
Longest Increasing Subsequence (Code)
561
Edit Distance
562
Edit Distance (Code)
563
WildCard Matching
564
WildCard Matching (Bottom Up)
565
Catalan's Number
566
Nth Catalan (Recursion)
567
Nth Catalan (Memoization)
568
Nth Catalan (Tabulation)
569
Count BSTs from Nodes
570
Mountain Ranges
571
Matrix Concepts (Basic Math)
572
Matrix Chain Multiplication
573
MCM (with Recursion)
574
MCM Code (Recursion)
575
MCM (Memoization)
576
MCM (Tabulation)
577
MCM Code (Tabulation)
578
Minimum Partitioning
579
Minimum Partitioning (Code)
580
Segment Trees Introduction
581
Meaning & Count of Nodes
582
Creating Segment Tree
583
Creating Segment Tree (Approach)
584
Creating Segment Tree (Code)
585
Queries on Segment Tree
586
Queries on Segment Tree (Code)
587
Update on Segment Tree
588
Update on Segment Tree (Code)
589
Range Max ST (Creation)
590
Range Max ST (Query)
591
Range Max ST (Update)
592
Range Min (Approach)
Requirements
- Basic computer knowledge
- Internet connection for video streaming
- Code editor (VS Code recommended)
- Motivation to learn and practice
Course Features
Lifetime Access
Certificate of Completion
Mobile and Desktop Access
Downloadable Resources
Community Support
₹0
View Course4.9 (487 reviews)
Course Details
Duration8h 59m
LevelAdvanced
LanguageHinglish
Students946
Updated2025-10-20
Similar Courses in this Category
Namaste DSA
From zero to hero in Data Structures & Algorithms. Structured, hands-on, problem-solving heavy course which aims at giving you huge conceptual clarity and interview-readiness. :contentReference[oaicite:2]{index=2}
Akshay Saini4.9
Strivers-A2Z-DSA
Learn Strivers A2Z-DSA Course | DSA Playlist | Placements by take U forward with comprehensive video tutorials and hands-on projects.
Take U Forward4.9
Rohit-Negi-DSA
Learn Rohit Negi DSA Course with comprehensive video tutorials and hands-on projects.
Rohit Negi5.0
SIGMA-9-JAVA
Learn SIGMA - 9 JAVA DSA by Apna college with comprehensive video tutorials and hands-on projects.
Apna College4.5
Ready to Start Learning?
Join thousands of students who have already enrolled in this course.
Start Learning Now