Data Structures and Algorithms C++ : Zero to Mastery in 2025

سرفصل های دوره

Ace the Google, Amazon, Facebook, Microsoft, Netflix coding interviews. Step by step guide for their toughest questions!

01 - Installing Code Blocks

001 Installing Code Blocks - 1

002 Installing Code Blocks - 2

02 - DS Arrays

001 1.1-array-intro.txt.txt

001 Arrays Introduction

002 2.1-sum-of-array.txt.txt

002 Problem Sum of Array Elements

003 3.1-largest-in-array.txt.txt

003 Problem Largest Element in Array

004 4.1-swap-2-numbers.txt.txt

004 Problem Swap 2 numbers

005 5.1-reverse-print.txt.txt

005 Problem Print Array in Reverse Order

006 6.1-reverse-array.txt.txt

006 Problem Reverse Array

007 7.1-runtime.txt.txt

007 Segmentation Fault in Array

03 - DS Character Array

001 Introduction

002 Length of String

003 cin.getline()

004 Reverse string

005 Inbuilt functions

006 Print all prefixes

04 - DS Matrix or 2D Array

001 Introduction to 2D Arrays

003 How 2D Arrays are stored in Memory

05 - DS String

001 1-string.txt

001 String

06 - OOPS - Basics

001 Introduction to OOPS

002 Creating objects

003 Getters and Setters

004 Constructors

005 Constructor and this keyword

006 Copy Constructor

007 Copy Assignment Operator & Destructor

008 Play with Constructor

009 Fraction Class

010 Fraction Class Continuation

011 Complex Number Class

07 - OOPS-Advanced

001 Shallow and Deep Copy

002 Our Own Copy Constructor

003 Initialisation List

004 Constant Function

004 fraction.txt

004 fractionUse.txt

005 Static Members

006 Operator Overloading - 1

007 Operator Overloading - 2

008 Operator Overloading - 3

009 Dynamic Array Class

08 - DS Vectors

001 48-vectors.txt

001 Vectors

002 Vector Quiz.html

003 Spiral Order Matrix

09 - Basic Sorting Algorithm

001 1.1-selection-sort.txt.txt

001 Selection Sort Algorithm ( Explain + Code )

002 2.1-bubble-sort.txt.txt

002 Bubble Sort Algorithm ( Explain + Code )

003 3.1-optimised-bubble-sort.txt.txt

003 Optimized Bubble Sort Algorithm (Explain + Code )

004 4.1-inbuilt-sort.txt.txt

004 Inbuilt Sort Standard Template Library (STL)

10 - Binary Search Algorithm

001 1.1-linear-search.txt.txt

001 Linear Search Algorithm ( Explain + Code )

002 Problem with Linear Search

003 3.1-binary-search.txt.txt

003 Binary Search Algorithm (Explain)

004 4.2-binary-search.txt.txt

004 Binary Search Algorithm (Code)

11 - Recursion - 1 Basics

001 Introduction to recursion

001 factorial.txt

002 Recursion and PMI

002 factorial.txt

003 Fibonacci Number

003 Fibonaci.txt

004 Power

004 power.txt

005 Print Numbers

005 print-numbers.txt

006 Numbers of Digits

006 count.txt

007 Sum of Digits

007 sum-of-digits.txt

008 Multiplication

008 multiplication.txt

009 Count Zeroes

009 count-zeroes.txt

010 Geometric Sum

010 Geometric-Sum.txt

12 - Recursion - 2 Intermediate

001 1-Check-if-Array-is-sorted.txt

001 Check if Array is sorted

002 2-Sum-of-Array.txt

002 Sum of Array

003 Check if element is present

004 4-First-Index-of-element.txt

004 First Index of element

005 5-Last-Index-of-element.txt

005 Last Index of element

006 6-Print-All-position-of-element.txt

006 Print All position of element

007 7-Count-Occurence-of-element-First-Approach.txt

007 Count Occurrence of element- First Approach

008 8-Count-Occurence-of-element-Second-Approach.txt

008 Count Occurrence of element- Second Approach

009 9-Store-All-Position-of-element.txt

009 Store All Position of element

010 10-Check-Palindrome.txt

010 Check Palindrome

13 - Recursion - 3 Advanced

001 1-print-and-reverse-print.txt

001 Print and Reverse Print Recursively

002 2-Length-Recursively.txt

002 Length Recursively

003 3-Replace-Character-Recursively.txt

003 Replace Character Recursively

004 4-Remove-Character.txt

004 Remove Character Recursively

005 5-Remove-Consecutive-Duplicates.txt

005 Remove Consecutive Duplicates

006 6-Print-All-Subsequences-of-String.txt

006 Print All Subsequences of String

007 7-Store-All-Subsequences-of-String.txt

007 Store All Subsequences of String

008 8-Convert-String-to-Integer.txt

008 Convert String to Integer

009 9-Print-All-Permutation-of-String.txt

009 Print All Permutation of String

010 10-Staircase-Problem.txt

010 Staircase Problem

011 11-Tower-of-Hanoi.txt

011 Tower of Hanoi

012 12-Print-Steps-in-Tower-of-Hanoi.txt

012 Print Steps in Tower of Hanoi

14 - Merge Sort & Quick Sort

001 1-Merge-Sort-Introduction.txt

001 Merge Sort Introduction

002 2-Merge-Sort-Solution.txt

002 Merge Sort Solution

003 1-Quick-Sort-Introduction.txt

003 Quick Sort Introduction

004 2-Quick-Sort-Solution.txt

004 Quick Sort Solution

005 3-Quick-Sort-Checking.txt

005 Quick Sort Testing

15 - Time Space Complexity Analysis

001 1-Experimental-Analysis.txt

001 Experimental Analysis

002 Theoretical Analysis

003 Linear Search Time Complexity

004 Selection Sort Time Complexity

005 Theoretical Analysis Recursive Algorithm

006 Merge Sort Time Complexity

007 Fibonacci Time Complexity

008 Space Complexity Analysis

009 Merge Sort Space Complexity

010 Fibonacci Space Complexity

011 Time & Space Complexity Quiz.html

16 - Advanced Binary Search

001 Find First & Last Occurence

002 15-Search-in-Rotated-Sorted-Array.txt

002 Search in Rotated Sorted Array

17 - Algorithm Moore Voting Majority Element

001 43-majority-element.txt

001 Majority Element

18 - What are Data Structures

001 Introduction

19 - DS Linked List - 1

001 2-What-is-LinkedList.txt

001 What is Linked List

002 3-Print-a-Linked-List.txt

002 Print a Linked List

003 Linked List Quiz 1.html

004 4-takeInput.txt

004 Taking Input - 1

005 5-takeInput2.txt

005 Taking Input - 2

006 6-length.txt

006 Length

007 7-printIthNode.txt

007 Print ith Node

008 Question Insert Node at ith position

009 9-insert-node-at-ith-position.txt

009 Solution Insert Node at ith position

010 Question Delete ith Node

011 11-deleteithNode-solution-with-memory-leak.txt

011 Solution with Memory Leak Delete ith Node

012 12deleteithNode-solution-without-memory-leak.txt

012 Solution without Memory Leak Delete ith Node

139,000 تومان

افزودن به سبد خرید

خرید دانلودی فوری

در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

تولید کننده: Udemy