{"data":{"_id":"67cd7a079d99bfb6fbc77c22","name":"DSA with C/C++","image":"/images/c++.png","price":5000,"features":["Comprehensive Coverage"," Hands-on Coding ","Algorithm Optimization","Real-world Applications","Interview Preparation","Projects & Challenges"],"tags":["Online"],"category":{"_id":"67a88e1ebd0ae54c01ff650e","name":"DSA","image":"/images/data-structure.png","description":"Master Data Structures & Algorithms and strengthen your problem-solving skills for top tech interviews. This course covers essential topics like arrays, strings, recursion, linked lists, stacks, queues, trees, graphs, and dynamic programming with a pattern-based approach. With consistent practice and interview-level problems, you will develop the ability to write efficient code and tackle complex challenges confidently."},"description":"Master Data Structures and Algorithms (DSA) with C++ in this comprehensive course designed for beginners and advanced learners. Learn how to write efficient code, solve complex problems, and ace technical interviews.","modules":[{"icon":"📘","title":"Phase 1: Fundamentals of C++ & Programming Basics (Beginner)","description":"Master Phase 1: Fundamentals of C++ & Programming Basics (Beginner) with comprehensive lessons, problem breakdowns, and interview patterns.","duration":"2 hours","order":1,"isFree":true,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-1-1","title":"1. Introduction to Programming and C++ Basics","description":"Understanding Compilation & Execution Process","duration":"30 mins","content":"## 1. Introduction to Programming and C++ Basics\n\n- Understanding Compilation & Execution Process\n- Variables, Data Types & Constants\n- Input/Output (`cin`, `cout`)\n- Operators & Expressions\n- Conditional Statements (`if-else`, `switch-case`)\n- Loops (`for`, `while`, `do-while`)\n\n### Core Concepts & Implementation\nMaster the fundamental patterns, edge cases, and algorithmic complexity of 1. Introduction to Programming and C++ Basics.\n","isFree":true,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fa84","locked":false},{"id":"sub-1-2","title":"2. Functions & Recursion","description":"Function Definition, Scope, and Lifetime of Variables","duration":"30 mins","content":"## 2. Functions & Recursion\n\n- Function Definition, Scope, and Lifetime of Variables\n- Call by Value vs Call by Reference\n- Inline Functions & Default Arguments\n- Recursion Basics\n- Recursive vs Iterative Approach\n- Backtracking using Recursion\n\n### Core Concepts & Implementation\nMaster the fundamental patterns, edge cases, and algorithmic complexity of 2. Functions & Recursion.\n","isFree":true,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fa85","locked":false},{"id":"sub-1-3","title":"3. Arrays & Strings (1D & 2D)","description":"Declaration & Initialization","duration":"30 mins","content":"## 3. Arrays & Strings (1D & 2D)\n\n- Declaration & Initialization\n- Traversing & Manipulation\n- Searching (Linear Search, Binary Search)\n- Sorting (Bubble, Selection, Insertion)\n- Two Pointers Approach\n- String Operations (`strlen`, `strcpy`, `strcmp`)\n\n### Core Concepts & Implementation\nMaster the fundamental patterns, edge cases, and algorithmic complexity of 3. Arrays & Strings (1D & 2D).\n","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fa86","locked":false}],"_id":"6ae3fd95868676351fe4fa83","locked":false},{"icon":"⚡","title":"Phase 2: Data Structures (Core DSA)","description":"Master Phase 2: Data Structures (Core DSA) with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":2,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-2-1","title":"4. Advanced Sorting Algorithms","description":"Merge Sort","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fa88","locked":true},{"id":"sub-2-2","title":"5. Linked List (Singly, Doubly, Circular)","description":"Insertion, Deletion, Traversal","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fa89","locked":true},{"id":"sub-2-3","title":"6. Stack & Queue","description":"Stack Operations (Push, Pop, Peek)","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fa8a","locked":true},{"id":"sub-2-4","title":"7. Recursion & Backtracking (Advanced)","description":"Tower of Hanoi","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fa8b","locked":true},{"id":"sub-2-5","title":"8. Trees (Binary Tree, BST, Heaps, Trie)","description":"Binary Tree Traversals (Inorder, Preorder, Postorder)","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4fa8c","locked":true},{"id":"sub-2-6","title":"9. Graph Theory & Algorithms","description":"Adjacency List & Adjacency Matrix","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":6,"_id":"6ae3fd95868676351fe4fa8d","locked":true}],"_id":"6ae3fd95868676351fe4fa87","content":"","locked":true},{"icon":"🚀","title":"Phase 3: Algorithmic Techniques (Advanced DSA)","description":"Master Phase 3: Algorithmic Techniques (Advanced DSA) with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"2 hours","order":3,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-3-1","title":"10. Dynamic Programming (DP) Concepts","description":"Recursion vs DP","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fa8f","locked":true},{"id":"sub-3-2","title":"11. Greedy Algorithms","description":"Activity Selection Problem","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fa90","locked":true},{"id":"sub-3-3","title":"12. Bit Manipulation","description":"XOR Trick","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fa91","locked":true}],"_id":"6ae3fd95868676351fe4fa8e","content":"","locked":true}],"details":[{"label":"Phase 1: Fundamentals of C++ & Programming Basics (Beginner)","content":[{"title":"1. Introduction to Programming and C++ Basics","description":"- Understanding Compilation & Execution Process\n- Variables, Data Types & Constants\n- Input/Output (`cin`, `cout`)\n- Operators & Expressions\n- Conditional Statements (`if-else`, `switch-case`)\n- Loops (`for`, `while`, `do-while`)","_id":"67cd87eeb515087761dbd708","locked":false},{"title":"2. Functions & Recursion","description":"- Function Definition, Scope, and Lifetime of Variables\n- Call by Value vs Call by Reference\n- Inline Functions & Default Arguments\n- Recursion Basics\n- Recursive vs Iterative Approach\n- Backtracking using Recursion","_id":"67db123a07275486447376e2","locked":false},{"title":" 3. Arrays & Strings (1D & 2D)","description":"- Declaration & Initialization\n- Traversing & Manipulation\n- Searching (Linear Search, Binary Search)\n- Sorting (Bubble, Selection, Insertion)\n- Two Pointers Approach\n- String Operations (`strlen`, `strcpy`, `strcmp`)","_id":"67db123a07275486447376e3","locked":false}],"_id":"67cd87eeb515087761dbd707"},{"label":"Phase 2: Data Structures (Core DSA)","content":[{"title":"4. Advanced Sorting Algorithms","description":"- Merge Sort\n- Quick Sort\n- Heap Sort\n- Counting Sort, Radix Sort","_id":"67db123a07275486447376e5","locked":false},{"title":" 5. Linked List (Singly, Doubly, Circular)","description":"- Insertion, Deletion, Traversal\n- Reversing a Linked List\n- Detect & Remove Loops (Floyd’s Cycle Detection)\n- Merging & Sorting Linked Lists\n- Implementing Stack & Queue using Linked List","_id":"67db123a07275486447376e6","locked":false},{"title":"6. Stack & Queue","description":"- Stack Operations (Push, Pop, Peek)\n- Infix to Postfix Conversion\n- Balanced Parentheses Problem\n- Queue Operations (Enqueue, Dequeue)\n- Circular Queue\n- Priority Queue\n- Deque (Double-Ended Queue)","_id":"67db123a07275486447376e7","locked":false},{"title":"7. Recursion & Backtracking (Advanced)","description":"- Tower of Hanoi\n- N-Queens Problem\n- Sudoku Solver\n- Word Search","_id":"67db123a07275486447376e8","locked":false},{"title":" 8. Trees (Binary Tree, BST, Heaps, Trie)","description":"- Binary Tree Traversals (Inorder, Preorder, Postorder)\n- Binary Search Tree (BST) Operations\n- Lowest Common Ancestor (LCA)\n- AVL Trees & Balancing\n- Heap Operations (Min-Heap, Max-Heap)\n- Trie Data Structure & String Matching","_id":"67db123a07275486447376e9","locked":false},{"title":" 9. Graph Theory & Algorithms","description":"- Adjacency List & Adjacency Matrix\n- BFS & DFS Traversal\n- Dijkstra’s Algorithm (Shortest Path)\n- Bellman-Ford Algorithm\n- Floyd-Warshall Algorithm\n- Topological Sorting\n- Minimum Spanning Tree (Kruskal & Prim)\n- Cycle Detection (Directed & Undirected)\n- Bridges & Articulation Points","_id":"67db123a07275486447376ea","locked":false}],"_id":"67db123a07275486447376e4"},{"label":"Phase 3: Algorithmic Techniques (Advanced DSA)","content":[{"title":"10. Dynamic Programming (DP) Concepts","description":"- Recursion vs DP\n- Memoization & Tabulation\n- Fibonacci Number using DP\n- Longest Common Subsequence (LCS)\n- Longest Increasing Subsequence (LIS)\n- 0/1 Knapsack Problem\n- Coin Change Problem\n- Matrix Chain Multiplication\n- DP on Trees","_id":"67db123a07275486447376ec","locked":false},{"title":"11. Greedy Algorithms","description":"- Activity Selection Problem\n- Huffman Encoding\n- Fractional Knapsack\n- Job Scheduling","_id":"67db123a07275486447376ed","locked":false},{"title":"12. Bit Manipulation","description":"- XOR Trick\n- Checking Odd/Even Using Bits\n- Counting Set Bits (Brian Kernighan’s Algorithm)\n- Finding the Unique Element","_id":"67db123a07275486447376ee","locked":false}],"_id":"67db123a07275486447376eb"}],"__v":3,"slug":"dsa-with-c-c","isFree":true,"status":"published","updatedAt":"2026-10-26T17:46:01.090Z","accentColor":"#D94B56","icon":"dsa"},"message":"Course fetched successfully"}