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 1301 of 2109
Maximum length subarray with difference between adjacent elements as either 0 or 1 in C++
We are given an array of any size and the task is to find the subarray of the given array with the elements having difference between adjacent elements as 0 or 1.Input − int arr[] = { 2, 1, 5, 6, 3, 4, 7, 6}Output − Maximum length subarray with difference between adjacent elements as either 0 or 1 are − 2Explanation − The adjacent elements in an array with difference as 0 or 1 are {2, 1}, {5, 6}, { 3, 4} and {7.6}. Therefore, the maximum length of subarray is 2.Input − int arr[] = { 2, 1, ...
Read MoreMaximum length subsequence with difference between adjacent elements as either 0 or 1 in C++
We are given an array of any size and the task is to find the subsequence in the given array with the elements having difference between adjacent elements as 0 or 1.Input − int arr[] = { 2, 1, 5, 6, 3, 4, 7, 6}Output − Maximum length subsequence with difference between adjacent elements as either 0 or 1 is − 3Explanation − The subsequence of adjacent elements in an array with difference as 0 or 1 are {2, 1}. Therefore, the maximum length of subsequence is 2.Input − int arr[] = { 2, 1, 7, 6, 5}Output − Maximum ...
Read MoreMaximum length subsequence with difference between adjacent elements as either 0 or 1 | Set 2 in C++
We are given an array of any size and the task is to find the subsequence in the given array with the elements having difference between adjacent elements as 0 or 1.Input − int arr[] = { 2, 1, 5, 6, 3, 4, 7, 6}Output − Maximum length subsequence with difference between adjacent elements as either 0 or 1 is: 3Explanation − The subsequence of adjacent elements in an array with difference as 0 or 1 are {2, 1}. Therefore, the maximum length of subsequence is 2.Input − int arr[] = { 2, 1, 7, 6, 5}Output − Maximum length ...
Read MoreMaximum count of substrings of length K consisting of same characters in C++
Given the task is to find the maximum count of substrings of length K consisting of same characters. Given a string s and another integer K, we have to count the occurrence of sub-strings of size K that have same characters.Out of the sub-strings that are found, we have to choose the sub-string occurring the maximum number of time.Let’s now understand what we have to do using an example −Inputs = ”tuuxyyuuc”, K = 2Output2ExplanationHere the sub-strings of length 2 and having same characters are: “uu” and “yy” but as it is seen that “yy” occurs only 1 time and ...
Read MoreMaximum decimal value path in a binary matrix in C++
Given the task is to find the maximum integer value that can be obtained while travelling in a path from the top left element to the bottom right element of a given square binary array, that is, starting from index [0][0] to index [n - 1][n - 1].While covering the path we can only move to right ([i][j + 1]) or to the bottom ([i + 1][j])The integer value will be calculate using the bits of the traversed path.Let’s now understand what we have to do using an example −Inputm = { {1, 1, 1, 1}, {0, 0, ...
Read MoreMaximum difference of zeros and ones in binary string in C++
Given the task is to find a sub-string from a given binary string and then the maximum difference between the number of zeroes and the ones.Let’s now understand what we have to do using an example −Inputstr = “100100110”Output2ExplanationIn the sub-array from the position 1 to 5 (“00100”), the difference between the zeros and ones = 4 – 1 = 3 which is the maximum that can be found.Inputstr = “00000”Output5Approach used in the below program as followsIn main() function create a string str to store the binary string. Also initialize a variable int size to store the size of ...
Read MoreMaximum distinct lowercase alphabets between two uppercase in C++
Given the task is to find the maximum number of distinct lower case alphabets that are present between two upper case alphabets in the given string.Let’s now understand what we have to do using an example −Inputstr = “JKyubDoorG”Output3Explanation“yub” is present between the two upper case alphabets K and D which makes the count 3.“oor” is also present between the two upper case alphabets D and G which makes the count 2 as ‘o’ is a repeating alphabet and we are looking for distinct alphabets.Therefore, the output is 3.Inputstr = “ABcefsTaRpaep”Output4Approach used in the below program as followsIn function Max() ...
Read MoreMaximum elements that can be made equal with k updates in C++
Given the task is to find the maximum number of elements that can be made equal in a given array after incrementing its elements by at-most k times.Let’s now understand what we have to do using an example −Inputa[] = {1, 3, 8}, k = 4Output2ExplanationHere we can obtain two fours by incrementing 1 three times and incrementing 3 four times, that makes a[] = {4, 4, 8}Inputarr = {2, 5, 9}, k = 2Output0Approach used in the below program as followsIn main() function initialize int a[], size and k to store the array elements, size of array and the ...
Read MoreMaximum elements which can be crossed using given units of a and b in C++
Given a binary array arr[] and two variables a and b with some initial values. To cross an element in the array arr[] there are two ways −If arr[i] == 1, then 1 unit can be used from a, with no change in b. If 1 unit is used from b, then a increases by 1 unit. (Note that the value of a cannot be incremented above its original value.)If arr[i] == 0, then 1 unit can be used from a or b.Let’s now understand what we have to do using an example −Inputarr[] = {0, 0, 0, 1, 1}, ...
Read MoreBitmasking and Dynamic Programming in C++
First, we will learn about bitmasking and dynamic programming then we will solve a problem related to it that will solve your queries related to the implementation.Bitmask also known as mask is a sequence of N -bits that encode the subset of our collection. The element of the mask can be either set or not set (i.e. 0 or 1). This denotes the availability of the chosen element in the bitmask. For example, an element i is available in the subset if the ith bit of mask is set. For the N element set, there can be a 2N mask ...
Read More