Index of Data Structures with C++ #

• 1. Memory and Pointers
  • 1. Pointers
    • 1. Pointer Intro
    • 2. Pointer Arithmetic
    • 3. Arrays and Pointers
    • 4. Characters and Pointers
    • 5. Function and Pointers
    • 6. Nested pointer
    • 7. Address Typecasting
    • 8. References and Pass by Reference
  • 2. Dynamic Memory Allocation
    • 1. Dynamic Allocation
    • 2. Dynamic Memory Allocation of 2D arrays
• 2. Time and Space Analysis
  • 1. Time
    • 1. Order Complexity Analysis
    • 2. Linear Search Time Complexity
    • 3. Insertion Sort
    • 4. Selection Sort
    • 5. Time complexity for recursive algorithms
    • 6. Fibonacci is bad
  • 2. Space
  • zAssignments
• 3. Recursion
  • 1. Recursion Basics
    • 1. Intro to Recursion
    • 2. Recursion and PMI
    • 3. Fibonacci Number
    • 4. Recursion with Arrays
    • 5. Approach for recursive problems
    • zAssignments
  • 2. Recursion Practice
  • 3. Applications of Recursion
    • 1. Recursion and Strings
    • 2. Merge Sort
    • 3. Quick Sort
    • 4. Strings
    • zAssignments
      • 1. Subsequences of Strings
      • 2. Printing subsequence
• 4. OOP Basics
  • 1. Intro and syntax
    • 1. Principles of OOP
    • 2. Classes
    • 3. Objects
    • 4. Functions(in class)
      • 1. Getters and Setters
      • 2. Core member functions
    • 5. this keyword
  • 2. Special Functions
    • 1. Constructor - idea and syntax
      • 1. The Copy constructor
        • 1. Shallow and Deep copy
      • 2. Feature - Delegating constructors
    • 2. Destructor
    • 3. Special functions details
  • 3. Member constraints
    • 1. const
      • 1. const fields - Intialization List
      • 2. const member functions
    • 2. static
  • 4. Operator overloading
    • 1. Binary operator
    • 2. Unary post
    • 3. Unary pre
    • zAssignment - Polynomial class
  • 5. Approach for writing a class
