This post explains the TCS CodeVita problem Minimum Gifts step by step: the problem statement, input and output format, constraints, a sample test case and a working solution in Java that you can study and run.
Problem Description
A Company has decided to give some gifts to all of its employees. For that, company has given some rank to each employee. Based on that rank, company has made certain rules to distribute the gifts.
The rules for distributing the gifts are:
Each employee must receive at least one gift.
Employees having higher ranking get a greater number of gifts than their neighbours.
What is the minimum number of gifts required by company?
Constraints
1 < T < 10
1 < N < 100000
1 < Rank < 10^9
Input
First line contains integer T, denoting the number of testcases.
For each testcases:
First line contains integer N, denoting number of employees.
Second line contains N space separated integers, denoting the rank of each employee.
Output
For each testcase print the number of minimum gifts required on new line.
Time Limit
1
Examples
Example 1
Input
2
5
1 2 1 5 2
2
1 2Output
7
3Explanation
For testcase 1, adhering to rules mentioned above,
Employee # 1 whose rank is 1 gets one gift
Employee # 2 whose rank is 2 gets two gifts
Employee # 3 whose rank is 1 gets one gift
Employee # 4 whose rank is 5 gets two gifts
Employee # 5 whose rank is 2 gets one gift
Therefore, total gifts required is 1 + 2 + 1 + 2 + 1 = 7
Similarly, for testcase 2, adhering to rules mentioned above,
Employee # 1 whose rank is 1 gets one gift
Employee # 2 whose rank is 2 gets two gifts
Therefore, total gifts required is 1 + 2 = 3
( C ++ )
Recommended Codevita Problems
Count Pairs | TCS CodeVita 9 Solution ( Zone 1 ) 2020
Critical Planets | TCS CodeVita 9 Solution ( Zone 1 ) 2020
Prime Time Again | TCS CodeVita 9 Solution ( Zone 1 ) 2020
Minimize The Sum | TCS CodeVita 9 Solution ( Zone 1 ) 2020
Railway Station | TCS CodeVita 9 Solution ( Zone 1 ) 2020
Lift | TCS CodeVita 9 Solution ( Zone 1 ) 2020
Number Distancing | TCS CodeVita 9 Solution ( Zone 1 ) 2020
Hedger | TCS CodeVita 9 Solution ( Zone 1 ) 2020
Codekart | TCS CodeVita 9 Solution ( Zone 1 ) 2020
If you have any doubts regarding this problem or need the solution in other programming languages then leave a comment down below .
Tip: try to solve the problem yourself before reading the solution. Use the code as a reference to check your approach, and make sure you understand why it works.
More TCS CodeVita solutions All coding problems MCQ practice
See everything in one place: Coding Problems and Solutions
can we get a python solution pleaseee
ReplyDeleteneed solution in java language
ReplyDeleteconvert this c++ logic will be same
Delete#include
using namespace std;
int mingifts (vector &ratings) {
int gifts = 0;
int size = ratings.size();
// if the vector is empty: return zero
if (size == 0) return gifts;
int giftState = 1;
for (int i = 0; i < size; i++)
{
if (i == size - 1)
{
gifts += giftState;
continue;
}
if (ratings[i + 1] > ratings[i])
{
gifts += giftState;
giftState++;
}
else if (ratings[i + 1] < ratings[i])
{
int startgiftState = giftState;
int startIndex = i;
while (i + 1 < size && ratings[i + 1] < ratings[i])
{
i++;
}
int startgiftStateFromRight = i - startIndex + 1;
gifts += (startgiftStateFromRight + 1) * startgiftStateFromRight / 2;
// Adjusting for the local maxima point.
if (startgiftState > startgiftStateFromRight)
{
gifts += startgiftState - startgiftStateFromRight;
}
// Let's exclude this local minima point now as this will be accounted in the next iteration.
gifts--;
i--;
giftState = 1;
}
else
{
gifts += giftState;
giftState = 1;
}
}
// return the miimum gifts required the the given ratings vector
return gifts;
}
//driver code
int main()
{
int t;
cin>>t;
while(t--)
{
long n,l;
cin>>n;
vector rating; // vector of ratings
for(int i=0;i>l;
rating.push_back(l);
}
//print the output, mingifts function return the minimum gifts required
cout<<mingifts(rating)<<endl;
}
return 0;
}
Here, you'll be able to|you possibly can} deposit and withdraw by way of Bitcoin, Bitcoin Cash, Tether, Litecoin, Ethereum, and Dogecoin. It’s an excellent thing in the sense that it means you'll be able to|you possibly can} play cellular games which might be} of high quality|of prime of the range|of prime quality} and profit from the newest developments in sport technology. It’s a very trendy on line casino, providing as it does eight cost methods, which include four cryptos – Bitcoin, Bitcoin Cash, Litecoin, and Ethereum. Indeed, at any level of the day, there are all the time hundreds of gamers online able to compete with you. Ignition has a 슬롯머신 cellular app – and it’s simply one of the best we’ve used. In the United Arab Emirates, however, any kind of playing is prosecuted.
ReplyDelete