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_...
Post a Comment

C++ Day 6

 Fabulous Often 6 days of C ++ course are addressed:


Angians are fine in C ++.

Arrays save several values ​​of the same type under a variable.

,

1. What is an array?

A collection of array elements, stored in embodied memory sites.

,
#INCLUDE <iostream>
using namespace std;

int main()
INT Number [5] = {10, 20, 30, 40, 50};
// Elements access
cout << "first element:" << number [0] << Endl;

Return zero;
,
,

,

## 2. Using input and output arrays

`` `CPP
int main()
Int Marx [5];

// input
For (int i = 0; i <5)
cout << i+1 << ":"; Enter the mark;
Cin marks [i];
,

// Output
cout << recorded marks:
For (int i = 0; i <5; i ++) {
Cout << "Mark" << i+1 << ":" << Marks [i] << Endl;
,

Return 0;
,
,

,

3. Array

,
Int Arr1 [4] = {1, 2, 3, 4}; // All the members initialized
Int Arr2 [5] = {1, 2};
,

,

4. Find maximum elements in an array

`` `CPP
int main()
Int Nums [] = {12, 45, 23, 67, 34};
Int maximum = nums [0];

For (int i = 1; i <5; i ++) {
If nums [i]> maximum,
Maximum = nums [i];
,
,

cout << "maximum:" << maximum << endl;
Return 0;
,
,

,

## 5. Array elements

,
int main() {
Int Arr [] = {5, 10, 15, 20};
Int sum = 0;

For (int i = 0; i <4; i ++) {
Sum += arr [i];
,

cout << endl; Cout << "Sum =" << Sum
Return 0.
,
,

,

### 📝 exercise questions

1. Find the meaning of ten number input by the user.
2. Identify the smallest number in an array.
3. Determine the number of even and odd numbers.
4. Rotate the components of an array.

,

Do you want 2D arrays (usually presented next) or help with any of these exercise practice solutions?
Labels:

Comments

Post a Comment

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...
Post a Comment
Read more

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 ...
Post a Comment
Read more

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 ++)...
Post a Comment
Read more