Server Side Programming Articles - Page 1890 of 2650

In this tutorial, we will be discussing a program to find the number of all perfect divisors of a number.For this we will be provided with a number. Our task is to count all the perfect divisors of that given number.Example#include using namespace std; //checking perfect square bool if_psquare(int n){    int sq = (int) sqrt(n);    return (n == sq * sq); } //returning count of perfect divisors int count_pdivisors(int n){    int count = 0;    for (int i=1; i*i

In this tutorial, we will be discussing a program to find the number of all palindromic subsequences in a given string.For this we will be provided with a string. Our task is to find the number of palindromic subsequences that can be made in that given string.Example#include #include using namespace std; //returning total palindromic sequence int count_palin(string str){    int N = str.length();    //creating a 2D array    int cps[N+1][N+1];    memset(cps, 0 ,sizeof(cps));    for (int i=0; i

In this tutorial, we will be discussing a program to find the number of palindromes which are squares of a palindrome.For this we will be provided with two values L and R. Our task is to find the number of super palindromes in the given range. A super palindrome is the one in which the number and its square both are palindromes.Example#include using namespace std; //checking if the number is a palindrome bool if_palin(int x){    int ans = 0;    int temp = x;    while (temp > 0){       ans = 10 * ans + ... Read More

In this tutorial, we will be discussing a program to find the number of palindrome sub strings in a string.For this we will be given a string. Our task is to count the number of palindrome sub strings in the given string with length greater than 3.Example#include using namespace std; //counting palindrome strings int count_pstr(char str[], int n){    int dp[n][n];    memset(dp, 0, sizeof(dp));    bool P[n][n];    memset(P, false , sizeof(P));    for (int i= 0; i< n; i++)       P[i][i] = true;    for (int i=0; i

In this tutorial, we will be discussing a program to find the number of pairs with the given XOR.For this we will be provided with an array and a value. Our task is to find the number of pairs whose XOR is equal to the given value.Example#include using namespace std; //returning the number of pairs //having XOR equal to given value int count_pair(int arr[], int n, int x){    int result = 0;    //managing with duplicate values    unordered_map m;    for (int i=0; i

In this tutorial, we will be discussing a program to find the number of pairs of an array which differ in K bits.For this we will be provided with an array and an integer K. Our task is to find the number of pairs who differ by K bits in their binary representation.Example#include using namespace std; //counting number of bits in //binary representation int count_bit(int n){    int count = 0;    while (n) {       if (n & 1)          ++count;       n >>= 1;    }    return count; } ... Read More

In this tutorial, we will be discussing a program to find the number of pairs of adjacent nodes whose XOR is an odd number.For this we will be provided with a binary tree. Our task is to count the number of pairs of adjacent elements whose XOR is an odd number.Example Live Demo#include using namespace std; //node structure of tree struct Node {    int data;    struct Node *left, *right; }; //finding the pairs whose XOR //is odd int count_pair(Node* root, Node *parent=NULL){    if (root == NULL)       return 0;    //checking pair of XOR is ... Read More

In this problem, we are given a data stream that is continuously reading integers. Our task is to create a program that will read elements and calculate the medians for these elements.The Median of an array is the middle element from a sorted sequence(it can be ascending or descending).Calculating medianFor odd count, the median is the middle elementFor even count, the median is average of two middle elementLet’s take an example to understand the problem, Input − 3, 65, 12, 20, 1At each input, Input - 3 : sequence -(3) : median - 3 Input - 65 : sequence -(3, ... Read More

Problem statementGiven that integers are read from a data stream. Find median of elements read so for in an efficient wayAfter reading 1st element of stream - 10 -> median - 10After reading 2nd element of stream - 10, 20 -> median - 15After reading 3rd element of stream - 10, 20, 30 -> median - 20, so on...Algorithm1. Use a max heap on left side to represent elements that are less than effective median,    and a min heap on right side to represent elements that are greater than effective median 2. After processing an incoming element, the number ... Read More

In this problem, we are given an array of n integers and we are adding K elements to the array and then find the median of the resultant array. Given the condition, N+k is odd.Let’s take an example to understand the problem, Input −array = {23, 65, 76, 67} ; k =1Output −67To solve this problem, we will sort the given elements in ascending order and then add k elements at the end of the array i.e. we will take k greater elements.The condition is given that n+k is odd. So, the median can be calculated using the formula, (n+k)/2.ExampleProgram ... Read More