## C++ Program to find table plate ordering maintaining given conditions

Updated on 08-Apr-2022 11:12:45
Suppose we have two numbers h and w. The height and width of a table. The table is divided into h × w cells. Into each cell of the table, we can either put a plate or keep it empty. As each guest has to be seated next to their plate, we can only put plates on the edge of the table — into the first or the last row of the rectangle, or into the first or the last column. To make the guests comfortable, no two plates must be put into cells that have a common side or ... Read More

## C++ Program to find minimal sum of all MEX of substrings

Updated on 08-Apr-2022 11:08:42
Suppose we have a binary string S with n bits. Let an operation MEX of a binary string be the smallest digit among 0, 1, or 2 that does not occur in the string. For example, MEX(001011) is 2, because 0 and 1 occur in the string at least once, MEX(1111) is 0, because 0 is not present and 0 is minimum. From the given string S. You should cut it into any number of substrings such that each character is in exactly one substring. It is possible to cut the string into a single substring — the whole string. ... Read More

## C++ Program to get difference between maximum and minimum water in barrels

Updated on 08-Apr-2022 11:04:27
Suppose we have an array A with n elements and another value k. We have n barrels lined up in a row, they are numbered from left to right from one. Initially, the i-th barrel contains A[i] liters of water. We can pour water from one barrel to another. In one move, we can take two different barrels x and y (the x-th barrel shouldn't be empty) and pour any possible amount of water from barrel x to barrel y. (assume that barrels have infinite capacity). We have to find the maximum possible difference between the maximum and the minimum ... Read More

## C++ Program to find array after removal from maximum

Updated on 08-Apr-2022 11:01:00
Suppose we have an array A with n elements and another value k. We want to perform k following operations. One operation is like −Let d is the maximum value of the arrayFor every index i from 1 to n, replace A[i] with d - A[i]We have to find the final sequence.Problem CategoryAn array in the data structure is a finite collection of elements of a specific type. Arrays are used to store elements of the same type in consecutive memory locations. An array is assigned a particular name and it is referenced through that name in various programming languages. ... Read More

## C++ Program to count number of teams can be formed for coding challenge

Updated on 08-Apr-2022 10:57:10
Suppose we have two numbers a and b. In a coding challenge, there are 4 slots for participants in a team. There are a number of programmers and b number of mathematicians. We have to count how many teams can be formed, if: each team must have at lease one programmer and at least one mathematician.Problem CategoryVarious problems in programming can be solved through different techniques. To solve a problem, we have to devise an algorithm first, and to do that we have to study the particular problem in detail. A recursive approach can be used if there is a ... Read More

## C++ Program to find length of substring song from main song

Updated on 08-Apr-2022 10:54:27
Suppose we have a string S with n characters and two values l and r. Amal has written song and shared it to Bimal. The song is a string consisting of lowercase English letters. Bimal made up a question about this song. The question is about a subsegment of the song starting from the index l to r. Bimal considers a substring made up from characters on this segment and repeats each letter in the subsegment k times, where k is the index of the corresponding letter in the alphabet. As an example, if the question is about the substring ... Read More

## C++ Program to find how many pawns can reach the first row

Updated on 08-Apr-2022 10:51:02
Suppose we have two binary strings S and T of size n. Consider there is a chessboard of size n by n.Currently, there are some pawns in the n-th row. There are also enemy pawns in the 1-st row. On one move, we can move one of our pawns. A pawn can move one square up (from (i, j) to (i−1, j)) if there is no pawn in the destination square. And a pawn can move one square diagonally up (from (i, j) to either (i−1, j−1) or (i−1, j+1)) if and only if there is an enemy pawn in ... Read More

## C++ Program to find maximal achievable diversity of music notes

Updated on 08-Apr-2022 10:46:58
Suppose we have a string S with n elements. Amal's song consists of n notes, which we will treat as positive integers. The diversity of a song is the number of different notes it contains. We want to make it more diverse. We cannot arbitrarily change the song. Instead, for each of the n notes in the song, she can either leave it as it is or increase it by 1. Given sequence is a song where integer is describing the notes, we have to find out the maximal, achievable diversity.Problem CategoryThe above-mentioned problem can be solved by applying Greedy ... Read More

## C++ Program to count minimum problems to be solved to make teams

Updated on 08-Apr-2022 10:44:07
Suppose we have an array A with n elements. There are n students in a university, n is even. The i-th student has programming skill equal to A[i]. The team leader wants to form n/2 teams. Each team should consist of exactly two students, and each student should belong to exactly one team. Two students can form a team only if their skills are equal. Students can solve problems to increase their skill. If they solve one problem, their skill will be increased by 1. We have to find the minimum total number of problems students should solve to form ... Read More

## C++ Program to count square root cube root and both in given range

Updated on 08-Apr-2022 10:40:08
Suppose we have a number n. We have to count the number of integers x, in range 1 to n such that, that x is a square of a positive integer number or a cube of a positive integer number (or both a square and a cube simultaneously).Problem CategoryVarious problems in programming can be solved through different techniques. To solve a problem, we have to devise an algorithm first, and to do that we have to study the particular problem in detail. A recursive approach can be used if there is a recurring appearance of the same problem over and ... Read More
Advertisements