Skip to content
  • Home
  • YouTube
  • About
  • Contact
Learn to Code and Code to Learn

Learn to Code and Code to Learn

Your Journey to Code Mastery

  • Interview Prep Sheet
    • TCP DSA 75
    • TCP DSA 150
    • TCP DSA 351
    • TCP HLD 50
    • TCP HLD 101
  • General
    • Setup
    • Mastering in C programming (Crash Course)
  • DSA Patterns
    • Fast and Slow Pointer
    • sliding window
      • fixed size sliding window
      • Variable size sliding window
  • Coding Prep
    • Leetcode Problems
      • Leetcode Practice
      • Leetcode PTOD
      • TCP DSA 150
    • GFG
      • GFG Practice
      • GFG PTOD
    • Company wise Interview Questions
      • Google
      • Microsoft
  • Programming
    • C Programming
    • C++
      • C++-11
      • c++-14
      • STL
    • Python
  • HLD
    • TCP HLD 50
    • TCP HLD 101
  • LLD
    • SOLID Principle
    • Design Pattern
      • Creational Design Patterns
        • Singleton
  • Toggle search form

Array class in C++ STL

Posted on December 26, 2021December 26, 2021 By thecodepathshala 2 Comments on Array class in C++ STL

Arrays are fixed-size sequence containers: they hold a specific number of elements ordered in a strict linear sequence.

The introduction of array class from C++11 has offered a better alternative for C-style arrays. The advantages of array class over C-style array are :-

  • Array classes knows its own size, whereas C-style arrays lack this property. So when passing to functions, we don’t need to pass size of Array as a separate parameter.
  • With C-style array there is more risk of array being decayed into a pointer. Array classes don’t decay into pointers
  • Array classes are generally more efficient, light-weight and reliable than C-style arrays.

Functions of array :-

Iterators
begin : Return iterator to beginning (public member function )
end : Return iterator to end (public member function )
rbegin : Return reverse iterator to reverse beginning (public member function )
rend : Return reverse iterator to reverse end (public member function )
cbegin : Return const_iterator to beginning (public member function )
cend : Return const_iterator to end (public member function )
crbegin : Return const_reverse_iterator to reverse beginning (public member function )
crend : Return const_reverse_iterator to reverse end (public member function )

Capacity
size : Return size (public member function )
max_size
: Return maximum size (public member function )
empty : Test whether array is empty (public member function )

Element access
operator[] : Access element (public member function )
at : Access element (public member function )
front : Access first element (public member function )
back : Access last element (public member function )
data : Get pointer to data (public member function )

Modifiers
fill : Fill array with value (public member function )
swap : Swap content (public member function )

// C++ code to demonstrate working of array
// Function at(), get(), front(), back(), size(), max_size() and operator[]
#include<iostream>
#include<array> // for array, at()
#include<tuple> // for get()
using namespace std;
int main()
{
	// Initializing the array elements
	array<int,6> ar = {1, 2, 3, 4, 5, 6};
	// Printing array elements using at()
	cout << "The array elements are (using at()) : ";
	for ( int i=0; i<6; i++)
	cout << ar.at(i) << " ";
	cout << endl;
	// Printing array elements using get()
	cout << "The array elements are (using get()) : ";
	cout << get<0>(ar) << " " << get<1>(ar) << " ";
	cout << get<2>(ar) << " " << get<3>(ar) << " ";
	cout << get<4>(ar) << " " << get<5>(ar) << " ";
	cout << endl;
	// Printing first element of array
        cout << "First element of array is : ";
        cout << ar.front() << endl;
        // Printing last element of array
        cout << "Last element of array is : ";
        cout << ar.back() << endl;
	// Printing array elements using operator[]
	cout << "The array elements are (using operator[]) : ";
	for ( int i=0; i<6; i++)
	cout << ar[i] << " ";
	cout << endl;
	// Printing number of array elements
        cout << "The number of array elements is : ";
        cout << ar.size() << endl;
        // Printing maximum elements array can hold
        cout << "Maximum elements array can hold is : ";
        cout << ar.max_size() << endl;
	
	return 0;
}

