{"data":{"_id":"67cd7adc9d99bfb6fbc77c29","name":"DSA with Python","image":"/images/python.png","price":5000,"features":["Comprehensive DSA Coverage","Hands-on Implementation"," Algorithm Optimization","Object-Oriented & Functional Approach","Interview & Competitive Programming","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 Python in this comprehensive course designed for both beginners and experienced programmers. Learn to write efficient, optimized code, improve problem-solving skills, and prepare for technical interviews.","modules":[{"icon":"📘","title":"Module 1: Introduction to DSA & Python","description":"Master Module 1: Introduction to DSA & Python with comprehensive lessons, problem breakdowns, and interview patterns.","duration":"3 hours","order":1,"isFree":true,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-1-1","title":"Algorithm vs Data Structure","description":"Understanding the difference between problem-solving steps and data organization.","duration":"30 mins","content":"## Algorithm vs Data Structure\n\nUnderstanding the difference between problem-solving steps and data organization.\n\n### Core Concepts & Implementation\nMaster the fundamental patterns, edge cases, and algorithmic complexity of Algorithm vs Data Structure.\n","isFree":true,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fa93","locked":false},{"id":"sub-1-2","title":"Importance of DSA","description":"Learning why DSA is essential for efficient coding and interviews.","duration":"30 mins","content":"## Importance of DSA\n\nLearning why DSA is essential for efficient coding and interviews.\n\n### Core Concepts & Implementation\nMaster the fundamental patterns, edge cases, and algorithmic complexity of Importance of DSA.\n","isFree":true,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fa94","locked":false},{"id":"sub-1-3","title":"Python Basics (Variables & Data Types)","description":"Introduction to core Python data types and variable handling.","duration":"30 mins","content":"## Python Basics (Variables & Data Types)\n\nIntroduction to core Python data types and variable handling.\n\n### Core Concepts & Implementation\nMaster the fundamental patterns, edge cases, and algorithmic complexity of Python Basics (Variables & Data Types).\n","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fa95","locked":false},{"id":"sub-1-4","title":"Control Flow (if-else, loops)","description":"Writing conditional and iterative logic.","duration":"30 mins","content":"## Control Flow (if-else, loops)\n\nWriting conditional and iterative logic.\n\n### Core Concepts & Implementation\nMaster the fundamental patterns, edge cases, and algorithmic complexity of Control Flow (if-else, loops).\n","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fa96","locked":false},{"id":"sub-1-5","title":"Functions & Lambda","description":"Creating reusable code blocks and anonymous functions.","duration":"30 mins","content":"## Functions & Lambda\n\nCreating reusable code blocks and anonymous functions.\n\n### Core Concepts & Implementation\nMaster the fundamental patterns, edge cases, and algorithmic complexity of Functions & Lambda.\n","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4fa97","locked":false},{"id":"sub-1-6","title":"Python Collections (List, Set, Dict, Tuple)","description":"Using built-in data structures effectively.","duration":"30 mins","content":"## Python Collections (List, Set, Dict, Tuple)\n\nUsing built-in data structures effectively.\n\n### Core Concepts & Implementation\nMaster the fundamental patterns, edge cases, and algorithmic complexity of Python Collections (List, Set, Dict, Tuple).\n","isFree":false,"isPublished":true,"order":6,"_id":"6ae3fd95868676351fe4fa98","locked":false}],"_id":"6ae3fd95868676351fe4fa92","locked":false},{"icon":"⚡","title":"Module 2: Time & Space Complexity ","description":"Master Module 2: Time & Space Complexity  with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"2 hours","order":2,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-2-1","title":"Big-O Notation","description":"Measuring the efficiency of algorithms in the worst case.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fa9a","locked":true},{"id":"sub-2-2","title":"Time vs Space Trade-off","description":"Balancing memory usage with execution time.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fa9b","locked":true},{"id":"sub-2-3","title":"Complexity Classes","description":"Understanding common growth rates like O(1), O(n), O(log n).","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fa9c","locked":true},{"id":"sub-2-4","title":"Loop & Recursion Analysis","description":"Evaluating performance of iterative and recursive solutions.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fa9d","locked":true}],"_id":"6ae3fd95868676351fe4fa99","content":"","locked":true},{"icon":"🚀","title":"Module 3: Recursion & Backtracking","description":"Master Module 3: Recursion & Backtracking with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":3,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-3-1","title":"Base Case & Recursive Case","description":"Defining stopping conditions and recursive calls.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fa9f","locked":true},{"id":"sub-3-2","title":"Call Stack","description":"Understanding how recursive calls are managed internally.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4faa0","locked":true},{"id":"sub-3-3","title":"Backtracking Framework","description":"Exploring all possible solutions systematically.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4faa1","locked":true},{"id":"sub-3-4","title":"Subsets & Permutations","description":"Generating combinations and arrangements.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4faa2","locked":true},{"id":"sub-3-5","title":"N-Queens Problem","description":"Solving constraint-based placement problems.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4faa3","locked":true},{"id":"sub-3-6","title":"Sudoku Solver","description":"Applying recursion with constraints.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":6,"_id":"6ae3fd95868676351fe4faa4","locked":true}],"_id":"6ae3fd95868676351fe4fa9e","content":"","locked":true},{"icon":"🚀","title":"Module 4: Arrays & Strings","description":"Master Module 4: Arrays & Strings with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":4,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-4-1","title":"Array Traversal & Operations","description":"Iterating and modifying array elements.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4faa6","locked":true},{"id":"sub-4-2","title":"Two Pointer Technique","description":"Solving problems using dual indices.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4faa7","locked":true},{"id":"sub-4-3","title":"Sliding Window","description":"Optimizing subarray and substring problems.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4faa8","locked":true},{"id":"sub-4-4","title":"Prefix Sum","description":"Precomputing sums for efficient queries.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4faa9","locked":true},{"id":"sub-4-5","title":"String Manipulation","description":"Handling substrings, slicing, and concatenation.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4faaa","locked":true},{"id":"sub-4-6","title":"Pattern Problems (Anagram, Palindrome)","description":"Solving common string-based problems.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":6,"_id":"6ae3fd95868676351fe4faab","locked":true}],"_id":"6ae3fd95868676351fe4faa5","content":"","locked":true},{"icon":"🚀","title":"Module 5: Linked Lists","description":"Master Module 5: Linked Lists with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":5,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-5-1","title":"Node Structure & Traversal","description":"Understanding nodes and iterating through lists.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4faad","locked":true},{"id":"sub-5-2","title":"Insertion & Deletion","description":"Adding and removing elements efficiently.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4faae","locked":true},{"id":"sub-5-3","title":"Reverse Linked List","description":"Reversing pointers iteratively and recursively.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4faaf","locked":true},{"id":"sub-5-4","title":"Cycle Detection","description":"Detecting loops using fast and slow pointers.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fab0","locked":true},{"id":"sub-5-5","title":"Merge Sorted Lists","description":"Combining two sorted linked lists.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4fab1","locked":true}],"_id":"6ae3fd95868676351fe4faac","content":"","locked":true},{"icon":"🚀","title":"Module 6: Stacks & Queues","description":"Master Module 6: Stacks & Queues with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":6,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-6-1","title":"Stack Implementation","description":"Implementing LIFO structure using Python.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fab3","locked":true},{"id":"sub-6-2","title":"Queue Implementation","description":"Implementing FIFO structure and its variations.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fab4","locked":true},{"id":"sub-6-3","title":"Balanced Parentheses","description":"Using stacks for validation problems.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fab5","locked":true},{"id":"sub-6-4","title":"Monotonic Stack","description":"Solving next greater/smaller element problems.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fab6","locked":true},{"id":"sub-6-5","title":"Sliding Window Maximum","description":"Efficiently finding max/min in a window.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4fab7","locked":true}],"_id":"6ae3fd95868676351fe4fab2","content":"","locked":true},{"icon":"🚀","title":"Module 7: Trees ","description":"Master Module 7: Trees  with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":7,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-7-1","title":"Tree Terminology","description":"Understanding nodes, height, depth, and structure.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fab9","locked":true},{"id":"sub-7-2","title":"Tree Traversals (DFS & BFS)","description":"Visiting nodes in different orders.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4faba","locked":true},{"id":"sub-7-3","title":"Binary Search Tree Operations","description":"Insert, search, and delete operations.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fabb","locked":true},{"id":"sub-7-4","title":"Height & Diameter","description":"Measuring tree properties.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fabc","locked":true},{"id":"sub-7-5","title":"Lowest Common Ancestor","description":"Finding shared ancestors of nodes.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4fabd","locked":true}],"_id":"6ae3fd95868676351fe4fab8","content":"","locked":true},{"icon":"🚀","title":"Module 8: Heaps & Priority Queues","description":"Master Module 8: Heaps & Priority Queues with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":8,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-8-1","title":"Heap Types (Min & Max Heap)","description":"Understanding heap ordering.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fabf","locked":true},{"id":"sub-8-2","title":"Heap Operations","description":"Insert, delete, and heapify operations.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fac0","locked":true},{"id":"sub-8-3","title":"Kth Largest Element","description":"Finding order statistics using heaps.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fac1","locked":true},{"id":"sub-8-4","title":"Top K Frequent Elements","description":"Identifying frequent elements efficiently.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fac2","locked":true},{"id":"sub-8-5","title":"Merge K Sorted Lists","description":"Combining multiple sorted lists using heaps.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4fac3","locked":true}],"_id":"6ae3fd95868676351fe4fabe","content":"","locked":true},{"icon":"🚀","title":"Module 9: Hashing","description":"Master Module 9: Hashing with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":9,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-9-1","title":"Hash Functions","description":"Mapping keys to indices efficiently.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fac5","locked":true},{"id":"sub-9-2","title":"Collision Handling","description":"Resolving conflicts in hash tables.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fac6","locked":true},{"id":"sub-9-3","title":"Frequency Counting","description":"Counting occurrences using hashing.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fac7","locked":true},{"id":"sub-9-4","title":"Two Sum Problem","description":"Finding pairs using hash maps.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fac8","locked":true},{"id":"sub-9-5","title":"Subarray Sum Problems","description":"Using prefix sums with hashing.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4fac9","locked":true}],"_id":"6ae3fd95868676351fe4fac4","content":"","locked":true},{"icon":"🚀","title":"Module 10: Graphs","description":"Master Module 10: Graphs with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":10,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-10-1","title":"Graph Representation","description":"Using adjacency lists and matrices.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4facb","locked":true},{"id":"sub-10-2","title":"BFS & DFS Traversal","description":"Exploring graph nodes systematically.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4facc","locked":true},{"id":"sub-10-3","title":"Cycle Detection","description":"Identifying loops in graphs.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4facd","locked":true},{"id":"sub-10-4","title":"Shortest Path (Dijkstra)","description":"Finding minimum distances between nodes.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4face","locked":true},{"id":"sub-10-5","title":"Minimum Spanning Tree","description":"Connecting nodes with minimum cost.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4facf","locked":true}],"_id":"6ae3fd95868676351fe4faca","content":"","locked":true},{"icon":"🚀","title":"Module 11: Greedy Algorithms","description":"Master Module 11: Greedy Algorithms with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"2 hours","order":11,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-11-1","title":"Greedy Strategy Concept","description":"Making optimal local choices.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fad1","locked":true},{"id":"sub-11-2","title":"Activity Selection","description":"Selecting maximum non-overlapping intervals.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fad2","locked":true},{"id":"sub-11-3","title":"Fractional Knapsack","description":"Maximizing value with fractional items.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fad3","locked":true},{"id":"sub-11-4","title":"Huffman Coding","description":"Building optimal prefix codes.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fad4","locked":true}],"_id":"6ae3fd95868676351fe4fad0","content":"","locked":true},{"icon":"🚀","title":"Module 12: Dynamic Programming ","description":"Master Module 12: Dynamic Programming  with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"3 hours","order":12,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-12-1","title":"Memoization vs Tabulation","description":"Comparing top-down and bottom-up approaches.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fad6","locked":true},{"id":"sub-12-2","title":"State & Transition Design","description":"Structuring DP solutions.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fad7","locked":true},{"id":"sub-12-3","title":"Knapsack Problem","description":"Solving optimization problems with constraints.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fad8","locked":true},{"id":"sub-12-4","title":"LCS & LIS","description":"Solving sequence-based problems.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fad9","locked":true},{"id":"sub-12-5","title":"Coin Change","description":"Finding ways and minimum coins.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":5,"_id":"6ae3fd95868676351fe4fada","locked":true}],"_id":"6ae3fd95868676351fe4fad5","content":"","locked":true},{"icon":"🚀","title":"Module 13: Advanced Topics","description":"Master Module 13: Advanced Topics with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"2 hours","order":13,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-13-1","title":"Bit Manipulation","description":"Using bitwise operations for optimization.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fadc","locked":true},{"id":"sub-13-2","title":"Trie (Prefix Tree)","description":"Efficient prefix-based searching.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fadd","locked":true},{"id":"sub-13-3","title":"Segment Tree","description":"Handling range queries efficiently.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fade","locked":true},{"id":"sub-13-4","title":"Disjoint Set Union (DSU)","description":"Managing connected components.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fadf","locked":true}],"_id":"6ae3fd95868676351fe4fadb","content":"","locked":true},{"icon":"🚀","title":"Module 14: Interview Preparation","description":"Master Module 14: Interview Preparation with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"2 hours","order":14,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-14-1","title":"Problem-Solving Patterns","description":"Mastering common coding techniques.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fae1","locked":true},{"id":"sub-14-2","title":"Binary Search","description":"Efficient searching in sorted domains.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fae2","locked":true},{"id":"sub-14-3","title":"Mock Interviews","description":"Practicing real interview scenarios.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fae3","locked":true},{"id":"sub-14-4","title":"Debugging & Optimization","description":"Improving code quality and performance.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":4,"_id":"6ae3fd95868676351fe4fae4","locked":true}],"_id":"6ae3fd95868676351fe4fae0","content":"","locked":true},{"icon":"🚀","title":"Capstone Projects","description":"Master Capstone Projects with comprehensive lessons, problem breakdowns, and interview patterns....","duration":"2 hours","order":15,"isFree":false,"isPublished":true,"isProject":false,"subsections":[{"id":"sub-15-1","title":"Coding Platform Project","description":"Building a mini problem-solving website.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3fd95868676351fe4fae6","locked":true},{"id":"sub-15-2","title":"Graph-based Route Finder","description":"Applying graph algorithms in real-world use.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3fd95868676351fe4fae7","locked":true},{"id":"sub-15-3","title":"Autocomplete System (Trie)","description":"Implementing search suggestions using Trie.","duration":"30 mins","content":"","isFree":false,"isPublished":true,"order":3,"_id":"6ae3fd95868676351fe4fae8","locked":true}],"_id":"6ae3fd95868676351fe4fae5","content":"","locked":true}],"details":[{"id":"h3pvweqa2","label":"Module 1: Introduction to DSA & Python","content":[{"title":"Algorithm vs Data Structure","description":"Understanding the difference between problem-solving steps and data organization.","_id":"69cbf752837bdb09709cb396","locked":false},{"title":"Importance of DSA","description":"Learning why DSA is essential for efficient coding and interviews.","_id":"69cc06ebae91d6af457f9054","locked":false},{"title":"Python Basics (Variables & Data Types)","description":"Introduction to core Python data types and variable handling.","_id":"69cc06ebae91d6af457f9055","locked":false},{"title":"Control Flow (if-else, loops)","description":"Writing conditional and iterative logic.","_id":"69cc06ebae91d6af457f9056","locked":false},{"title":"Functions & Lambda","description":"Creating reusable code blocks and anonymous functions.","_id":"69cc06ebae91d6af457f9057","locked":false},{"title":"Python Collections (List, Set, Dict, Tuple)","description":"Using built-in data structures effectively.","_id":"69cc06ebae91d6af457f9058","locked":false}],"_id":"69cbf752837bdb09709cb395"},{"id":"sygz4njay","label":"Module 2: Time & Space Complexity ","content":[{"title":"Big-O Notation","description":"Measuring the efficiency of algorithms in the worst case.","_id":"69cbf752837bdb09709cb398","locked":false},{"title":"Time vs Space Trade-off","description":"Balancing memory usage with execution time.","_id":"69cc06ebae91d6af457f905b","locked":false},{"title":"Complexity Classes","description":"Understanding common growth rates like O(1), O(n), O(log n).","_id":"69cc06ebae91d6af457f905c","locked":false},{"title":"Loop & Recursion Analysis","description":"Evaluating performance of iterative and recursive solutions.","_id":"69cc06ebae91d6af457f905d","locked":false}],"_id":"69cbf752837bdb09709cb397"},{"id":"xzcszipas","label":"Module 3: Recursion & Backtracking","content":[{"title":"Base Case & Recursive Case","description":"Defining stopping conditions and recursive calls.","_id":"69cc06ebae91d6af457f905f","locked":false},{"title":"Call Stack","description":"Understanding how recursive calls are managed internally.","_id":"69cc06ebae91d6af457f9060","locked":false},{"title":"Backtracking Framework","description":"Exploring all possible solutions systematically.","_id":"69cc06ebae91d6af457f9061","locked":false},{"title":"Subsets & Permutations","description":"Generating combinations and arrangements.","_id":"69cc06ebae91d6af457f9062","locked":false},{"title":"N-Queens Problem","description":"Solving constraint-based placement problems.","_id":"69cc06ebae91d6af457f9063","locked":false},{"title":"Sudoku Solver","description":"Applying recursion with constraints.","_id":"69cc06ebae91d6af457f9064","locked":false}],"_id":"69cbf752837bdb09709cb399"},{"id":"ixwc519vy","label":"Module 4: Arrays & Strings","content":[{"title":"Array Traversal & Operations","description":"Iterating and modifying array elements.","_id":"69cc06ebae91d6af457f9066","locked":false},{"title":"Two Pointer Technique","description":"Solving problems using dual indices.","_id":"69cc06ebae91d6af457f9067","locked":false},{"title":"Sliding Window","description":"Optimizing subarray and substring problems.","_id":"69cc06ebae91d6af457f9068","locked":false},{"title":"Prefix Sum","description":"Precomputing sums for efficient queries.","_id":"69cc06ebae91d6af457f9069","locked":false},{"title":"String Manipulation","description":"Handling substrings, slicing, and concatenation.","_id":"69cc06ebae91d6af457f906a","locked":false},{"title":"Pattern Problems (Anagram, Palindrome)","description":"Solving common string-based problems.","_id":"69cc06ebae91d6af457f906b","locked":false}],"_id":"69cbf752837bdb09709cb39b"},{"id":"85jcqs327","label":"Module 5: Linked Lists","content":[{"title":"Node Structure & Traversal","description":"Understanding nodes and iterating through lists.","_id":"69cc06ebae91d6af457f906d","locked":false},{"title":"Insertion & Deletion","description":"Adding and removing elements efficiently.","_id":"69cc06ebae91d6af457f906e","locked":false},{"title":"Reverse Linked List","description":"Reversing pointers iteratively and recursively.","_id":"69cc06ebae91d6af457f906f","locked":false},{"title":"Cycle Detection","description":"Detecting loops using fast and slow pointers.","_id":"69cc06ebae91d6af457f9070","locked":false},{"title":"Merge Sorted Lists","description":"Combining two sorted linked lists.","_id":"69cc06ebae91d6af457f9071","locked":false}],"_id":"69cbf752837bdb09709cb39d"},{"id":"43kmtaby3","label":"Module 6: Stacks & Queues","content":[{"title":"Stack Implementation","description":"Implementing LIFO structure using Python.","_id":"69cc06ebae91d6af457f9073","locked":false},{"title":"Queue Implementation","description":"Implementing FIFO structure and its variations.","_id":"69cc06ebae91d6af457f9074","locked":false},{"title":"Balanced Parentheses","description":"Using stacks for validation problems.","_id":"69cc06ebae91d6af457f9075","locked":false},{"title":"Monotonic Stack","description":"Solving next greater/smaller element problems.","_id":"69cc06ebae91d6af457f9076","locked":false},{"title":"Sliding Window Maximum","description":"Efficiently finding max/min in a window.","_id":"69cc06ebae91d6af457f9077","locked":false}],"_id":"69cbf752837bdb09709cb39f"},{"id":"aciuzfynx","label":"Module 7: Trees ","content":[{"title":"Tree Terminology","description":"Understanding nodes, height, depth, and structure.","_id":"69cc06ebae91d6af457f9079","locked":false},{"title":"Tree Traversals (DFS & BFS)","description":"Visiting nodes in different orders.","_id":"69cc06ebae91d6af457f907a","locked":false},{"title":"Binary Search Tree Operations","description":"Insert, search, and delete operations.","_id":"69cc06ebae91d6af457f907b","locked":false},{"title":"Height & Diameter","description":"Measuring tree properties.","_id":"69cc06ebae91d6af457f907c","locked":false},{"title":"Lowest Common Ancestor","description":"Finding shared ancestors of nodes.","_id":"69cc06ebae91d6af457f907d","locked":false}],"_id":"69cbf752837bdb09709cb3a1"},{"id":"u5fijdbn6","label":"Module 8: Heaps & Priority Queues","content":[{"title":"Heap Types (Min & Max Heap)","description":"Understanding heap ordering.","_id":"69cc06ebae91d6af457f907f","locked":false},{"title":"Heap Operations","description":"Insert, delete, and heapify operations.","_id":"69cc06ebae91d6af457f9080","locked":false},{"title":"Kth Largest Element","description":"Finding order statistics using heaps.","_id":"69cc06ebae91d6af457f9081","locked":false},{"title":"Top K Frequent Elements","description":"Identifying frequent elements efficiently.","_id":"69cc06ebae91d6af457f9082","locked":false},{"title":"Merge K Sorted Lists","description":"Combining multiple sorted lists using heaps.","_id":"69cc06ebae91d6af457f9083","locked":false}],"_id":"69cbf752837bdb09709cb3a3"},{"id":"3zkmcnp4u","label":"Module 9: Hashing","content":[{"title":"Hash Functions","description":"Mapping keys to indices efficiently.","_id":"69cc06ebae91d6af457f9085","locked":false},{"title":"Collision Handling","description":"Resolving conflicts in hash tables.","_id":"69cc06ebae91d6af457f9086","locked":false},{"title":"Frequency Counting","description":"Counting occurrences using hashing.","_id":"69cc06ebae91d6af457f9087","locked":false},{"title":"Two Sum Problem","description":"Finding pairs using hash maps.","_id":"69cc06ebae91d6af457f9088","locked":false},{"title":"Subarray Sum Problems","description":"Using prefix sums with hashing.","_id":"69cc06ebae91d6af457f9089","locked":false}],"_id":"69cbf752837bdb09709cb3a5"},{"id":"k61vfottu","label":"Module 10: Graphs","content":[{"title":"Graph Representation","description":"Using adjacency lists and matrices.","_id":"69cc06ebae91d6af457f908b","locked":false},{"title":"BFS & DFS Traversal","description":"Exploring graph nodes systematically.","_id":"69cc06ebae91d6af457f908c","locked":false},{"title":"Cycle Detection","description":"Identifying loops in graphs.","_id":"69cc06ebae91d6af457f908d","locked":false},{"title":"Shortest Path (Dijkstra)","description":"Finding minimum distances between nodes.","_id":"69cc06ebae91d6af457f908e","locked":false},{"title":"Minimum Spanning Tree","description":"Connecting nodes with minimum cost.","_id":"69cc06ebae91d6af457f908f","locked":false}],"_id":"69cbf752837bdb09709cb3a7"},{"id":"c3asorfx8","label":"Module 11: Greedy Algorithms","content":[{"title":"Greedy Strategy Concept","description":"Making optimal local choices.","_id":"69cc06ebae91d6af457f9091","locked":false},{"title":"Activity Selection","description":"Selecting maximum non-overlapping intervals.","_id":"69cc06ebae91d6af457f9092","locked":false},{"title":"Fractional Knapsack","description":"Maximizing value with fractional items.","_id":"69cc06ebae91d6af457f9093","locked":false},{"title":"Huffman Coding","description":"Building optimal prefix codes.","_id":"69cc06ebae91d6af457f9094","locked":false}],"_id":"69cbf752837bdb09709cb3a9"},{"id":"1wpv05y46","label":"Module 12: Dynamic Programming ","content":[{"title":"Memoization vs Tabulation","description":"Comparing top-down and bottom-up approaches.","_id":"69cc06ebae91d6af457f9096","locked":false},{"title":"State & Transition Design","description":"Structuring DP solutions.","_id":"69cc06ebae91d6af457f9097","locked":false},{"title":"Knapsack Problem","description":"Solving optimization problems with constraints.","_id":"69cc06ebae91d6af457f9098","locked":false},{"title":"LCS & LIS","description":"Solving sequence-based problems.","_id":"69cc06ebae91d6af457f9099","locked":false},{"title":"Coin Change","description":"Finding ways and minimum coins.","_id":"69cc06ebae91d6af457f909a","locked":false}],"_id":"69cbf752837bdb09709cb3ab"},{"id":"fb7nh6yer","label":"Module 13: Advanced Topics","content":[{"title":"Bit Manipulation","description":"Using bitwise operations for optimization.","_id":"69cc06ebae91d6af457f909c","locked":false},{"title":"Trie (Prefix Tree)","description":"Efficient prefix-based searching.","_id":"69cc06ebae91d6af457f909d","locked":false},{"title":"Segment Tree","description":"Handling range queries efficiently.","_id":"69cc06ebae91d6af457f909e","locked":false},{"title":"Disjoint Set Union (DSU)","description":"Managing connected components.","_id":"69cc06ebae91d6af457f909f","locked":false}],"_id":"69cbf752837bdb09709cb3ad"},{"id":"eq3xu85l6","label":"Module 14: Interview Preparation","content":[{"title":"Problem-Solving Patterns","description":"Mastering common coding techniques.","_id":"69cc06ebae91d6af457f90a1","locked":false},{"title":"Binary Search","description":"Efficient searching in sorted domains.","_id":"69cc06ebae91d6af457f90a2","locked":false},{"title":"Mock Interviews","description":"Practicing real interview scenarios.","_id":"69cc06ebae91d6af457f90a3","locked":false},{"title":"Debugging & Optimization","description":"Improving code quality and performance.","_id":"69cc06ebae91d6af457f90a4","locked":false}],"_id":"69cbf752837bdb09709cb3af"},{"id":"tz3zz3msy","label":"Capstone Projects","content":[{"title":"Coding Platform Project","description":"Building a mini problem-solving website.","_id":"69cc06ebae91d6af457f90a6","locked":false},{"title":"Graph-based Route Finder","description":"Applying graph algorithms in real-world use.","_id":"69cc06ebae91d6af457f90a7","locked":false},{"title":"Autocomplete System (Trie)","description":"Implementing search suggestions using Trie.","_id":"69cc06ebae91d6af457f90a8","locked":false}],"_id":"69cbf752837bdb09709cb3b1"}],"__v":1,"slug":"dsa-with-python","isFree":true,"status":"published","accentColor":"#D94B56","icon":"dsa"},"message":"Course fetched successfully"}