Server Side Programming Articles

Page 1221 of 2109

Find the Celebrity in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 257 Views

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 More

How to create heatmap in base R?

Nizamuddin Siddiqui
Nizamuddin Siddiqui
Updated on 11-Mar-2026 409 Views

A heatmap is a diagrammatic representation of data where the values are represented with colours. Mostly, it is used to display data that has slight variation and applied on matrix data. We can draw it for a full matrix, an upper triangular matrix as well as a lower triangular matrix. This can be done with the help of image function.Example1> M MOutput [,1] [,2] [,3] [,4] [,5] [,6] [,7] [,8] [,9] [,10] [1,] 7 5 4 4 3 6 5 8 3 5 [2,] 8 7 3 5 7 4 5 2 6 6 [3,] 3 2 4 2 5 12 7 3 10 2 [4,] 5 3 6 9 5 9 2 4 5 8 [5,] 3 8 5 5 4 4 4 1 2 5 [6,] 2 3 2 4 7 8 5 8 4 4 [7,] 5 6 4 4 7 3 4 8 8 2 [8,] 4 5 2 10 5 3 5 4 6 7 [9,] 8 6 4 1 4 11 6 4 6 6 [10,] 9 5 5 4 6 2 7 3 6 5Example> image(M)Output:Example2> M1 M1Output [,1] [,2] [,3] [,4] [,5] [,6] [1,] 24.75339 25.40680 23.76650 26.47724 24.54639 25.79895 [2,] 24.08571 25.17951 25.03599 25.63532 23.45812 25.39614 [3,] 24.53005 25.77095 26.21571 24.44029 24.69933 25.62839 [4,] 22.91202 25.49497 24.86587 25.25701 23.16166 24.34106 [5,] 25.37322 24.15308 25.58580 23.52173 25.25538 25.10577 [6,] 24.39613 26.06243 26.56054 25.19265 26.54187 24.35313Example> image(M1)Output:

Read More

Zigzag Iterator in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 342 Views

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 More

How to create a bar plot with ggplot2 using stat_summary in R?

Nizamuddin Siddiqui
Nizamuddin Siddiqui
Updated on 11-Mar-2026 1K+ Views

There are multiple ways to create a bar plot in R and one such way is using stat_summary of ggplot2 package. In this function, we need to supply a function for the y-axis and to create the bars we must use geom="bar". The main thing is to decide which function should be used for y-axis values.ExampleConsider the below data frame:> x y df dfOutput x y 1 Female 3 2 Male 3 3 Female 7 4 Male 3 5 Female 8 6 Female 5 7 Male 11 8 Male 6 9 Male 5 10 ...

Read More

Walls and Gates in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 637 Views

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

Flip Game II in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 404 Views

Suppose there are two players who are playing the flip game. Here we have a string that contains only these two characters: + and -, player1 and player2 take turns to flip two consecutive "++" into "--". The game ends when one player can no longer make a move and therefore the other one will be the winner. We have to define a function to check whether the starting player can guarantee a win.So, if the input is like s = "++++", then the output will be true, as the starting player can guarantee a win by flipping the middle ...

Read More

How to remove rows in an R data frame using row names?

Nizamuddin Siddiqui
Nizamuddin Siddiqui
Updated on 11-Mar-2026 16K+ Views

There are a lot of ways to subset an R data frame and sometimes we need to do it by removing rows. In general, the rows are removed by using the row index number but we can do the same by using row names as well. This can be done by storing the row names that should be removed in a vector and then removing through subsetting with single square brackets as shown in the below examples.ExampleConsider the below data frame:> x y row.names(df) dfOutput x y A ...

Read More

Binary Tree Longest Consecutive Sequence in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 283 Views

Suppose we have a binary tree; we have to check whether we can find the length of the longest consecutive sequence path. If the path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path need to follow parent to child but not reverse.So, if the input is like, then the output will be 3, as the Longest consecutive sequence path is 3-4-5, so return 3.To solve this, we will follow these steps −Define a function solveUtil(), this will take node, prev, len initialize it with ...

Read More

Binary Tree Vertical Order Traversal in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 495 Views

Suppose there is a binary tree, we have to find the vertical order traversal of its nodes' values. If two nodes are in the same row and column, the order should be from left to right.So, if the input is like, then the output will be [[9], [3, 15], [20], [7]]To solve this, we will follow these steps −Define one map mDefine a function solve(), this will take node, x initialize it with 0, if node is null, then −returnsolve(left of node, x - 1)solve(right of node, x + 1)insert value of node at the end of m[x]From the main ...

Read More

Generalized Abbreviation in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 339 Views

Suppose there is a word. We have to define a function that can generate the generalized abbreviations of a word.So, if the input is like "word", then the output will be ["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]To solve this, we will follow these steps −Define an array retDefine a function solve(), this will take s, idx, if idx >= size of s, then −insert s at the end of retreturny := substring of s from index 0 to idx - 1i := size of ynum := blank stringwhile (i >= ...

Read More
Showing 12201–12210 of 21,090 articles
Advertisements