/*
Output : 
The array elements are (using at()) : 1 2 3 4 5 6 
The array elements are (using get()) : 1 2 3 4 5 6 
First element of array is : 1
Last element of array is : 6
The array elements are (using operator[]) : 1 2 3 4 5 6 
The number of array elements is : 6
Maximum elements array can hold is : 6
*/
// C++ code to demonstrate working of swap()
#include<iostream>
#include<array> // for swap() and array
using namespace std;
int main()
{
	// Initializing 1st array
	array<int,6> ar = {1, 2, 3, 4, 5, 6};

	// Initializing 2nd array
	array<int,6> ar1 = {7, 8, 9, 10, 11, 12};

	// Printing 1st and 2nd array before swapping
	cout << "The first array elements before swapping are : ";
	for (int i=0; i<6; i++)
	cout << ar[i] << " ";
	cout << endl;
	cout << "The second array elements before swapping are : ";
	for (int i=0; i<6; i++)
	cout << ar1[i] << " ";
	cout << endl;

	// Swapping ar1 values with ar
	ar.swap(ar1);

	// Printing 1st and 2nd array after swapping
	cout << "The first array elements after swapping are : ";
	for (int i=0; i<6; i++)
	cout << ar[i] << " ";
	cout << endl;
	cout << "The second array elements after swapping are : ";
	for (int i=0; i<6; i++)
	cout << ar1[i] << " ";
	cout << endl;
	return 0;
}

/*
Output : 
The first array elements before swapping are : 1 2 3 4 5 6 
The second array elements before swapping are : 7 8 9 10 11 12 
The first array elements after swapping are : 7 8 9 10 11 12 
The second array elements after swapping are : 1 2 3 4 5 6 
*/
// C++ code to demonstrate working of empty() and fill()
#include<iostream>
#include<array> // for fill() and empty()
using namespace std;
int main()
{
	// Declaring 1st array
	array<int,6> ar;
	// Declaring 2nd array
	array<int,0> ar1;
	// Checking size of array if it is empty
	ar1.empty()? cout << "Array empty":
		cout << "Array not empty";
	cout << endl;
	// Filling array with 0
	ar.fill(0);
	// Displaying array after filling
	cout << "Array after filling operation is : ";
	for ( int i=0; i<6; i++)
		cout << ar[i] << " ";
	return 0;
}

/*
Output : 
Array empty
Array after filling operation is : 0 0 0 0 0 0 
*/
C++, Programming, STL Tags:STL

Post navigation

Previous Post: Deque in C++ STL
Next Post: Forward_list in C++ STL

More Related Articles

C program to check vowel or consonant using switch case C Programming
STL(Standard Template Library) C++
C program to find power of a number using for loop C Programming
C program to find twos complement of a binary number C Programming
C program to print all alphabets from a to z using while loop C Programming
C program to check whether a number is armstrong number or not C Programming

Comments (2) on “Array class in C++ STL”

  1. Pingback: STL(Standard Template Library) - The Code Pathshala
  2. Pingback: List in C++ STL - The Code Pathshala

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Archives

  • May 2026
  • August 2025
  • March 2025
  • February 2025
  • January 2025
  • December 2024
  • August 2024
  • April 2024
  • March 2024
  • February 2024
  • January 2024
  • December 2023
  • November 2023
  • September 2023
  • February 2023
  • February 2022
  • January 2022
  • December 2021
  • November 2021
  • October 2021

Categories

  • Algo
  • Array in C
  • C Programming
  • C++
  • C++
  • Company Wise
  • Competitive Programming
  • Design Pattern
  • DS
  • DS & Algo
  • Fast and Slow Pointer
  • fixed size sliding window
  • General
  • GFG
  • GFG PTOD
  • HLD
  • hld101
  • Interview Prep Sheet
  • Interview Questions
  • Leetcode Problems
  • Leetcode PTOD
  • LLD
  • Low-level design
  • Mastering in C programming (Crash Course)
  • Neetcode 150
  • Programming
  • Roadmap
  • Setup
  • Setup
  • sliding window
  • SOLID Principle
  • STL
  • string in c
  • System Design
  • TCP DSA 150
  • TCP DSA 351
  • TCP DSA 75
  • TCP HLD50
  • Top X
  • Variable size sliding window

Tags

algorithm array basic c++ coding interview C Programming Crash Course data structure and algorithm design pattern dsa easy Fixed size sliding window fubctions GFD gfg GFG PTOD hard HLD jump game LC PTOD leetcode Leetcode PTOD Leetcode Top Interview 150 LLD loop loops Low-level design Mastering C Programming in 15 Days matrix medium rotate array searching&sorting sliding window solid STL string string in c sunction in c system design TCP HLD50 TCP HLD101 Template in C++ Top Top 20 coding patterns to master MAANG Interview Top interview 150

🔥 C++ STL IN 30 MINUTES — Complete Introduction for DSA & Coding Interviews!

Confused about C++ STL while solving DSA and LeetCode problems? In this video, we’ll understand the Standard Template Library (STL) from scratch and learn the most important concepts you actually need for competitive programming, DSA, placements and coding interviews.

Instead of spending hours learning STL, this 30-minute C++ STL crash course gives you a practical overview of the most important STL components with examples and complexity.

🚀 What You'll Learn

