Skip to main content

C++ Day 39

  C++ Day 39 STL Containers (Deep Understanding & Real Usage) Till now, you already know arrays, vectors, loops, and STL algorithms. Today, we go one step deeper and understand STL containers , which are the backbone of modern C++ programming. In real projects and competitive coding, choice of container matters a lot. 1. What are STL Containers? STL containers are data structures provided by C++ to store data efficiently. They handle: memory management resizing element access performance optimization You focus on logic , not memory handling. 2. Categories of STL Containers STL containers are mainly divided into: Sequence Containers Associative Containers Unordered Containers Container Adapters 3. Sequence Containers These store data in sequence . 3.1 Vector Most used container in C++. vector< int > v; Key Features: Dynamic size Contiguous memory Fast random access Slower insertion in middle Example: v. push_...

C++ Day 26

  C++ Day 26: Templates (Generic Programming)

On Day 26 we dive into Templates one of C++’s most powerful Characteristics for generic programming.


Templates allow you to write Roles and classes that work with any Information type increasing code reusability and type safety.


📚 Topics Covered:

🔹 1. run templates

write i run that plant for aggregate types (int blow train etc)


cpp

copy

edit

#include 

using namespace std;


template 

t add(t amp tonne b) {

    take amp + b;

}


int main() {

    cout << add(3 4) << endl;       // cardinal    cout << add(25 31) << endl; // 56

    cout << add("hi " "there") << endl; // hello there

}

✅ guide  or guide  are interchangeable


🔹 ii. Class Templates

Define generic classes that can operate on any Information type.


cpp

Copy

Edit

template 

class Box {

private:

    T value;

public:

    Box(T v) : value(v) {}


    void show() {

        cout << "Value: " << value << endl;

    }

};


int main() {

    Box b1(10);

    Box b2("Hello");


    b1.show();

    b2.show();

}

🔹 3. aggregate guide parameters

cpp

copy

edit

template 

class match {

public:

    tonne first;

    uranium second;


    pair(t amp uranium b) : first(a) second(b) {}

    null display() {

        cout << "pair: " << top << " " << back << endl;

    }

};

🔹 cardinal. Template Specialization (Optional Advanced)

Sometimes you want a custom Applyation for a specific type.


cpp

Copy

Edit

template 

class Printer {

public:

    void print(T value) {

        cout << "Generic: " << value << endl;

    }

};


template <>

class Printer {

public:

    void print(string value) {

        cout << "String: [" << value << "]" << endl;

    }

};

🛠️ practise Task

Make a template Role maxValue(T a T b) that returns the maximum of two values of any type.


Also Make a class template Stack with Send pop and top Roles.


📌 Summary:

Characteristic Description

Role Template One Role many types

Class Template One class many types

typename / class Both importantwords are valid in templates

Specialization Customize template behavior for specific types

Comments

Popular posts from this blog

C++ Day 35

  C++ Day 34: Layout Layouts (Part 2) We’ll cover: Constructer Layout Adjuster Layout Decorator Layout practise Task 🔹 1. developer form (creational) used to make compound objects measure away step ✅ employ case: you need to form associate in nursing aim (like amp pizza pie calculator house) with elective parameters example: cpp copy edit class calculator {     train Methodor gpu ram; public:     family developer {         train Methodor gpu ram;     public:         developer setcpu(string c) { Methodor = c; take *this; }         developer setgpu(string g) { gpu = g; take *this; }         developer setram(string r) { run = r; take *this; }         calculator Construct() {             take Calculater(cpu gpu ram);         }     };     Calculater(string snow train m train r) : cpu(c) gp...

C++ Day 33

  C++ Day 33: Smart Pointers & Memory Management 🔹 1. wherefore forward pointers in c++ hand-operated green / cancel is error-prone: memory leaks 🧠 double deletes ❌ dangling pointers 💥 smart pointers care store mechanically exploitation raii (Supply skill is initialization) 🔹 ii. Types of Smart Pointers in C++ ✅ std::unique_ptr Sole ownership of a Supply. Cannot be copied. Automatically deletes the Supply when it goes out of scope. cpp Copy Edit #include  unique_ptr ptr1 = make_unique(10); cout << *ptr1 << endl; // 10 You can transfer ownership: cpp Copy Edit unique_ptr ptr2 = move(ptr1); ✅ std::shared_ptr Shared ownership multiple shared_ptrs can point to the same object. Uses reference counting to track how many owners. cpp Copy Edit shared_ptr p1 = make_shared(100); shared_ptr p2 = p1;  // Reference count = 2 When count goes to 0 memory is released. ✅ std::weak_ptr Non-owning reference to a shared_ptr-managed object. Used to break cyclic references ...

CSES Increasing Subsequence solution

 You are given an array containing  n n n integers. Your task is to determine the longest increasing subsequence in the array, i.e., the longest subsequence where every element is larger than the previous one. A subsequence is a sequence that can be derived from the array by deleting some elements without changing the order of the remaining elements. Input The first line contains an integer n n n : the size of the array. After this there are n n n integers x 1 , x 2 , … , x n x_1,x_2,\ldots,x_n x 1 ​ , x 2 ​ , … , x n ​ : the contents of the array. Output Print the length of the longest increasing subsequence. Constraints 1 ≤ n ≤ 2 ⋅ 1 0 5 1 \le n \le 2 \cdot 10^5 1 ≤ n ≤ 2 ⋅ 1 0 5 1 ≤ x i ≤ 1 0 9 1 \le x_i \le 10^9 1 ≤ x i ​ ≤ 1 0 9 Example Input: 8 7 3 5 3 6 2 9 8 Output: 4 #include < bits / stdc ++. h > using namespace std ; void solve (){ int n ; cin >> n ; vector <int> arr ( n ); for ( int i = 0 ; i < n ; i ++)...