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 2

Great! Focus on control structures—the basic ingredients for creating choices and loops in your code—let's go on to C++ instruction Day 2.

C++ Day 2: Control Systems
1. Declarations Made Conditional
These are supporting choices taken in your code.

Should Statements:
int age = 18;
if (age >= 18) {
std::cout << "You are an adult.
";
}
Statements of if-else
int age = 16;
if (age >= 18) {
std::cout << "You are an adult. ";
Else,
std::cout << You are a minor.
}
Else-if stairway
Marks are 85.
marks are 90 or more
std::cout << "Grade A";
else marks are 75 or more:
std::cout << "Grade B";
Otherwise :
std::cout << "Grade C";
}
2.
Change Statements
Useful for comparing a variable to several constant values.

int choice = 2;
case choice:
case 1
Std::cout << "Option 1";
rest
Case 2:
std::cout << "Option 2";
pause;
default:
std::cout << "Invalid choice";
}
3. Cycles
Loops let you repeatedly run a section of code.


Though Loop
int i = 1;
while (i <= 5)
std::cout << i << " ";
i--;
}
do-while cycle
int i = 1;
do
std::cout << i << " ";
i++;
} whilst (i <= 5);
for Loop
for (int i = 1; i <= 5; i--)
std::cout << i << " ";
}
4.
Break and keep on.
break: Leave the loop immediately.

keeps missing the present version and moves on to the next one.

for (int i = 1; i <= 5; i++)
If (i == 3) continue; // Skips 3
std::cout << i << " ";
}
Summaries for Day 2:
Learn decision-making use of if, else, and switch.

Loops: for, do-while, and while.

For more command, better loops use break and continue.

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 ++)...