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 1538 of 2109
C++ code to count local extrema of given array
Extrema are such numbers which are either minima or maxima. In other words, it is a number or element which is either greater than or less than both of its adjacent values. Suppose we have an array A with n elements. An element of this array A[i] is called a local minimum if and only if it is strictly less than both of its neighbours. Also if it is strictly greater than its neighbours it will be local maximum. For A[0] and A[n-1] as there are only one neighbour they are not maxima or minima. We have to find the ...
Read MoreNumber of palindromic subsequences of length k where k <= 3
Palindromes are series of letters, numbers or characters which have same starting and ending point. Also, they are same when read from left to right and right to left. A subsequence of a string is a new string which is made by removing some of the characters from the original string without changing the relative order of the characters which are remaining. Suppose you are given a string of length N. You want to find palindromic subsequences of length K from the string. Note that value of K can be less than or equal to 3. In this article, we ...
Read MoreNumber of palindromic paths in a matrix
Palindromic pathways are very useful in solving various problems involving patterns and sequences. It can be used in finding correct path in a maze without reversing, palindromes in a sequence of letters, etc., It can also be used to identify symmetric patterns and structures. In this article, we will discuss about palindromic paths and ways to find such paths in a matrix using C++. Palindromes are series of letters, numbers or characters which have same starting and ending point. Also, they are same when read from left to right and right to left. A path in a matrix is a ...
Read MoreNumber of palindromic permutations
Permutations are possible in strings as well as numbers. A string can have permutations equal to the factorial of its number of characters. These permutations can be palindromic under certain circumstances. In this article, we will discuss about how palindromic permutations occur in a string. We will also find the number of palindromic permutations possible in a string using C++. Permutation is a mathematical process of rearranging the letters or characters from a specified string or words. In other words, it is rearrangement of objects or elements in an order. A palindrome is a set of character which are same ...
Read MoreNumber of ordered pairs such that Ai & Aj = 0
Suppose you are given an array and you have to find the total count of ordered pairs formed such that Ai & Aj = 0. You are given an array A[A1, A2, A3, …An]. You have to find ordered pairs of Ai and Aj such that their bitwise AND operation will give the result equal to 0. In other words, you have to count the pairs of elements (i, j) whose bitwise AND operation is zero. For example, we have an array [3, 4, 2]. The binary representation of each element are as follows − A1 = 3 = ...
Read MoreNumber of n digit stepping numbers - space optimized solution
In this article, we will learn about stepping numbers. We will find the possible number of n digit numbers which are also stepping numbers using several C++ techniques. We will also discuss about the most space optimized solution. Let’s first discuss about stepping numbers. These are such numbers which have adjacent digits in such a way that they all have a difference of 1. For example, 321- each of the adjacent digits (3, 2, 1) have a difference of 1 consecutively. Here, we will be given the value of N and then we have to find the count of all ...
Read MoreNumber of n digit numbers that do not contain 9
Suppose you have a given number N. Now, you want to find those numbers of N digit which do not contain 9. This question can be solved by permutation and combination mathematically. In this article, we will find such numbers and count them using C++. Suppose you have to find 1-digit numbers which do not contain 9. So, these numbers are (0 – 8). There are in total 8 such numbers. Similarly, we have to find the count of N digit such numbers. Here, we will be given the value of N and then we have to find the count ...
Read MoreNumber of mismatching bits in the binary representation of two integers
Binary language is the language of the computers. So, every integer, character or symbols needs to be converted into binary system and vice versa. There is binary representation to all high-level language. In this article, we will discuss about the binary representation of integers. Also, we will find the mismatching bits in the binary representation of two integers. Input Output Scenarios We are given two integers X and Y. The number of mismatching bits in their binary representation is the output. Input: X = 25, Y = 15 Output: 3 Input: X = 6, X = 19 Output: 3 ...
Read MoreNumber of matches required to find a winner
Tournaments can be of various types- single elimination, double elimination, league etc., Suppose you are an organizer and you want to know about how many matches needs to conducted in order to conduct the tournament according to the rules of the game. In this article, we will discuss about different ways to find the number of matches required to find a winner using C++. Understanding the Problem In a single elimination tournament, we have series of matches in which each team or player gets to compete with the other one. In each match, there are two teams or players. The ...
Read MoreGiven two numbers as strings, find if one is a power of other
Assume we have a data set of some numbers as a string and denoted as str[]. Now the task is to multiply the two large numbers which represents a string here. We need to find out from those two numbers as strings, find if one is a power of other. Here is a general example of the process − Input for the process us: a = "374747", b = "52627712618930723" Output : YES THE VALUE IS HERE Explanation of the process: 374747^3 = 52627712618930723 Input for the process is : a = "2", b = "4099" Output : NO ...
Read More