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
Articles on Trending Technologies
Technical articles with clear explanations and examples
Maximum sum such that no two elements are adjacent Alternate Method in C++ program
In this problem, we are given an array arr[] of size n consisting of positive values. Our task is to create a program to find the maximum subsequence sum in such a way that no two consecutive elements of the array.Problem Description − We need to find the sum of subarray which has elements of the array but no two adjacent elements of the array can be taken into consideration.ExampleLet’s take an example to understand the problem, Inputarr[] = {5, 2, 1, 9, 6}OutputExplanation −Subarray sum are : {5, 1, 6}, sum = 5 + 1 + 6 = 12 ...
Read MoreCheck if an array is stack sortable in C++
Suppose we have an array nums of unique elements from 1 through n. We have to check whether it is stack-sortable or not. An array is stack sortable when it can be stored in some other array using a temporary stack.To solve this, we can use any of these operations on the array −Delete the starting element of array and push that item into the stack.Delete the top element of the stack and insert it to the end of second array.Now if all the element of the given array is transferred to the second array by these operations so the ...
Read MoreProgram to get next integer permutation of a number in C++
Suppose we have a number n, we have to find the next bigger permutation of its digits. When n is already in its largest permutation, then rotate it down to the smallest permutation.So, if the input is like n = 319, then the output will be 391.To solve this, we will follow these steps −Define a function makeArray(), this will take x, Define an array retwhile x is non-zero, do −insert x mod 10 at the end of retx := x / 10reverse the array retreturn retDefine a function combine(), this will take an array v, ret := 0for each ...
Read MoreProgram to find number of operations needed to decrease n to 0 in C++
Suppose we have a number n. Now consider an operation where we can either 1. Decrement n by one 2. If n is even number, then decrement it by n / 2 3. If n is divisible by 3, then decrement by 2 * (n / 3) Finally find the minimum number of operations required to decrement n to zero.So, if the input is like n = 16, then the output will be 5, as n = 16 even then decreases it by n/2 4 times, it will be 1. Then reduce it by 1 to get 0. So total ...
Read MoreProgram to find maximum number of package that can be bought by buyers in C++
Suppose we have two lists sales and buyers. Each element in sales contains two values in the form [day, price] this indicates the package is available for sale only on that day for that given price. And each element in buyers in the form [payday, amount] indicates that the buyer has that amount of money to spend on payday and afterward. If each buyer can buy at most one package, and each package can be sold to only one person, find the maximum number of packages that can be bought.So, if the input is like sales = [[0, 5], [0, ...
Read MoreMaximums from array when the maximum decrements after every access in C++ Program
In this problem, we are given an array arr[] of N integers and an integer m. Our task is to create a program to find the maximums from array when the maximum decrements after every access.Problem Description − We need to find the maximum sum of maximum elements of the array and decrease the max taken by one k times.Let’s take an example to understand the problem, Inputarr[] = {3, 6, 7, 8, 8}, k = 3OutputExplanationFirst iteration: array before = {3, 6, 7, 8, 8}, max = 8, sum = 8, array after update = {3, 6, 7, 7, ...
Read MoreProgram to count number of ways we can place nonoverlapping edges to connect all nodes in C++
Suppose we have a number n that is representing the number of nodes that are placed circularly. We have to find the number of ways we can place n / 2 edges such that every node is connected by an edge, and that edges does not intersect with each other. If the answer is very large then return result mod 10^9 + 7.So, if the input is like n = 4, then the output will be 2, as we can group them like below −To solve this, we will follow these steps −Define an array dp of size (n/2 + ...
Read MoreCheck if a string can become empty by recursively deleting a given sub-string in C++
Suppose, we are given two strings, str1 and str2. str2 is a substring of str1, and we can delete str2 from str1. It is possible, that the string str2 appears multiple times in str1. Our goal here is to find out if str1 becomes a null string if we keep removing str2 from str1 multiple times. If it is possible we return 1, otherwise 0.So, if the input is like str1 = "CCCPPPPPP", str2 = "CPP"; then the output will be true.To solve this, we will follow these steps −while size of str1 > 0, do −index := return the ...
Read MoreCheck if a string contains a palindromic sub-string of even length in C++
Suppose, we are given a string that contains only lowercase letters. Our task is to find if there exists a substring in the given string that is a palindrome and is of even length. If found, we return 1 otherwise 0.So, if the input is like "afternoon", then the output will be true.To solve this, we will follow these steps −for initialize x := 0, when x < length of string - 1, increase x by 1, do −if string[x] is same as string[x + 1], then:return truereturn falseExample (C++)Let us see the following implementation to get better understanding −#include ...
Read MoreCheck if a string follows anbn pattern or not in C++
Suppose, we are given a string that is made of only two letters a and b. We have to find out if the string is of the form anbn, or in other words it contains n number of a's followed by n number of b's. If true, we return 1 otherwise 0.So, if the input is like "aaaaaaaaaaaabbbbbbbbbbbb", then the output will be true.To solve this, we will follow these steps −length := length of input_stringfor initialize i := 0, when i < length, update (increase i by 1), do &minusif input_string[i] is not equal to 'a', then −Come out ...
Read More