• 5. Data Structures
  • 1. Linear Data Structures
    • 1. Vector aka Dynamic Array
    • 2. Linked List
      • 1. Linked List Basics
        • 1. What are data structures and why are they important
        • 2. What is a linked list
        • 3. Basic Operations on LL
          • 1. Length of LL (recursive)
          • 2. Insert node at the ith position
          • 3. Delete Node
          • 4. Delete Node recursive
          • 5. Insert Node recursive
          • 6. Print the Linked List
        • 8. Variations of LL
        • zAssignments
          • 1. Linear Search in LL
          • 2. AppendLastNToFirst
          • 3. Eliminate dupicates from the array
          • 4. Print LL in reverse
          • 5. Palindrome Linked List
      • 2. Popular LL problems
        • 1. Midpoint of the LL
        • 2. Merging two sorted LLs
        • 3. Merge Sort on LL
        • 4. Reverse LL(recursive)
        • 5. Reverse LL using 2 pointers
        • 6. Reverse LL recursive - easiest
        • 7. Reverse LL Iterative
        • zAssignments
    • 3. Stack
      • 1. Introduction to Stacks
      • 2. Stack using arrays
      • 3. Stack using dynamic arrays
      • 4. Templates
      • 5. Stacks with templates
      • 6. Stack using LL
      • 7. Inbuilt stack STL
    • 4. Queue
      • 1. Queue Introduction
      • 2. Queue using Array - Code
      • 3. Queue using Dynamic Array - Code
      • 3. zNamespaces
      • 4. Queue using LL
      • 5. Inbuilt queue STL
    • zTest 2
  • 2. Trees
    • 1. Generic Trees
      • 1. Introduction to trees
      • 2. Coding a tree
        • 1. TreeNode class
        • 2. Destructor
        • 3. IO for trees
          • 1. Take input and print recursive
          • 2. Take input levelwise
          • 3. Output level wise
      • 3. Tree params
        • 1. Number of nodes
        • 2. Height of a tree Exercise
        • 3. Depth of a Node
        • 4. Number of leaf nodes
      • 4. Tree Traversals
    • 2 .Binary trees
      • 1. Intro to Binary trees
      • 2. Coding a Binary Tree
        • 1. BinaryTreeNode class
        • 2. Input
        • 3. Printing a tree
      • 3. Params
        • 1. Count nodes
        • 2. Diameter of a BInary tree
      • 4. Traversals
      • 5. Construction from traversal
        • 1. Pre and In
        • 2. Post and In
        • 3. Level and In
      • zAssignments
    • 3. Binary Search Trees
      • 1. Intro to BST
      • 2. Coding BST - BST Node class
      • 3. Search Operation in BST
      • 4. Common BST questions
        • 1. Check if BST
          • 1. Check BST 1
          • 2. Check BST 2
          • 3. Check BST 3
        • 2. Construct BST from sorted array
        • 3. BST to sorted LL
        • 4. Find Path
      • 5. Variations of BST
        • 1. AVL trees
  • 3. Auxilary Data Structures
    • 1. Priority Queue and Heap
      • 1. Intro to priority queue
      • 2. Intro to Heap
      • 3. The two kinds of heaps
      • 4. Complete Binary Trees
      • 5. Heap - Insertion and Deletion
      • 7. In-place heap
      • 8. STL priority queue
      • 9. Practice Problems
        • 1. K sorted array
        • 2. K smallest elements
    • 2. Hashmaps
      • 1. Intro to hashMaps
      • 2. Bucket Array and hash functions
      • 3. Collision Handling
      • 4. Time complexity and time factor
      • 5. Coding a hashMap
      • 7. Question - Infinite Stream
      • 8. STL map and set
        • 1. map and unordered map
        • 2. set and unordered set
        • 3. Iterators - C++ Feature
    • 3. Tries
      • 1. Introduction to Tries
      • 2. Coding a Trie
        • 1. TrieNode class
        • 2. Trie basic API
      • 3. Types of Tries
      • 4. Huffman Encoding
  • 4. Graphs
    • 1. Graphs - Basics
      • 1. Intro to graphs
      • 2. Graph Terminology
      • 3. Graph varieties
      • 4. Coding a Graph
      • 5. Basic Traversals
        • 1. DFS
        • 2. BFS
      • 6. Basic path operations
        • 1. Has Path
        • 2. Get Path
      • 7. Problem - get connected components
    • 2. Graphs 2
      • 1. Intro to MST
      • 2. Cycle Detection
      • 2. MST algorithms
        • 1. Kruskal’s Algo Complexity
          • 0. Sorting w.r.t a data member of a class
      • 5. Prim’s Algorithm
      • 6. Dijkstra’s Algorithm
  • 5. C++ STL
    • 1. pair
    • 2. tuple
    • 3. Bitset
• 6. Algorithm Design
  • 0. Brute force
  • 1. Why algorithms
  • 2. Analysis of Algorithms
  • 3. Design Techniques
    • 1. Divide and Conquer
    • 2. Greedy
    • 3. Dynamic Programming
      • 1. Fibonacci - 1
      • 2. Fibonacci - 2
      • 3. Min Steps to 1
      • 4. DP summary
      • 5. Practice Problems
        • 1. Min Cost Path
        • 2. Largest Common Subsequence
        • 3. Edit Distance
  • 4. NP Completeness
• 7. C++ Continued
  • 1. Macros and Global Variables
  • 2. Inline and Default Arguments
  • 3. const and constexpr
  • 4. Exception Handling
• 8. OOP Continued
  • 1. Abstraction and Encapsulation
  • 2. Inheritance
    • 1. Inheritance - Concept
    • 2. Syntax
    • 3. Order Of ConstructorsDestructors
    • 4. Hybrid Inheritance
    • 5. Types of Inheritance
  • 3. Polymorphism
    • 1. Compile Time Polymorphism
    • 2. Run Time Polymorphism
  • 4. Virtual Functions and Abstract Classes
  • 5. Friend Functions and Classes
• Home