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
Server Side Programming Articles
Page 1361 of 2109
is_scalar template in C++
In this article we will be discussing the working, syntax and examples of std::is_scalar template in C++ STL.is_scalar is a template which comes under header file. This template is used to check whether the given type T is a scalar type or notThis template is a combination of is_arithmetic, is_pointer, is_enum, is_member_pointer or is_same and checks whether either if either one is true, the result of is_scalar will also be true.What is a scalar type in C++?A scalar type is that object which is neither a class type nor an array type. A scalar type is a type which ...
Read Moreis_polymorphic template in C++
In this article we will be discussing the working, syntax and examples of std::is_polymorphic template in C++ STL.is_polymorphic is a template that comes under the header file in C++. This template is used to check whether the class is a polymorphic class or not and return the result either true or false accordingly.What is a polymorphic class?A class which declares the virtual function from an abstract class where the virtual function is declared. This class have the declaration of the virtual function declared in other class.Syntaxtemplate is_polymorphic;ParametersThe template can have only parameter of type T, and check whether ...
Read Moreis_reference Template in C++
In this article we will be discussing the working, syntax and examples of std::is_reference template in C++ STL.is_reference is a template which comes under header file. This template is used to check whether the given type T is a reference type or not.This template is a combination of is_rvalue and is_lvalue and checks whether either if one is true, the result of is_reference will be also true.What is a reference in C++?A reference is an alias or another name of the already existing variable. A reference is different from pointer −As we cannot set a reference as null but ...
Read MoreFilter Restaurants by Vegan-Friendly, Price and Distance in C++
Suppose we have an array of restaurants where restaurants[i] have [idi, ratingi, vegan friendly, pricei, distancei]. We have to filter the restaurants using three filters.The vegan-friendly filter will be either true (meaning we should only include restaurants with vegan-friendly set to true) or false (meaning we can include any restaurant).The maxPrice filter and max distance filter which are the maximum value for price and distance of restaurants we should consider respectively.We have to find the array of restaurant IDs after filtering, ordered by rating from highest to lowest. For restaurants with the same rating, order them by id in decreasing ...
Read MoreFind the City With the Smallest Number of Neighbors at a Threshold Distance in C++
Suppose there are n cities numbered from 0 to n-1. If we have the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and weighted edge between cities fromi and toi, and given the integer distance threshold. We have to find the city with the smallest number of cities that are reachable through some path and whose distance is at most distance threshold, If there are more than one such cities, return the city with the greatest number.So if the input is like −n is 4 and the distance threshold is also 4, then the output will be ...
Read MoreApply Discount Every n Orders in C++
Suppose there is a sale in a supermarket, there will be a discount every n customer. Consider there are some products in the supermarket where the id of the i-th product is products[i] and the price per unit of this product is prices[i]. Here the system will count the number of customers and when the n-th customer arrives he/she will have a discount on the bill. Then the system will start counting customers again. The customer orders a certain amount of each product where product[i] is the id of the i-th product the customer ordered and amount[i] is the number ...
Read MoreValidate Binary Tree Nodes in C++
Suppose we have n binary tree nodes numbered from 0 to n - 1 where node I has two children leftChild[i] and rightChild[i], we have to say true if and only if all the given nodes form exactly one valid binary tree. When node i has no left child then leftChild[i] will equal -1, similarly for the right child. We have to keep in mind that the nodes have no values and that we only use the node numbers in this problem. So if the input is like −Then the output will be true.To solve this, we will follow these ...
Read MoreLinked List in Binary Tree in C++
Suppose we have a binary tree root and a linked list with a head as the first node. We have to return True if all the elements in the linked list starting from the head correspond to some downward path connected in the binary tree otherwise False. So if the tree is like −And the linked list is [1, 4, 2, 6], then the output will be true.To solve this, we will follow these steps −Define a map dpDefine a method called solve(), this will take head, root, and flagif the head is null, then return true, or if the ...
Read MoreLongest ZigZag Path in a Binary Tree in C++
Suppose we have a binary tree root, a ZigZag path for a binary tree is defined as follow −Choose any node in the binary tree and a direction (either right or left).If the current direction is right then moving towards the right child of the current node otherwise move towards the left child.Then change the direction from right to left or vice versa.Repeat the second and third steps until we can't move in the tree.Here the Zigzag length is defined as the number of nodes visited - 1. (A single node has a length of 0). We have to find ...
Read MoreTime Needed to Inform All Employees in C++
Suppose we have a company has n employees with a unique ID for each employee. These IDs are ranging from 0 to n - 1. The head of the company has is the one with headID. Each employee has one direct manager given in the manager array where manager[i] is the direct manager of the i-th employee, manager[headID] = -1. Also it's guaranteed that the subordination relationships have a tree-like structure. Here the head of the company wants to inform all the employees of the company of an urgent piece of news. He can inform his direct subordinates and they ...
Read More