✅ What is C++ STL?
✅ Why STL is important for DSA
✅ STL Containers
✅ Vector
✅ Pair
✅ List
✅ Stack
✅ Queue
✅ Priority Queue
✅ Set
✅ Map
✅ Unordered Map / Set
✅ Iterators
✅ Important STL Algorithms
✅ sort()
✅ reverse()
✅ find()
✅ binary_search()
✅ lower_bound()
✅ upper_bound()
✅ min() / max()
✅ Time Complexity of important STL operations
✅ How STL helps in LeetCode & Coding Interviews

💡 Why Should You Learn STL?

If you're preparing for:

🔥 LeetCode
🔥 Coding Interviews
🔥 DSA Placements
🔥 Competitive Programming
🔥 Amazon / Microsoft / Google / Meta Interviews
🔥 C++ Programming

then knowing STL can significantly reduce the amount of code you need to write and help you focus on the actual problem-solving logic.

By the end of this video, you should have a clear roadmap of which C++ STL containers, functions and algorithms you need to learn for DSA.

👉 Subscribe to TheCodePathshala for practical DSA, C++, LeetCode and System Design videos.

👍 Like the video if this STL crash course helped you!

💬 Comment below: Which STL topic confuses you the most?

#️⃣ HASHTAGS

#Cpp #CPlusPlus #STL #CPPSTL #DSA #DSAInCPlusPlus #CodingInterview #LeetCode #CompetitiveProgramming #Programming #CppProgramming #Coding #SoftwareEngineering #TheCodePathshala

SEO KEYWORDS / TAGS

c++ stl, c++ stl tutorial, c++ stl complete tutorial, c++ stl in 30 minutes, c++ stl crash course, c++ standard template library, standard template library in c++, c++ stl for dsa, c++ stl for beginners, c++ stl interview, c++ stl coding interview, c++ stl containers, c++ vector, c++ pair, c++ list, c++ stack, c++ queue, c++ priority queue, c++ set, c++ map, unordered_map c++, unordered_set c++, c++ iterators, c++ algorithms, c++ sort, c++ lower_bound, c++ upper_bound, c++ dsa, dsa in c++, leetcode c++, competitive programming c++, c++ coding interview, c++ placement preparation, c++ interview preparation, learn c++ stl, c++ stl explained, c++ stl one shot, c++ stl complete guide, c++ stl tutorial hindi, c++ stl hindi, standard template library tutorial
c++, stl, standard template library, dsa, data structures, algorithms, c++ interviews, stl introduction, c++ programming, coding interviews, competitive programming, stl functions, stl containers, learn c++, c++ basics, stl, cplus, cpp, stl, stl, cppp, alogrithms, c++ in 30 minutes, c stl, datastructure, algorithims
C++ STL IN 30 MINUTES 🔥 | Complete STL Introduction for DSA & Interviews
Important!!
Is DSA required for FAANG interview 🇮🇳♥️
Bug free code | prod ready #google #leetcode #codeprep #codeadventure #codeeveryday
2 sum in O(n) #google #microsoft
Design a system for 10 million users #Design #google #microsoft #interview
System design basic #systemdesign #apple #google
LeetCode #1 – Two Sum | Under 3 Minutes #leetcode #viral #codeeveryday #codelife
🚀 LeetCode #1 – Two Sum Explained in Under 2 Minutes!
Learn the most asked coding interview problem using the Hash Map approach and understand why it runs in O(n) time instead of O(n²).
In this Short, you'll learn:
✅ Problem statement
✅ Optimized Hash Map approach
✅ Step-by-step dry run
✅ Time & Space Complexity
✅ Interview tips
If you're preparing for FAANG, Microsoft, Amazon, Google, or any software engineering interview, this series is for you.
👍 Like the video if it helped.
💬 Comment which LeetCode problem I should explain next.
🔔 Subscribe for daily DSA, Golang, System Design, and Coding Interview content.
#leetcode #twosum #dsa #coding #programming #cpp #golang #interview #softwareengineer #shorts #codinginterview #algorithms #datastructures
🚀 LeetCode #1 – Two Sum Explained in Under 3 Minutes! #leetcode #viral #codeeveryday #codelife
Load More... Subscribe

TCP DSA

75
150
351

TCP HLD

50
101

Recent Posts

  • CAP THEOREM
  • TCP DSA 351
  • TCP HLD 101
  • TCP HLD 50
  • TCP DSA-150

    Recent Comments

    1. Odell Volner on C program to print multiplication table of a given number
    2. Crista Diegidio on C program to print multiplication table of a given number
    3. Daniel Pauling on C program to print multiplication table of a given number
    4. Tonisha Hepp on C program to print multiplication table of a given number
    5. Jorge Layng on C program to print multiplication table of a given number

    Copyright © 2026 Learn to Code and Code to Learn.

    Powered by PressBook Blog WordPress theme