🌐 AI搜索 & 代理 主页
Skip to content

Access comprehensive C++ Data Structures and Algorithms course materials, including code samples, assignments, and homework questions, meticulously curated by Coder Army - Rohit Negi.

Notifications You must be signed in to change notification settings

ArhanBytes/Rohit-Negi-CPP-DSA-Course

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Rohit-Negi-CPP-DSA-Course

Checkout Homework Quetions From HERE 👈

Lectures HERE
Lecture 01: Introduction To Programming for Beginners L1
Lecture 02: Introduction to FlowCharts and PseudoCode L2
Lecture 03: Start C++ from Zero L3
Lecture 04: If Else Statement And Loop in C++ L4
Lecture 05: For Loop in c++ Advance L5
Lecture 06: Solve Pattern Problems (Part 1) L6
Lecture 07: Solve Pattern Problems (Part 2) L7
Lecture 08: Solve Pattern Problems (Part 3) L8
Lecture 09: Solve Pattern Problems (Part 4) L9
Lecture 10: Operators in C++ L10
Lecture 11: While , Do while Loop , Switch, Break, Continue L11
Lecture 12: Conversions L12
Lecture 13: Leetcode Quetions L13
Lecture 14: Functions L14
Lecture 15: C++ Series End here L15
Lecture 16: Introduction To Arrays L16
Lecture 17: Master Arrays By Solving Problems L17
Lecture 18: Time and Space Complexity L18
Lecture 19: SELECTION SORT L19
Lecture 20: BUBBLE SORT L20
Lecture 21: INSERTION SORT L21
Lecture 22: Binary Search L22
Lecture 23: Binary Search Problems (Part 1) L23
Lecture 24: Binary Search Problems (Part 2) L24
Lecture 25: Binary Search Problems (Part 3) L25
Lecture 26: Binary Search Problems (Part 4) L26
Lecture 27: What is STL & Vector in C++ L27
Lecture 28: Two Pointer in C++ L28
Lecture 29: Kadane's Algorithm L29
Lecture 30: Trapping Rain Water - 3 SUM - 4 SUM L30
Lecture 31: Introduction To 2D Arrays L31
Lecture 32: 2D Arrays Interview Problems L32
Lecture 33: Rotate Matrix L33
Lecture 34: Binary Search in 2D Arrays L34
Lecture 35: Array Hard Problems L35
Lecture 36: Introductions To STRINGS in C++ L36
Lecture 37: String Interviews Problems and Sort a String L37
Lecture 38: Longest Palindrome and Sorting the Sentence L38
Lecture 39: Strings Interview Problems on LeetCode L39
Lecture 40: Factorial & Integer to Roman & Roman to Integer L40
Lecture 41: Sliding Window Protocol on Strings L41
Lecture 42: KMP Algorithm & Longest Prefix Suffix L42
Lecture 43: String Matching & KMP Algorithm L43
Lecture 44: Strings HARD Problems For Coding Round L44
Lecture 45: Introduction to Pointers in C++ L45
Lecture 46: Pointers Relationship with array & Arithmetic Pointers L46
Lecture 47: Pointers with Character Arrays and Functions L47
Lecture 48: Double Pointer and Multiple Pointers in C++ L48
Lecture 49: Memory Management & Static vs Dynamic Memory L49
Lecture 50: Dynamic Memory Allocation of 2D and 3D Arrays L50
Lecture 51: Introduction To Recursion From Basic To Advance L51
Lecture 52: How To Solve Recursion Problem from 4 different Method L52
Lecture 53: Recursion Basic Problems L53
Lecture 54: Recursion Problems on Leetcode L54
Lecture 56: Recursion in Strings L56
Lecture 57: Recursion in Binary Search L57
Lecture 58: Time Complexity and Space Complexity in Recursion -
Lecture 59: Merge Sort Algorithm L59
Lecture 60: Quick Sort Algorithm L60
Lecture 61: Recursion on Subsequence & Generate Parenthesis L61
Lecture 62: Recursion on Subset Sum & Target Sum L62
Lecture 63: Perfect Sum Problem & Target Sum with Repetition L63
Lecture 64: Permutation of Arrays and Strings L64
Lecture 65: Permutation with repetition & Ways to Sum N L65
Lecture 66: Tower of Hanoi L66
Lecture 67: Josephus Problem & Predict the winner L67
Lecture 68: Recursion Rat in a Maze Problem L68
Lecture 69: Print N-bit binary numbers L69
Lecture 70: Object Oriented Programming in C++ L70
Lecture 71: Constructor and Destructor in C++ L71
Lecture 72: Static data Member, Function and Encapsulation L72
Lecture 73: Inheritance & Access Modifier & Real Life Example L73
Lecture 74: Type of Inheritance in C++ L74
Lecture 75: Polymorphism and Virtual Function in C++ L75
Lecture 76: Exception Handling in C++ L76
Lecture 77: File Handling in C++ L77
Lecture 78: Introduction To Linked List L78
Lecture 79: Deletion in a Singly Linked List L79
Lecture 80: Reverse a LL & Middle of LL & Rotate LL L80
Lecture 81: Linked List LeetCode Problem L81
Lecture 82: Introduction to Doubly Linked List L82
Lecture 83: Remove Duplicates & Merge 2 Sorted LinkedList & Sort a LinkedList L83
Lecture 84: Circular Linked List: Detect Loop & Find Length of Loop L84
Lecture 85: Hard Problem: Detect and Remove Loop in LinkedList L85
Lecture 86: Add two numbers & Reverse a Linked List in groups L86
Lecture 87: Hard Problem on Linked List: Flattening and Merge K Sorted L87
Lecture 88: Clone a linked list with next and random pointer L88
Lecture 89: Introduction To STACK & Implementation L89
Lecture 90: Stack Basic Problems L90
Lecture 91: Stack Problems: Next Greater - Smaller Element L91
Lecture 92: Stack Problems - Largest Rectangle in Histogram & More L92
Lecture 93: The Celebrity Problem L93
Lecture 94: Max of min for every windowsize & Get Minimum... L94
Lecture 95: Implement two stacks & N Stack in an Array L95
Lecture 96: Queue & Its Implementation & Circular Queue L96
Lecture 97: Implement Queue using Stack & Stack using Queue L97
Lecture 98: Queues with Sliding Window Problems L98
Lecture 99: Introduction to Deque and implementation L99
Lecture 100: Queue Hard: Sliding Window L100
Lecture 101: Introduction To Trees L101
Lecture 102: Binary Tree in Data Structure & Binary Tree Traversal L102
Lecture 103: Binary Tree Problems for Technical Interview L103
Lecture 104: Binary Tree Problems: Mirror Tree - Cousins - Balance - Spiral Form L104
Lecture 105: Left - Right - Top - Bottom view of Binary tree L105
Lecture 106: Preorder - Postorder - Inorder traversal (iterative) of Binary tree L106
Lecture 107: Construct Tree from Inorder - Preorder and Postorder - Inorder L107