SDE - 2

Ninja is a boy who lives in ninjaland. Every day, during the morning he gets 1 coin from his mother. He wants to buy exactly ‘N’ candies. Each of the candies cost 2 coins usually and 1 coin if it is on sale. Ninja has to buy exactly K[i] candies of the i-th type(he buys candies in the evening).

Ninjas can buy any(possibly zero) number of candies of any type during any day(if he has enough money to do it). If the candy is on sale he can buy it for 1 coin and otherwise he has to buy it for 2 coins.

There are ‘M’ special offers in the candy shop. The j-th offer (D[j], C[j]) means that candies of the C[j]-th type are on sale during the D[j]-th day.

Ninja wants to buy all candies as soon as possible. Your task is to calculate the minimum day when he can buy all the candies.

You have been given two strings 'STR1' and 'STR2'. You have to check whether the two strings are anagram to each other or not.

Note:

Two strings are said to be anagram if they contain the same characters, irrespective of the order of the characters.

Example :

If 'STR1' = “listen” and 'STR2' = “silent” then the output will be 1.

Both the strings contain the same set of characters.

What is the use of paging in operating system?
What is the concept of demand paging?
What is the advantage of a multiprocessor system?
What are the four necessary and sufficient conditions behind the deadlock?
What is thrashing?
What is virtual memory?
What is RAID? What are the different RAID levels?

What is the range of integers that can be held in the MEDIUMINT datatype of SQL?
What does the following code snippet do?

DELETE FROM table_name
WHERE AGE = 16;

The question was about my hobbies and career aspirations .
also raised upon my projects and extracurricular activities.
Raised a question upon the case studies based on our reality of life's.