cpp-unordered_set-functions Archives

unordered_set load_factor() function in C++ STL

Last Updated: 05 June 2023

The unordered_set::load_factor() is a built-in function in C++ STL which returns the current load factor in the unordered_set container. The load factor is the ratio betwe...read more

cpp-unordered_set-functions

unordered_set erase() function in C++ STL

Last Updated: 12 June 2023

The unordered_set::erase() function is a built-in function in C++ STL which is used to remove either a single element or a group of elements ranging from start(inclusive) ...read more

cpp-unordered_set-functions

unordered_set cend() function in C++ STL

Last Updated: 05 June 2023

The unordered_set::cend() method is a built-in function in C++ STL which is used to return a const_iterator pointing to past-the-end element in the unordered_set container...read more

cpp-unordered_set-functions

unordered_set clear() function in C++ STL

Last Updated: 28 June 2022

The unordered_set::clear() function is a built-in function in C++ STL which is used to clear an unordered_set container. That is, this function removes all of the elements...read more

cpp-unordered_set-functions

unordered_set count() function in C++ STL

Last Updated: 05 June 2023

The unordered_set::count() function is a built-in function in C++ STL which is used to count occurrences of a particular element in an unordered_set container. As the unor...read more

cpp-unordered_set-functions

unordered_set find() function in C++ STL

Last Updated: 08 November 2023

The unordered_set::find() function is a built-in function in C++ STL which is used to search for an element in the container. It returns an iterator to the element, if fou...read more

cpp-unordered_set-functions

unordered_set hash_function() in C++ STL

Last Updated: 05 June 2023

The unordered_set::hash_function() is a built-in function in C++ STL which is used to get hash function. This hash function is a unary function which takes asingle argumen...read more

cpp-unordered_set-functions

unordered_set emplace() function in C++ STL

Last Updated: 05 June 2023

The unordered_set::emplace() function is a built-in function in C++ STL which is used to insert an element in an unordered_set container. The element is inserted only if i...read more

cpp-unordered_set-functions

unordered_set max_size() in C++ STL

Last Updated: 28 September 2018

The unordered_set::max_size() is a built-in function in C++ STL, defined in unordered_set.h which returns maximum number of elements that an unordered_set container can ho...read more

cpp-unordered_set-functions

unordered_set empty() function in C++ STL

Last Updated: 16 November 2023

The unordered_set::empty is a built-in function in C++ STL which is used to check if an unordered_set container is empty or not. It returns True if the unordered_set conta...read more

cpp-unordered_set-functions

unordered_set operator= in C++ STL

Last Updated: 05 June 2023

The '=' is an operator in C++ STL which copies (or moves) an unordered_set to another unordered_set and unordered_set::operator= is the corresponding operator function. Th...read more

cpp-unordered_set-functions

unordered_set equal_range in C++ STL

Last Updated: 11 July 2025

equal_range() in general returns range that includes all elements equal to given value. For unordered_set where all keys are distinct, the returned range contains at-most ...read more

C++

Picked

cpp-unordered_set

cpp-unordered_set-functions

unordered_set end() in C++ STL

Last Updated: 05 June 2023

The unordered_set::end() function is a built-in function in C++ STL which returns an iterator pointing to the past-the-end-element. This iterator does not directly point t...read more

cpp-unordered_set-functions

unordered_set operators in C++ STL

Last Updated: 11 July 2025

Unordered_set provides two operators in C++ STL. These are: Syntax: 1. (unordered_set lhs == unordered_set rhs)2. (unordered_set lhs != unordered_set rhs)These operators ...read more

C++

Picked

cpp-unordered_set

cpp-unordered_set-functions

Median of sliding window in an array | Set 2

Last Updated: 02 August 2023

Prerequisites: Policy based data structure, Sliding window technique.Given an array of integer arr[] and an integer K, the task is to find the median of each window of siz...read more

DSA

sliding-window

median-finding

cpp-unordered_set-functions