00:00
00:00
Master DSA in C++: Ace Coding Interviews 2025
Focused View
26:27:23
001 Installing Code Blocks - 1.mp4
08:32
002 Installing Code Blocks - 2.mp4
08:26
001 1.1-array-intro.txt.txt
001 Arrays Introduction.mp4
23:06
002 2.1-sum-of-array.txt.txt
002 Problem Sum of Array Elements.mp4
06:22
003 3.1-largest-in-array.txt.txt
003 Problem Largest Element in Array.mp4
13:11
004 4.1-swap-2-numbers.txt.txt
004 Problem Swap 2 numbers.mp4
09:40
005 5.1-reverse-print.txt.txt
005 Problem Print Array in Reverse Order.mp4
05:30
006 6.1-reverse-array.txt.txt
006 Problem Reverse Array.mp4
09:13
007 7.1-runtime.txt.txt
007 Segmentation Fault in Array.mp4
03:45
001 Introduction.mp4
14:42
002 Length of String.mp4
05:56
003 cin.getline().mp4
19:02
004 Reverse string.mp4
11:15
005 Inbuilt functions.mp4
34:18
006 Print all prefixes.mp4
09:24
001 Introduction to 2D Arrays.mp4
21:47
003 How 2D Arrays are stored in Memory.mp4
18:20
001 1-string.txt
001 String.mp4
33:41
001 Introduction to OOPS.mp4
10:21
002 Creating objects.mp4
24:32
003 Getters and Setters.mp4
14:34
004 Constructors.mp4
19:06
005 Constructor and this keyword.mp4
20:25
006 Copy Constructor.mp4
10:56
007 Copy Assignment Operator & Destructor.mp4
15:29
008 Play with Constructor.mp4
05:16
009 Fraction Class.mp4
23:15
010 Fraction Class Continuation.mp4
09:57
011 Complex Number Class.mp4
06:43
001 Shallow and Deep Copy.mp4
15:03
002 Our Own Copy Constructor.mp4
13:51
003 Initialisation List.mp4
17:25
004 Constant Function.mp4
11:54
004 fraction.txt
004 fractionUse.txt
005 Static Members.mp4
22:05
006 Operator Overloading - 1.mp4
19:46
007 Operator Overloading - 2.mp4
30:44
008 Operator Overloading - 3.mp4
18:16
009 Dynamic Array Class.mp4
39:55
001 48-vectors.txt
001 Vectors.mp4
27:36
002 Vector Quiz.html
003 Spiral Order Matrix.mp4
18:30
001 1.1-selection-sort.txt.txt
001 Selection Sort Algorithm ( Explain + Code ).mp4
30:49
002 2.1-bubble-sort.txt.txt
002 Bubble Sort Algorithm ( Explain + Code ).mp4
21:34
003 3.1-optimised-bubble-sort.txt.txt
003 Optimized Bubble Sort Algorithm (Explain + Code ).mp4
08:08
004 4.1-inbuilt-sort.txt.txt
004 Inbuilt Sort Standard Template Library (STL).mp4
06:31
001 1.1-linear-search.txt.txt
001 Linear Search Algorithm ( Explain + Code ).mp4
15:17
002 Problem with Linear Search.mp4
02:31
003 3.1-binary-search.txt.txt
003 Binary Search Algorithm (Explain).mp4
16:54
004 4.2-binary-search.txt.txt
004 Binary Search Algorithm (Code).mp4
15:13
001 Introduction to recursion.mp4
23:12
001 factorial.txt
002 Recursion and PMI.mp4
16:16
002 factorial.txt
003 Fibonacci Number.mp4
10:24
003 Fibonaci.txt
004 Power.mp4
05:52
004 power.txt
005 Print Numbers.mp4
14:44
005 print-numbers.txt
006 Numbers of Digits.mp4
11:18
006 count.txt
007 Sum of Digits.mp4
09:37
007 sum-of-digits.txt
008 Multiplication.mp4
10:00
008 multiplication.txt
009 Count Zeroes.mp4
09:01
009 count-zeroes.txt
010 Geometric Sum.mp4
08:33
010 Geometric-Sum.txt
001 1-Check-if-Array-is-sorted.txt
001 Check if Array is sorted.mp4
26:55
002 2-Sum-of-Array.txt
002 Sum of Array.mp4
18:50
003 Check if element is present.mp4
27:53
004 4-First-Index-of-element.txt
004 First Index of element.mp4
09:50
005 5-Last-Index-of-element.txt
005 Last Index of element.mp4
27:41
006 6-Print-All-position-of-element.txt
006 Print All position of element.mp4
05:20
007 7-Count-Occurence-of-element-First-Approach.txt
007 Count Occurrence of element- First Approach.mp4
04:57
008 8-Count-Occurence-of-element-Second-Approach.txt
008 Count Occurrence of element- Second Approach.mp4
05:28
009 9-Store-All-Position-of-element.txt
009 Store All Position of element.mp4
15:52
010 10-Check-Palindrome.txt
010 Check Palindrome.mp4
11:47
001 1-print-and-reverse-print.txt
001 Print and Reverse Print Recursively.mp4
07:04
002 2-Length-Recursively.txt
002 Length Recursively.mp4
04:51
003 3-Replace-Character-Recursively.txt
003 Replace Character Recursively.mp4
06:58
004 4-Remove-Character.txt
004 Remove Character Recursively.mp4
10:03
005 5-Remove-Consecutive-Duplicates.txt
005 Remove Consecutive Duplicates.mp4
09:36
006 6-Print-All-Subsequences-of-String.txt
006 Print All Subsequences of String.mp4
21:04
007 7-Store-All-Subsequences-of-String.txt
007 Store All Subsequences of String.mp4
03:08
008 8-Convert-String-to-Integer.txt
008 Convert String to Integer.mp4
11:16
009 9-Print-All-Permutation-of-String.txt
009 Print All Permutation of String.mp4
10:56
010 10-Staircase-Problem.txt
010 Staircase Problem.mp4
11:19
011 11-Tower-of-Hanoi.txt
011 Tower of Hanoi.mp4
10:14
012 12-Print-Steps-in-Tower-of-Hanoi.txt
012 Print Steps in Tower of Hanoi.mp4
11:21
001 1-Merge-Sort-Introduction.txt
001 Merge Sort Introduction.mp4
14:38
002 2-Merge-Sort-Solution.txt
002 Merge Sort Solution.mp4
16:29
003 1-Quick-Sort-Introduction.txt
003 Quick Sort Introduction.mp4
13:52
004 2-Quick-Sort-Solution.txt
004 Quick Sort Solution.mp4
10:52
005 3-Quick-Sort-Checking.txt
005 Quick Sort Testing.mp4
01:40
001 1-Experimental-Analysis.txt
001 Experimental Analysis.mp4
15:30
002 Theoretical Analysis.mp4
15:23
003 Linear Search Time Complexity.mp4
03:20
004 Selection Sort Time Complexity.mp4
04:52
005 Theoretical Analysis Recursive Algorithm.mp4
11:55
006 Merge Sort Time Complexity.mp4
07:45
007 Fibonacci Time Complexity.mp4
12:27
008 Space Complexity Analysis.mp4
17:43
009 Merge Sort Space Complexity.mp4
05:43
010 Fibonacci Space Complexity.mp4
04:30
011 Time & Space Complexity Quiz.html
001 Find First & Last Occurence.mp4
24:20
002 15-Search-in-Rotated-Sorted-Array.txt
002 Search in Rotated Sorted Array.mp4
20:25
001 43-majority-element.txt
001 Majority Element.mp4
25:46
001 Introduction.mp4
02:26
001 2-What-is-LinkedList.txt
001 What is Linked List.mp4
18:22
002 3-Print-a-Linked-List.txt
002 Print a Linked List.mp4
29:34
003 Linked List Quiz 1.html
004 4-takeInput.txt
004 Taking Input - 1.mp4
27:50
005 5-takeInput2.txt
005 Taking Input - 2.mp4
10:44
006 6-length.txt
006 Length.mp4
11:50
007 7-printIthNode.txt
007 Print ith Node.mp4
26:15
008 Question Insert Node at ith position.mp4
07:24
009 9-insert-node-at-ith-position.txt
009 Solution Insert Node at ith position.mp4
27:41
010 Question Delete ith Node.mp4
05:22
011 11-deleteithNode-solution-with-memory-leak.txt
011 Solution with Memory Leak Delete ith Node.mp4
21:18
012 12deleteithNode-solution-without-memory-leak.txt
012 Solution without Memory Leak Delete ith Node.mp4
11:21
More details
Course Overview
This comprehensive C++ course teaches you to master data structures and algorithms from scratch, with hands-on coding exercises to prepare you for top tech company interviews.
What You'll Learn
- Implement essential data structures like arrays, linked lists, and trees
- Master sorting algorithms and time complexity analysis
- Solve complex problems using recursion and advanced algorithms
Who This Is For
- C++ developers preparing for technical interviews
- Computer science students mastering DSA fundamentals
- Self-taught programmers strengthening problem-solving skills
Key Benefits
- Step-by-step solutions to FAANG interview questions
- Practical coding exercises with immediate feedback
- Comprehensive coverage from basic to advanced concepts
Curriculum Highlights
- Core data structures implementation
- Algorithm design and optimization
- Interview problem-solving strategies
Focused display
Category
- language english
- Training sessions 110
- duration 26:27:23
- Release Date 2025/04/19
