C++ STL
Basic to Advanced
Learn about C++ Concepts with in-depth explanation of all C++ STL containers and functions to solve coding problems efficiently
Students, Working Professionals

2999 1499


Online Course
Live: CPP STL-1
LIVE

Course Overview

The Standard Template Library (STL) is a set of C++ template classes to provide common programming data structures and functions such as lists, stacks, arrays, etc. It is a library of container classes, algorithms, and iterators. This course covers the basics of C++ and in-depth explanations to all C++ STL containers, iterators and important functions. It also includes video explanations of some problems based on the STL containers along with some practice problems. The Standard Template Library includes a lot of inbuilt functions and some built-in containers which internally uses some of the most important and frequently used data structures for implementation. Hence, learning STL is important for every C++ programmer as it saves a lot of time while writing code, as we can use these inbuilt classes and functions to implement some of the complex data structures easily and efficiently and perform operations on them.

Course Features

  • Premium Lecture videos by Mr. Sandeep Jain (CEO & Founder, GeeksforGeeks)

  • Tracks consist of theory & practice problem

  • Track-wise Contests for practice

  • Course Completion Certificate

  • Internship Opportunities at GeeksforGeeks

  • Course content, Video & Discussion forum come with lifetime validity.

Course Content

  • Introduction

  • Basic I/O and Problems

  • Variables and Data Types with Problems

  • Operators in C++

  • Various Problems on Operators

  • Conditional Statements

  • Loops

  • Jump Statement

  • Functions

  • Arrays

  • Strings

  • References

  • Pointers

  • Struct in C++

  • Structure (Pointer Array and Argument)

  • Struct vs Class

  • Structure Alignment and Padding

  • Union

  • Dynamic Memory Allocation

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Introduction

  • Constructors and Destructors

  • This Pointer

  • Static Members

  • Inheritance

  • Virtual Functions

  • Inheritance Example

  • Multiple Inheritance

  • Operator Overloading

  • Friend Function in C++

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Introduction and Application

  • Iterators

  • Templates

  • Function Templates

  • Class Templates

  • Introduction

  • Problem(With Video Solutions): Sorting an array according to another array

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Introduction

  • Vector Declaration

  • More functions of Vectors 

  • Time Complexities of different operations and passing Vectors to function 

  • Internal Working of Vectors

  • Problems(With Video Solutions):

    • Vector and Vector of Pairs

    • Keeping track of previous indexes after sorting a Vector 

  • Forward List in C++ STL 

  • List in C++ STL 

  • Problems(With Video Solutions):

    • Josephus Problem using List in STL 

    • Design a Data Structure with Insert/Replace/Print operations 

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Introduction

  • Problems(With Video Solutions):

    • Sliding Window Maximum

    • Design a Data Structure with Min/Max operations in O(1) time

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Introduction and Various Operations

    • push()

    • pop()

    • top()

    • size()

    • empty()

  • Problems(With Video Solutions):

    • Balanced Parenthesis and Next Greater Element 

    • Reverse string using Stack 

    • Evaluation of Postfix Expression 

    • Design a Stack that supports getMin() operation

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Introduction and Various Operations

    • push()

    • pop()

    • front()

    • back()

    • empty()

    • size()

  • Problems(With Video Solutions):

    • Generate numbers using given digits 

    • Reverse first K items in a Queue

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Set in C++ STL

    • Introduction and Implementation

    • insert()

    • begin()

    • end()

    • rbegin()

    • rend()

    • erase()

    • clear()

    • find()

    • Internal Working

    • Time Complexities

  • Problems on Set(With Video Solutions):

    • Design a Data Structure that supports the below operations:

    • insert()

    • delete()

    • search()

    • NextGreater()

    • getRank()

  • Multiset in C++ STL with few operations

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Introduction to Map

    • insert()

    • operator()

    • size()

    • empty()

    • clear()

    • begin()

    • end()

    • Internal Working

    • Time Complexities

  • Problem:

    • Print elements of an array according to the order of elements in the second array 

  • Multimap in C++ STL with few functional operations

  • Problem(With Video Solutions):

    • Implement Dictionary using Multimap

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Introduction to Map

    • insert()

    • begin()

    • size()

    • end()

    • clear()

    • find()

    • Internal Working

    • Time Complexities

  • Problems(With Video Solutions):

    • Print Unique Elements of Array 

    • Print duplicate elements of the array 

    • Check for a Pair with given Sum 

    • Union and Intersection of two unsorted Arrays 

    • Distribute Candies 

    • Longest Consecutive Subsequence 

    • Subarray with Zero Sum 

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Introduction

  • Problems(With Video Solutions):

    • Design a DS for storing user balance 

    • Find frequencies of array 

    • Find Winner of Election 

    • Count Distinct element in Every Window 

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Explanation along with Time Complexities of

    • max_element()

    • min_element()

    • accumulate()

    • count()

    • find()

    • binary_search()

    • lower_bound()

    • upper_bound()

    • rotate()

    • fill()

    • is_permutation()

    • rand()

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Explanation along with Time Complexities of

    • sort()

    • reverse()

    • next_permutation()

    • prev_permutation()

    • make_heap()

    • merge()

  • Problems(With Video Solutions):

    • Maximize the number of items purchased 

    • The Thief problem 

    • Fractional knapsack problem 

    • Chocolate Distribution problem 

    • Sort array elements by frequency 

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

  • Strings in C++ and how it is different from C-Style strings

  • Problems(With Video Solutions):

    • Pattern Searching and Returning floating-point of number 

    • Find one extra character in the string 

    • Pangram checking 

    • Check whether two strings are an anagram of each other 

  • builin_popcount() function

  • Tuple in CPP STL

  • Practice Problems

    • This track contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.

Show More

FAQs

  1. Is there any number to contact for any query?
    You may call us on our toll-free number: 1800 123 8622  or Drop us an email at geeks.classes@geeksforgeeks.org​​​
  2. Do we have doubt support in this program?
    No, This program doesn't have doubt solving support.

  3. Is this a language-specific course?
    Yes, the course is only in C++. In case you are not familiar with this language, you may join our free course, Fork CPP to best utilize this course.

  4. How can I register for the course?
    You need to sign up for the course. After signing up, you need pay when the payment link opens.

  5. What type of certificate will be offered in this program
    Once the course is completed. You'll be getting a course completion certificate.

  6. When can I make the payment for the course?
    The payment link will be available on the course page.

  7. Will the course content be available after the course end date?
    Course content comes with lifetime validity.

  8. Can I make the payment through PayPal?
    Yes. Mail us with your details at geeks.classes@geeksforgeeks.org.

Course Registration

Batch Date Type Register
CPP STL-1 LIVE Online Classes