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
Articles on Trending Technologies
Technical articles with clear explanations and examples
Find the Celebrity in C++
Suppose we have n people (labeled from 0 to n - 1) and among them, there may exist one celebrity. We can say a person x is a celebrity when all the other n - 1 people know x but x does not know any of them. Here we have to find who the celebrity is or verify that there is not one.We are allowed to ask only one question to person ‘A’, that "Hi, A. Do you know B?" to get information of whether A knows B or not. We have to ask minimum number of questions tofind out ...
Read MoreHow to perform post hoc test for Kruskal-Wallis in R?
The Kruskal-Wallis test is the non-parametric analogue of one-way analysis of variance. The non-parametric tests are used in situations when the assumptions of parametric tests are not met. If we find significant difference in Kruskal-Wallis then post hoc tests are done to find where the difference exists. For this purpose, we can perform dunn test. The function of dunn test can be accessed through FSA package.Example1Loading FSA package:> library(FSA)Consider the below data frame:> x1 y1 df1 df1Output x1 y1 1 E 1.1191117 2 D 1.1276032 3 D 1.5610692 4 E 1.1585054 5 E 1.0239322 6 C 0.8000165 ...
Read MoreProgram to find nth ugly number in C++
Suppose we have a number n; we have to find the nth ugly number. As we know that the ugly numbers are those numbers, whose prime factors are only 2, 3 and 5. So if we want to find 10th ugly number, the output will be 12, as the first few ugly numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 and so on.To solve this, we will follow these steps:Define an array v of size(n + 1)if n is same as 1, then:return 1two := 2, three := 3, five := 5twoIdx := 2, threeIdx := 2, fiveIdx := 2for initialize i := 2, when i
Read MoreHow to create an empty plot using ggplot2 in R?
The two most easy ways to create an empty plot using ggplot2 are using geom_blank function and also adding the theme_bw along with the geom_blank. The geom_blank will create an empty plot with white gridlines and grey background, on the other hand, addition of theme_bw will create the empty plot with grey gridlines and white background.ExampleConsider the below data frame:> set.seed(151) > x y df dfOutput x y 1 -0.05153895 0.3139643 2 0.76573738 0.1816184 3 -0.14673959 0.8201743 4 -0.11318581 1.6005576 5 -0.39551140 0.6770630 6 0.78227595 0.7446956 7 -1.39747811 0.7004385 8 -1.01883832 1.2728014 9 ...
Read MoreHow to find the mean of a square matrix elements by excluding diagonal elements in R?
There are many ways to find the mean of a matrix elements by excluding diagonal elements, this mean is actually the mean of lower triangular matrix and the upper triangular matrix. We can simply use mean function by creating a vector of lower and upper triangular matrix as shown in the below examples.Example1> M1 M1Output [, 1] [, 2] [, 3] [, 4] [1, ] 1 6 3 6 [2, ] 8 5 3 4 [3, ] 5 4 4 6 [4, ] 5 5 3 4 [5, ...
Read MoreZigzag Iterator in C++
Suppose there are two 1D arrays, we have to implement an iterator that will return their elements alternately. There will be two methods −next() − to get next elementhasNext() − to check whether the next element is present or not.So, if the input is like v1 = [1, 2] v2 = [3, 4, 5, 6] , then the output will be [1, 3, 2, 4, 5, 6], To solve this, we will follow these steps −Define one queue q of pairsFrom the initializer ake two arrays v1 and v2, if size of v1, then −insert { 0, 0 } into ...
Read MoreInorder Successor in BST in C++
Suppose we have a binary search tree and a node in it, we have to search the in-order successor of that node in the BST. As we know that the successor of a node p is the node with the smallest key greater than p.val.So, if the input is like root = [2, 1, 3], p = 1, then the output will be 2, To solve this, we will follow these steps −Define recursive method inorderSuccessor(), this will take root and pif root null, then −return nullif val of root val val){ return inorderSuccessor(root->right, p); ...
Read MoreHow to convert a string vector into an integer vector in R?
A string vector contains element inside double-quotes and an integer vector does not have any quotes. Sometimes integer values are stored in double-quotes hence the vector of these values is treated as a string vector in R but we need the integer values to perform mathematical operations. Therefore, we can use as.integer function to convert the string vector into an integer vector.Example1> x1 x1Output[1] "3" "2" "1" "2" "1" "1" "1" "1" "1" "1" "3" "3" "3" "1" "2" "1" "1" "2" [19] "2" "3" "3" "3" "3" "2" "3" "3" "3" "2" "1" "2" "3" "3" "2" "1" "2" "2" [37] "3" "3" "3" "2" "3" "2" "2" "1" "3" "3" "2" "2" "2" "1" "2" "3" "1" "3" [55] "3" "2" "1" "2" "2" "1" "2" "1" "1" "2" "2" "2" "3" "1" "3" "3" "1" "3" [73] "1" "1" "2" "2" "1" "3" "2" "3" "2" "2" "2" "2" "1" "3" "2" "1" "3" "3" [91] "3" "3" "1" "1" "1" "2" "2" "2" "2" "3" "1" "2" "2" "1" "3" "2" "2" "2" [109] "1" "1" "2" "3" "2" "2" "1" "1" "2" "2" "3" "2" "3" "2" "3" "2" "3" "2" [127] "2" "2" "2" "1" "1" "2" "1" "2" "2" "3" "3" "2" "2" "2" "3" "3" "2" "2" [145] "3" "2" "2" "3" "2" "3"Example> x1 x1Output[1] 3 2 1 2 1 1 1 1 1 1 3 3 3 1 2 1 1 2 2 3 3 3 3 2 3 3 3 2 1 2 3 3 2 1 2 2 3 [38] 3 3 2 3 2 2 1 3 3 2 2 2 1 2 3 1 3 3 2 1 2 2 1 2 1 1 2 2 2 3 1 3 3 1 3 1 1 [75] 2 2 1 3 2 3 2 2 2 2 1 3 2 1 3 3 3 3 1 1 1 2 2 2 2 3 1 2 2 1 3 2 2 2 1 1 2 [112] 3 2 2 1 1 2 2 3 2 3 2 3 2 3 2 2 2 2 1 1 2 1 2 2 3 3 2 2 2 3 3 2 2 3 2 2 3 [149] 2 3Example2> x2 x2Output[1] "19" "1" "19" "1" "13" "7" "11" "1" "13" "3" "19" "7" "3" "11" "7" [16] "3" "5" "1" "3" "11" "3" "2" "3" "5" "7" "7" "19" "7" "11" "7" [31] "7" "5" "17" "11" "7" "17" "2" "5" "5" "5" "5" "1" "13" "13" "5" [46] "19" "1" "13" "3" "3" "3" "19" "7" "7" "2" "3" "5" "1" "2" "5" [61] "3" "17" "11" "1" "13" "1" "1" "19" "17" "2" "17" "17" "11" "17" "13" [76] "2" "5" "2" "1" "17" "5" "5" "1" "13" "2" "13" "2" "2" "13" "19" [91] "3" "2" "1" "2" "11" "11" "13" "17" "19" "11" "19" "11" "1" "5" "19" [106] "7" "13" "19" "13" "11" "17" "11" "19" "2" "7" "19" "5" "17" "17" "5" [121] "1" "1" "7" "5" "11" "5" "7" "17" "13" "5" "1" "17" "13" "3" "1" [136] "17" "5" "5" "1" "2" "19" "11" "11" "7" "1" "5" "7" "13" "3" "2" [151] "2" "5" "17" "2" "7" "19" "19" "19" "7" "3"Example> x2 x2Output[1] 19 1 19 1 13 7 11 1 13 3 19 7 3 11 7 3 5 1 3 11 3 2 3 5 7 [26] 7 19 7 11 7 7 5 17 11 7 17 2 5 5 5 5 1 13 13 5 19 1 13 3 3 [51] 3 19 7 7 2 3 5 1 2 5 3 17 11 1 13 1 1 19 17 2 17 17 11 17 13 [76] 2 5 2 1 17 5 5 1 13 2 13 2 2 13 19 3 2 1 2 11 11 13 17 19 11 [101] 19 11 1 5 19 7 13 19 13 11 17 11 19 2 7 19 5 17 17 5 1 1 7 5 11 [126] 5 7 17 13 5 1 17 13 3 1 17 5 5 1 2 19 11 11 7 1 5 7 13 3 2 [151] 2 5 17 2 7 19 19 19 7 3Example3> x3 x3Output[1] "5" "10" "20" "15" "5" "15" "5" "5" "20" "20" "10" "10" "5" "5" "5" [16] "15" "5" "5" "15" "10" "10" "20" "20" "10" "20" "10" "5" "5" "15" "15" [31] "15" "15" "5" "10" "20" "15" "20" "5" "15" "20" "5" "20" "5" "20" "20" [46] "15" "15" "20" "5" "5" "10" "15" "15" "20" "20" "5" "5" "15" "20" "20" [61] "10" "10" "15" "10" "20" "5" "5" "15" "20" "5" "20" "20" "20" "5" "20" [76] "20" "15" "15" "15" "20" "10" "10" "15" "10" "10" "5" "5" "20" "20" "5" [91] "5" "10" "15" "15" "15" "10" "15" "20" "10" "20" "5" "10" "10" "15" "15" [106] "5" "15" "15" "10" "10" "20" "5" "20" "15" "10" "15" "15" "20" "20" "15" [121] "20" "20" "5" "5" "5" "5" "10" "20" "20" "10" "20" "5" "5" "20" "10" [136] "5" "5" "15" "10" "15" "10" "20" "20" "10" "20" "10" "20" "10" "15" "5" [151] "20" "20" "20" "15" "10" "20" "20" "10" "20" "20"Example> x3 x3Output[1] 5 10 20 15 5 15 5 5 20 20 10 10 5 5 5 15 5 5 15 10 10 20 20 10 20 [26] 10 5 5 15 15 15 15 5 10 20 15 20 5 15 20 5 20 5 20 20 15 15 20 5 5 [51] 10 15 15 20 20 5 5 15 20 20 10 10 15 10 20 5 5 15 20 5 20 20 20 5 20 [76] 20 15 15 15 20 10 10 15 10 10 5 5 20 20 5 5 10 15 15 15 10 15 20 10 20 [101] 5 10 10 15 15 5 15 15 10 10 20 5 20 15 10 15 15 20 20 15 20 20 5 5 5 [126] 5 10 20 20 10 20 5 5 20 10 5 5 15 10 15 10 20 20 10 20 10 20 10 15 5 [151] 20 20 20 15 10 20 20 10 20 20Example4> x4 x4Output[1] "501" "515" "515" "501" "515" "525" "501" "515" "515" "520" "525" "520" [13] "515" "501" "501" "525" "520" "515" "525" "525" "525" "525" "515" "515" [25] "515" "525" "520" "520" "525" "501" "520" "525" "520" "520" "501" "515" [37] "525" "520" "501" "501" "515" "520" "515" "520" "520" "520" "515" "501" [49] "515" "501" "520" "501" "525" "501" "501" "501" "525" "520" "520" "525" [61] "520" "501" "525" "520" "515" "520" "520" "525" "515" "515" "520" "520" [73] "520" "515" "515" "501" "525" "525" "501" "515" "525" "520" "515" "520" [85] "525" "525" "501" "501" "525" "515" "501" "525" "520" "501" "501" "501" [97] "501" "525" "501" "520" "520" "515" "501" "515" "515" "501" "520" "501" [109] "525" "525" "520" "515" "501" "520" "520" "515" "515" "501" "501" "520" [121] "515" "525" "501" "515" "501" "515" "515" "501" "520" "515" "501" "520" [133] "515" "520" "520" "515" "525" "515" "525" "515" "525" "520" "520" "515" [145] "515" "520" "501" "515" "525" "520"Example> x4 x4Output[1] 501 515 515 501 515 525 501 515 515 520 525 520 515 501 501 525 520 515 [19] 525 525 525 525 515 515 515 525 520 520 525 501 520 525 520 520 501 515 [37] 525 520 501 501 515 520 515 520 520 520 515 501 515 501 520 501 525 501 [55] 501 501 525 520 520 525 520 501 525 520 515 520 520 525 515 515 520 520 [73] 520 515 515 501 525 525 501 515 525 520 515 520 525 525 501 501 525 515 [91] 501 525 520 501 501 501 501 525 501 520 520 515 501 515 515 501 520 501 [109] 525 525 520 515 501 520 520 515 515 501 501 520 515 525 501 515 501 515 [127] 515 501 520 515 501 520 515 520 520 515 525 515 525 515 525 520 520 515 [145] 515 520 501 515 525 520
Read MoreProgram to remove sublist to get same number of elements below and above k in C++
Suppose we have a list of numbers called nums and another number k, we can remove any sublist at most once from the list. We have to find the length of the longest resulting list such that the amount of numbers strictly less than k and strictly larger than k is the same.So, if the input is like nums = [6, 10, 8, 9, 3, 5], k = 6, then the output will be 5, as if we remove the sublist [9] then we will get [6, 10, 8, 3, 5] and there are two numbers [3, 5] which are ...
Read MoreWalls and Gates in C++
Suppose we have one m x n 2D grid, and that is initialized with these three possible values.-1 for a wall or an obstacle.0 for a gate.INF This is infinity means an empty room.Here 2^31 - 1 = 2147483647 is INF as we may assume that the distance to a gate is less than 2147483647. Fill each empty room with the distance to its nearest gate. If it is impossible to reach a gate, it should be filled with INF.So, if the input is likeINF-10INFINFINFINF-1INF-1INF-10-1INFINFthen the output will be3-101221-11-12-10-134To solve this, we will follow these steps −Define an array dir ...
Read More