Print modified array after executing the commands of addition and subtraction

You are given an array of size n, initially all the values in the array will be 0, and the queries. Each query contains the four values, type of the query T, left point of the range, the right point of a range and a number k, you have to …

Read morePrint modified array after executing the commands of addition and subtraction

Check in binary array the number represented by a subarray is odd or even

The problem “Check in binary array the number represented by a subarray is odd or even” states that you are given a binary array and a range. The array consists of the number in the form of 0s and 1s. The problem statement asks to find out the number represented …

Read moreCheck in binary array the number represented by a subarray is odd or even

Non-overlapping sum of two sets

Problem Statement The problem “Non-overlapping sum of two sets” states that you are given two arrays as input values as arrA[] and arrB[] of the same size n. Also, both of the arrays have distinct elements individually and some common elements. Your task is to find out the total sum …

Read moreNon-overlapping sum of two sets

Queries for GCD of all numbers of an array except elements in a given range

Problem Statement The “Queries for GCD of all numbers of an array except elements in a given range” problem states that you will be given an integer array and a q number of queries. Each query contains the number left and right. The problem statement asks to find out the …

Read moreQueries for GCD of all numbers of an array except elements in a given range

Maximum length subsequence with difference between adjacent elements as either 0 or 1

Problem Statement You are given an integer array. The problem “Maximum length subsequence with difference between adjacent elements as either 0 or 1” asks to find out the maximum subsequence length with the difference between the adjacent elements should be none other than 0 or 1. Example arr[] = {1, …

Read moreMaximum length subsequence with difference between adjacent elements as either 0 or 1

Replace two consecutive equal values with one greater

Problem Statement Suppose you have an integer array. The problem “Replace two consecutive equal values with one greater” asks to replace all those pair values say ‘a’ which comes consecutively with a number “a+1” 1 greater than them (two consecutive numbers), such that even after the modification or repetition there …

Read moreReplace two consecutive equal values with one greater

Check if the given array can represent Level Order Traversal of Binary Search Tree

Problem Statement The problem “Check if the given array can represent Level Order Traversal of Binary Search Tree” states that you are given a level order traversal of the binary search tree. And using the level order traversal of the tree. We need to efficiently find if the level order …

Read moreCheck if the given array can represent Level Order Traversal of Binary Search Tree