Watering plants

Imagine you are a park ranger responsible for maintaining N plants along a hiking trail. The plants are arranged in a straight line and numbered from 0 to N - 1: with the ith plant located at x = i. You have a water source at x = -1, which you must use to refill your watering can.

Each plant requires a different amount of water and you must water them in order, from left to r ight. If you run out of water while watering a plant, you must return to the water source to refill your watering can before continuing to the next plant. You cannot refill your watering can before it is empty or it
cannot water the next plant, and it takes one step to move one unit on the x-axis.
Determine the number of steps you must take to water all of the plants along the hiking trail successfully.
Notes
- You start at -1.
- The location of the plants starts from O.

Function description
Complete the function solution() provided in the editor. The function takes the following 3 parameters and returns the solution:

- N. Represents the number of plants
- C : Represents the capacity of the water can
- plants : Represents the water requirements of the plant

Input format for custom testing
Note: Use this Input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code
-The first line contains N denoting the number of plants.
-The second line contains C denoting the capacity of the can Show More

Profits

John is a shopkeeper. He can buy N items from the producer, the ith of which costs cost[i]. He can sell the it item at sell[i]. Initially, he has K dollars and O items in his shop. At any moment, his store can accommodate at most 1 item, which means he has to sell the previous item before buying the
next one from the producer.
What is the maximum profit he can achieve?

Notes
- He can buy and sell any number of items.
- He can use the profit previously earned to buy new items.
- One item can be bought and sold at most once.
- Items can be bought and sold in any order and not necessarily in the order given as input.

Function description following 4 parameters and returns the solution:
- N: Represents the number of items
- K: Represents the initial amount
- cost: Represents the cost price of items
- sell. Represents the selling price of items

Input format for custom testing
Note: Use this input format if you are testing against custom
input or writing code in a language where we don't provide
boilerplate code
- The first line contains N. denoting the number of items.
- The second line contains K, denoting the initial amount.
- The third line contains cost, denoting the cost price of items
- The fourth line contains sell, denoting the selling price of items

Output format
Print an integer representing the maximum total profit. Show More

Balanced mixture

Given A number of powerful resources and B number of weak resources. You have to select a balanced mixture of these resources. A balanced mixture has C resources containing no less than 4 powerful resources and no less than one weak resource. You are given integers A, B, and C. Each powerful and weak
resource is unique in itself. Hence, two mixtures with the same number of pow erful and weak resources are considered different if at least one of the resources is different in the 2 mixtures. Print the number of ways of selecting a balanced mixture
with the given number of resources.
Function description
Complete the function Balanced(). This function takes the following 3 parameters and returns the required answer:
- A: Represents the number of powerful resources
- B: Represents the number of weak resources
- C. Represents the number of resources in a balanced mixture

Input format for custom testing
Note: Use this input format if you are testing against custom
input or writing code in a language where we don't provide
boilerplate code
- The first line contains an integer A denoting the number of powerful resources.
- The second line contains an integer B denoting the number of weak resources
- The third line contains an integer C denoting the number of resources in a balanced mixture Show More

Software developers at Amazon are developing a new library for Natural Language Processing. In one of its
modules, every string needs to be preprocessed in a particular manner to find the length of its longest self-sufficient
proper substring
A self-sufficient proper substring is one where
1. the substring is not the entire string s
2.no letter that occurs inside the substring also occurs out side the substring

Given the string fullString of length n, find the length of its longest self-sufficient proper substring. If none exists,
return 0.
Example
fullString = "amazonservices"

Here The length fullString, n = 14. Show More