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 1716 of 2547
Number 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 MorePalindrome by swapping only one character
In a C++ environment, the palindrome is a process where a set or string remains same from the intial stage of the process to termination of that same particular process. Assume, we have a string denoted as the str[]. And the task is to check the string will be paindrome or not after performing the swapping process with only one character for once. Here is a general example of the swapping process − Input : ARBRDD Output : true Explanation: Swap the value A(1st index present in the list) with the R. Input : INDBAN Output : true Explanation: ...
Read MorePrint reverse string after removing vowels
The reverse() is a pre-installed and predefined header file, which is used to define as a template in a process in a C++ environment. The method is able to reverse the elements from last to first manner in a range for any value container. For this process the time complexity is O(n). Lets assume, we have a string or a sentance declared as str[] with some data elements and now the task is to perform reverse process after removing the vowels from that string to get the final outcome. Here is some general examples of the process method − ...
Read MoreProgram to reverse a string (Iterative and Recursive)
The reverse() is a pre-installed and predefined header file, which is used to define as a template in a process in a C++ environment. The method is able to reverse the elements from last to first manner in a range for any value container. For this process the time complexity is O(n). Lets assume, we have a string declared as str[] with some data elements and now the task is to perform reverse process on this string to get the final outcome. Here is a general example of the process − Input string is here : S = "ARBRDD" ...
Read MoreCount palindromic characteristics of a String
In a C++ environment, the palindrome is a characteristics where we get the same value after getting the result. Assume, there is a string denoted as S and the length is N. Now we need to run an operation on that string to find the palindromic characteristic is the number of k-palindromes in a given range. Here is a general example of the process − Input for the process : abba Output by the process : 6 1 0 0 Explanation of the method: "6" 1-palindromes numbers operation = "a", "b", "b", "a", "bb", "abba". "1" 2-palindromes numbers operation ...
Read More