Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
C++ Articles
Page 189 of 597
match_results size() in C++ STL
In this article we will be discussing the working, syntax and examples of match_results::size() function in C++ STL.What is a match_results in C++ STL?std::match_results is a specialized container-like class which is used to hold the collection of character sequences which are matched. In this container class a regex match operation finds the matches of the target sequence.What is match_results::size()?match_results::size() function is an inbuilt function in C++ STL, which is defined in header file. size() is used to get the number of matches of the match_results object associated with it. This function returns a size_type value that is the number ...
Read MoreComplete Binary Tree Inserter in C++
As we know a complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible. We have to write a data structure CBTInserter that is initialized with a complete binary tree and it supports the following operations−CBTInserter(TreeNode root) this initializes the data structure on a given tree with head node root;CBTInserter.insert(int v) will used to insert a TreeNode into the tree with a value node.val = v so that the tree remains complete, and returns the value of the parent of the inserted TreeNode;CBTInserter.get_root() ...
Read MoreTwo Sum BSTs in C++
Suppose we have two binary search trees, we have to return True iff there is a node in the first tree and a node in the second tree and sum of these nodes is a given integer target. So if the tree is like −and target is 5, then the result is true.To solve this, we will follow these steps −Define a map sdefine a method called check(), this will take node, target and nodeNumber, this will work as follows −if node is valid, then return falsecurr := value of node, req := target – currif req is present in ...
Read Moreis_class template in C++
In this article we will be discussing the working, syntax and examples of std::is_class template in C++ STL.is_class template is used to check whether the defined type is class type not any other type.What is a class?A class is an user defined data type or a data structure which contains some data members or member functions which is declared with the keyword ‘class’.Exampleclass abc { int data_members; void member_function(); };So, is_class template checks that the type T is a class, and returns the Boolean value true or false accordingly.Syntaxtemplate is_class;ParametersThe template can have only parameter of type ...
Read MoreDesign A Leaderboard in C++
Suppose we have to design a Leaderboard class, there are three different functions −addScore(playerId, score) − This will update the leaderboard by adding score to the given player's score. When there is no such player with given id in the leaderboard, add him to the leaderboard with the given score.top(K) − This will return the score sum of the top K players.reset(playerId) − This will reset the score of the player with the given id to 0. It is guaranteed that the player was added to the leaderboard before calling this function.Initially, the leaderboard should empty.If we perform the operations ...
Read MoreTree Diameter in C++
Suppose we have an undirected tree; we have to find its diameter − the number of edges in the longest path in that tree is the diameter of that tree. Here tree is given as an edge list where edges[i] = [u, v] is a bidirectional edge between nodes u and v. Each node has labels in the set {0, 1, ..., edges.length}. So if the graph is like −The output will be 4.To solve this, we will follow these steps −Define a map ldefine a method called dfs(). this will take v, an array called visited, the graph and ...
Read Moreis_const Template in C++
In this article we will be discussing the working, syntax and examples of std::is_const template in C++ STL.is_const template in C++ is used to check whether the defined type is a const-qualified type or not.What is const-qualified type?We say a type as a const-qualified when the value of the type is constant. Constant data type is a type in which once a value is initialised in a const can’t be changed or altered throughout the program.Syntaxtemplate is_const;ParametersThe template can have only parameter of type T, and check whether the given type is a constqualifier or notReturn valueIt returns a ...
Read MoreDelete Tree Nodes in C++
Suppose we have a tree, this tree is rooted at node 0, this is given as follows −Number of nodes is nodesValue of ith node is value[i]Parent of ith node is parent[i]We have to remove every subtree whose sum of values of nodes is 0, after doing that return the number of nodes remaining in the tree. So if the tree is like −There are 7 nodes, the output will be 2To solve this, we will follow these steps −Create a map called childrendefine a method called dfs(), this will take node, an array value and graphtemp := a pair ...
Read Moreis_trivial function in C++
In this article we will be discussing the working, syntax and examples of std::is_trivial template in C++ STL.is_trivial is a template which comes under header file. This template is used to check whether the given type T is a trivial class or notWhat is a trivial class type in C++?We say a type as a Trivial type, when its data is stored in a contiguous manner and which accepts only static default initialization. It can include arrays of any type, classes and scalar type.Trivial class is a class which is trivially default constructed and trivially copyable. There are some ...
Read MoreIterator for Combination in C++
Suppose we have to design an Iterator class, that consists of few operations −Define a constructor that takes a string characters of sorted distinct lowercase English letters and a number combinationLength as parameter.Define a function next() that returns the next combination of length combinationLength in alphabetic order.Define another function hasNext() that returns True if and only if there exists a next combination.So if the input is like −CombinationIterator iterator = new CombinationIterator("xyz", 2); iterator.next(); // returns "xy" iterator.hasNext(); // returns true iterator.next(); // returns "xz" iterator.hasNext(); // returns true iterator.next(); // returns "yz" iterator.hasNext(); // returns falseTo solve this, we ...
Read More