Jar of Candies
There is a jar full of candies for sale at a mall counter. Jar has the capacity ‘N’. That is, jar can contain maximum ‘N’ candies when a jar is full. At any point in time jar can not have 0 or fewer candies.

Given the number ‘K’, the number of candies the customer wants. Your task is to return the candies left in the jar.

Note:

If 'K' is greater than 'N', return -1 denoting the invalid order.

For example:

Given if 'N' = 10, 'K' = 5. Then 5 candies are left in the jar after the event.

Input format:

The first line of input contains an integer ‘T’ denoting the number of test cases. The first and the only line of each test case contains two space-separated integers N and K, where ‘N’ is the number of candies in jar and ‘K’ is the number of candies the customer requires.

Output format:

For each test case, return the candies left in the jar. If the order is invalid return -1. The output of each test case will be printed in a separate line.

Note:

You don’t need to print anything; it has already been taken care of. You just need to implement the given function.

Constraints:

1

Question

Jar of Candies

There is a jar full of candies for sale at a mall counter. Jar has the capacity ‘N’. That is, jar can contain maximum ‘N’ candies when a jar is full. At any point in time jar can not have 0 or fewer candies.

Given the number ‘K’, the number of candies the customer wants. Your task is to return the candies left in the jar.

Note:

If 'K' is greater than 'N', return -1 denoting the invalid order.

For example:

Given if 'N' = 10, 'K' = 5. Then 5 candies are left in the jar after the event.

Input format:

The first line of input contains an integer ‘T’ denoting the number of test cases.

The first and the only line of each test case contains two space-separated integers N and K, where ‘N’ is the number of candies in jar and ‘K’ is the number of candies the customer requires.

Output format:

For each test case, return the candies left in the jar. If the order is invalid return -1.

The output of each test case will be printed in a separate line.

Note:

You don’t need to print anything; it has already been taken care of. You just need to implement the given function.

Constraints:

1 <= T <= 5
1 <= N, K <= 10^4

Time Limit: 1 second

Accepted Answer

Comparing Candies

The main idea is to check if K is greater than N or not.

If K is lesser than N, therefore, we can give the customer K candies and return the remaining candies in the jar by subtracting K from N.
If K is greater than N therefore, we can't give customer K candies, Hence return -1.

Space Complexity: O(1)Explanation:

O(1).

Since we are not using any extra space to keep track of the elements.

Time Complexity: O(1)Explanation:

O(1).

This is because comparing 2 numbers is constant time work.

Python (3.5)

'''
	Time Complexity : O(1)
	Space Complexity : O(1)
'''

def candiesInJar(n, k):
    
    if n >= k:
        
        return (n - k)
        
    else:
        
        return -1

Java (SE 1.8)

/*
	Time Complexity : O(1)
	Space Complexity : O(1)
*/

public class Solution {
	public static int candiesInJar(int n, int k) {
		if (n >= k) {
			return n - k;
		} else {
			return -1;
		}
	}
}

C++ (g++ 5.4)

/*

	Time Complexity : O(1)

	Space Complexity : O(1)

*/



int candiesInJar(int n, int k)

{

	if (n >= k) 

	{

		return n - k ;

	}

	else 

	{

		return -1 ;

	}

}

There is a jar full of candies for sale at a mall counter. Jar has the capacity ‘N’. That is, jar can contain maximum ‘N’ candies when a jar is full. At any point in time jar can not have 0 or fewer candies.

Given the number ‘K’, the number of candies the customer wants. Your task is to return the candies left in the jar.

Note:

For example:

Input format:

Output format:

Note:

Constraints:

Top TCS Software Developer interview questions & answers

Popular interview questions of Software Developer

Top HR questions asked in TCS Software Developer