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
Programming Articles
Page 1372 of 2547
Binary Tree Right Side View in C++
Suppose we have a binary tree, if we see the tree from right side, then we can see some elements of it. we have to display those elements. So if the tree is like −To solve this, we will follow these steps −We will create one helping method for dfs. This will take tree_node, an array to hold answers, and level. The level is initially 0. The dfs will work like below −if node is null, then returnif level = length of the answer array, then insert value of node into the ans arraydfs(right of the node, ans, level + ...
Read Moreisunordered() function in C++
In this article we are going to discuss the isunordered() function in C++, its syntax, working and its return values.isunordered() function is an inbuilt function in C++ which is defined in header file. The function checks whether the two floating points number be NAN, if both or either one of them is NAN then it will return 1(true) else will return 0(false).Syntaxbool isunordered(float n1, float n2);orbool isunordered(double n1, double n2); orbool isunordered(long double n1, long double n2);The function accepts two floating point variables to compare and check if either one of these is nan.Return valueThe function return the boolean value ...
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 Moredifftime() function in C++
In this article we are going to discuss the difftime() function in C++, its syntax, working and its return values.difftime() function is an inbuilt function in C++ which is defined in header file. The function accepts two parameters of time_t type, function calculate the difference between the two timesSyntaxdouble difftime(time_t end, time_t beginning);Return valueReturns the difference of the time in seconds, stored as double data type.Example#include #include int main () { time_t now; struct tm newyear; double seconds; time(&now); /* get current time; */ newyear = *localtime(&now); newyear.tm_hour = 0; newyear.tm_min = ...
Read MoreMinimum Swaps to Make Strings Equal in C++
Suppose we have two strings s1 and s2 of equal length consisting of letters only "x" and "y". Our task is to make these two strings equal to each other. We can swap any two characters that belong to different strings, which means − swap s1[i] and s2[j]. We have to find the minimum number of swaps required to make s1 and s2 equal, or return -1 if it is impossible to do so. So if the strings are s1 = “xy” and s2 = “yx”, then the output will be 2. If we swap s1[0] and s2[0], s1 = ...
Read MoreTriangle in C++
Suppose we have a triangle. We have to find the minimum path sum from top to the bottom. In each step, we can move to adjacent numbers on the row below.For example, if the following triangle is like[ [2], [3, 4], [6, 5, 7], [4, 1, 8, 3] ]The minimum path sum from top to bottom is 11 (2 + 3 + 5 + 1 = 11).Let us see the steps −Create one table to use in Dynamic programming approach.n := size of trianglefor i := n – 2 down to 0for ...
Read Moreiswpunct() function in C++ STL
In this article we are going to discuss the iswpunct() function in C++, its syntax, working and its return values.iswpunct() function is an inbuilt function in C++ which is defined in header file. The function checks whether the passed wide character is a punctuation character or not. This function is a wide character equivalent of ispunct(), which means it works the same as ispunct() the difference is it supports a wide character. So, the function checks if the argument passed is punctuation character then return any non zero integer value(true), else it will return zero(false)Punctuation characters are as follows! ...
Read MoreCount Number of Nice Subarrays in C++
Suppose we have an array of integers nums and an integer k. A subarray is known as nice subarray if there are k odd numbers on it. We have to find the number of nice sub-arrays. So if the array is [1, 1, 2, 1, 1], and k = 3, then the output will be 2, as the subarrays are [1, 1, 2, 1], and [1, 2, 1, 1]To solve this, we will follow these steps −ans := 0, n := size of nums arrayleft := 0 and right := 0, and count := 0define an array odd, fill this ...
Read MoreHouse Robber II in C++
Consider, you are a professional robber. And you are planning to rob houses along a street. Each house has a certain amount of money stored. All houses are arranged in a circle. That means the first house is the neighbor of the last house. We have to keep in mind that the adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night. So if we have a list of integers representing the amount of money of each house, determine the maximum amount of money you can ...
Read Moreiswspace() function in C++ STL
In this article we are going to discuss the iswspace() function in C++, its syntax, working and its return values.iswspace() function is an inbuilt function in C++ which is defined in header file. The function checks whether the passed wide character is a white space character or not.This function is a wide character equivalent of isspace(), which means it works the same as isspace() the difference is it supports a wide character. The function checks the if argument passed is a white space (‘ ‘) then return a non-zero integer value(true), else return zero(false)Syntaxint iswspace(wint_t ch);The function accepts only one ...
Read More