Vector Basic Operations

Vector Basic Operations

Easy C++ STL 41 views
Explanation Complexity

Problem Statement

Learn vector - dynamic array that can grow/shrink.
Real Life: Like a flexible list that auto-adjusts size.

Input Format

An integer n (number of elements)
Then n integers.

Output Format

Vector elements after insertion and removal.

Example

5
10 20 30 40 50
Vector elements: 10 20 30 40 50
After push_back: 10 20 30 40 50 60
After pop_back : 10 20 30 40 50

Constraints

• n ≥ 0

• Use vector

• Integer elements

Concept Explanation

A vector is a dynamic array.
It can grow when elements are added and shrink when elements are removed.
This is like a flexible list that adjusts its size automatically.

Step-by-Step Explanation

1.Create a vector.

2.Read n and insert n elements using push_back().

3.Vector size increases automatically.

4.Add a new element using push_back() → size grows.

5.Remove last element using pop_back() → size shrinks.

6.Print vector elements after each operation.

Concept Explanation

A vector is a dynamic array.
It can grow when elements are added and shrink when elements are removed.
This is like a flexible list that adjusts its size automatically.

Step-by-Step Explanation

1.Create a vector.

2.Read n and insert n elements using push_back().

3.Vector size increases automatically.

4.Add a new element using push_back() → size grows.

5.Remove last element using pop_back() → size shrinks.

6.Print vector elements after each operation.

Input / Output Format

Input Format
An integer n (number of elements)
Then n integers.
Output Format
Vector elements after insertion and removal.
Constraints
• n ≥ 0

• Use vector

• Integer elements

Examples

Input:
5 10 20 30 40 50
Output:
Vector elements: 10 20 30 40 50 After push_back: 10 20 30 40 50 60 After pop_back : 10 20 30 40 50

Example Solution (Public)

C++
void stl_q1_vector_basics() {
    vector<int> numbers;
    
    // Add elements
    numbers.push_back(10);
    numbers.push_back(20);
    numbers.push_back(30);
    numbers.push_back(40);
    
    cout << "Vector elements: ";
    for(int i = 0; i < numbers.size(); i++) {
        cout << numbers[i] << " ";
    }
    cout << endl;
    
    cout << "Size: " << numbers.size() << endl;
    
    // Remove last element
    numbers.pop_back();
    cout << "After pop_back, size: " << numbers.size() << endl;
}

Official Solution Code

void stl_q1_vector_basics() {
    vector<int> numbers;
    
    // Add elements
    numbers.push_back(10);
    numbers.push_back(20);
    numbers.push_back(30);
    numbers.push_back(40);
    
    cout << "Vector elements: ";
    for(int i = 0; i < numbers.size(); i++) {
        cout << numbers[i] << " ";
    }
    cout << endl;
    
    cout << "Size: " << numbers.size() << endl;
    
    // Remove last element
    numbers.pop_back();
    cout << "After pop_back, size: " << numbers.size() << endl;
}
Please login to submit solutions.
Editor
Output

                                        
Please login to submit solutions.