the-trigram

The Trigram

Problem Overview: Given a large chunk of text, identify the most frequently occurring trigram in it. If there are multiple trigrams with the same frequency, then print the one which occurred first. Assume that trigrams are groups of three consecutive words in the same sentence which are separated by nothing but a single space and are case insensitive. The size of the input will be less than 10 kilobytes. Input Format A large chunk of text. Constraints The input contains lowercase or uppercase alphabets, whitespaces and dots. Output Format The most popular trigram - three words, with nothing but a space in between them. The output should be in lowercase. (If a trigram ends with dot then you should remove the dot.) Sample Input I came from the moon. He went to the other room. She went to the drawing room. Sample Output went to the Explanation Here, 'went to the' is the only trigram that has occurred maximum number of times.

EASY

minimum_number_of_moves

Minimum Number Of Moves

chief has his own restaurant in the city. There are N workers there. Each worker has his own salary. The salary of the i-th worker equals to Wi (i = 1, 2, ..., N). Once, chief decided to equalize all workers, that is, he wants to make salaries of all workers to be equal. But for this goal he can use only one operation: choose some worker and increase by 1 salary of each worker, except the salary of the chosen worker. In other words, the chosen worker is the loser, who will be the only worker, whose salary will be not increased during this particular operation. But loser-worker can be different for different operations, of course. Chief can use this operation as many times as he wants. But he is a busy man. That's why he wants to minimize the total number of operations needed to equalize all workers. Your task is to find this number. Input:-2 3 1 2 3 2 42 42 Input Description: The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains a single integer N denoting the number of workers. The second line contains N space-separated integers W1, W2, ..., WN denoting the salaries of the workers. Output: 3 0 Output Description: For each test case, output a single line containing the minimum number of operations needed to equalize all workers. Constraints: 1 <= T <= 100 1 <= N <= 100 0 <= Wi <= 10000 (104) Explanation: Example Case 1. Chief can equalize all salaries in 3 turns by selecting number 3 twice and number 2 once. Example Case 2. All salaries are already equal. He doesn't need to do anything.

MEDIUM

triangle_validity

Triangle validity

Write a program to check whether a triangle is valid or not, when the three angles of the triangle are the inputs. A triangle is valid if the sum of all the three angles is equal to 180 degrees. Input:-3 40 40 100 45 45 90 180 1 1 Input Description: The first line contains an integer T, the total number of testcases. Then T lines follow, each line contains three angles A, B and C, of the triangle separated by space. Output: YES YES NO Output Description: For each test case, display 'YES' if the triangle is valid, and 'NO', if it is not, in a new line. Constraints: 1 <= T <= 1000 1 <= A,B,C <= 180 Explanation:

EASY

fruit_salad

Fruit salad

A fruit salad consists of 2 bananas and 1 apple. You currently have X bananas and Y apples. How many salads can he make with the fruits you currently have? Input:-3 72 50 38 93 51 4 Input Description: The first line will contain T, The number of testcases. Then The testcases follow. -each testcase consists of A single line containing two space separated integers - X and Y Output: 36 19 4 Output Description: For each testcase, output the answer on a new line. Constraints: 1<=T<=100 0<=X,Y<=100 Explanation: Test Case 1: You can make 36 chaats using 72 bananas and 36 apples. Test Case 2: You can make 19 chaats using 38 bananas and 19 apples. Test Case 3: You can make 4 chaats using 8 bananas and 4 apples.

EASY

jumping_in_the_hills

Jumping in the hills

There are N hills in a row numbered 1 through N from left to right. Each hill has a height; for each valid i, the height of the i-th hill is Hi. A climber is initially on the leftmost hill (hill number 1). He can make an arbitrary number of jumps (including zero) as long as the following conditions are satisfied: -Climber can only jump from each hill to the next hill, i.e. from the i-th hill, he can jump to the i+1-th hill (if it exists). -It's always possible to jump to a hill with the same height as the current hill. -It's possible to jump to a taller hill if it's higher than the current hill by no more than U. -It's possible to jump to a lower hill if it's lower than the current hill by no more than D. -Climber can use a parachute and jump to a lower hill regardless of its height (as long as it's lower than the current hill). This jump can only be performed at most once. Climber would like to move as far right as possible. Determine the index of the rightmost hill climber can reach. Input:-3 5 3 2 2 5 2 6 3 5 2 3 4 4 4 4 4 5 2 7 1 4 3 2 1 Input Description: -The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. -The first line of each test case contains three space-separated integers N, U and D. -The second line contains N space-separated integers H1, H2, ..., HN. Output: 3 5 1 Output Description: 5 2 1 1 2 3 4 5 4 3 2 4 4 4 4 Constraints: 1 <= T <= 100 1 <= N <= 100 1 <= U, D <= 1,000,000 1 <= Hi <= 1,000,000 for each valid i Explanation: Example case 1: Climiber can jump to second hill because it's higher by no more than U=3 than first hill, to jump to third hill climber has to use parachute because it's lower than second hill by 3 which is more than D=2, climber can't jump to fourth hill because it's higher than third hill by 4 which is more than U=3 Example case 2: All hills are of the same height, so climber can reach the last hill with no problems. Example case 3: Climber can't jump to second hill because it's too high for him

MEDIUM

travel_calculation

Travel calculation

Sam is going on a road trip and needs to apply for inter-district and inter-state travel e-passes. It takes A minutes to fill each inter-district e-pass application and B minutes for each inter-state e-pass application. His journey is given to you as a binary string S of length N where 0 denotes crossing from one district to another district (which needs an inter-district e-pass), and a 1 denotes crossing from one state to another (which needs an inter-state e-pass). Find the total time Sam has to spend on filling the various forms. Input:-3 2 1 2 00 2 1 1 01 4 2 1 1101 Input Description: The first line of The input contains a single integer T denoting The number of test cases. The description of T test cases follows. -each test case contains two lines of input. -first line contains three space separated integers N,a and B. -second line contains The string S. Output: 2 2 5 Output Description: For each testcase, output in a single line the total time Sam has to spend on filling the various forms for his journey. Constraints: 1<=T<=10 2 1<=T<=10^2 1<=N,A,B<=10^2 Si ? { ? 0 ? , ? 1 ? } Explanation: Test case 1: Sam needs total 2 inter-district e-passes, and he will be filling them in total 1?2=2 minutes. Test case 2: Sam needs total 1 inter-district e-pass, and 1 inter-state e-pass so he will be filling them in total 1?1 + 1.1 = 2 minutes. Test case 3: Sam needs total 1 inter-district e-pass and 3 inter-state e-passes, and he will be filling them in total 2?1+1?3=5 minutes.

MEDIUM

magic_pairs

Magic Pairs

You have some distinct integer numbers a1,a2...an. Count number of pairs (i,j) such that: 1<= i <= n 1<= j <= n ai < aj Input:-2 2 12 11 3 13 11 12 Input Description: The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.The first line of each test case contains a single integer n denoting the number of numbers you have. The second line contains n space-separated distinct integers a1, a2, ..., an denoting these numbers. Output: 1 3 Output Description: For each test case, output a single line containing number of pairs for corresponding test case. Constraints: 1 <= T <= 4 1 <= n <= 100000 0 <= ai <= 109 All the ai are distinct Explanation: Case 1: Only one such pair of (i, j) indices exists: (2,1), since a2 < a1. Case 2: 3 possible pairs of indices: (2,1), (2,3), (3,1)

MEDIUM

cricket_qualification

Cricket Qualification

In a cricket tournament a team is finding it tough to qualify for playoffs. They needs a minimum of X more points to qualify for playoffs in their remaining Y matches. A win, tie and loss in a match will yield 2,1,0 points respectively to a team. You are assigned a task to find the minimum number of matches team needs to win to qualify for playoffs. It is guaranteed that team will qualify for playoffs if they win all their remaining Y matches. Input:-2 10 5 1 5 Input Description: first line will contain T, number of testcases. Then The testcases follow. -each testcase contains of a single line of input, two space separated integers X,Y Output: 5 0 Output Description: For each testcase, output in a single line the minimum number of matches team must win to qualify for playoffs. Constraints: 1<=T<=10000 1<=X<=100 1<=Y<=100 1<=X<=2?Y Explanation: -In first case X=10 and Y=5, so the team needs 10 points from remaining 5 matches to qualify for playoffs. It is only possible if they win all their remaining 5 matches. -In second case X=1 and Y=5, so the team needs 1 points from their remaining 5 matches to qualify for playoffs. It can be done if they tie any one of their 5 matches and lose the remaining 4. So they need to win 0 matches.

MEDIUM

the_right_triangles

The Right Triangles

A student is given a list of N triangles. Each triangle is identfied by the coordinates of its three corners in the 2-D cartesian plane. His job is to figure out how many of the given triangles are right triangles. A right triangle is a triangle in which one angle is a 90 degree angle. The vertices of the triangles have integer coordinates and all the triangles given are valid( three points aren't colinear ). Input:-5 0 5 19 5 0 0 17 19 12 16 19 0 5 14 6 13 8 7 0 4 0 14 3 14 0 2 0 14 9 2 Input Description: The first line of the input contains an integer N denoting the number of triangles. Each of the following N lines contain six space separated integers x1 y1 x2 y2 x3 y3 where (x1, y1), (x2, y2) and (x3, y3) are the vertices of a triangle. Output: 3 Output Description: Output one integer, the number of right triangles among the given triangles. Constraints: 1 <= N <= 100000 (105) 0 <= x1, y1, x2, y2, x3, y3 <= 20 Explanation: The first triangle and the last two triangles of the example are right triangles.

MEDIUM

spelling_bee

Spelling bee

A student likes to play with cards a lot. Today, he's playing a game with three cards. Each card has a letter written on the top face and another (possibly identical) letter written on the bottom face. He can arbitrarily reorder the cards and/or flip any of the cards in any way he wishes (in particular, he can leave the cards as they were). He wants to do it in such a way that the letters on the top faces of the cards, read left to right, would spell out the name of his favorite friend Bob. Determine whether it is possible for the student to spell "bob" with these cards. Input:-3 bob rob dbc ocb boc obc Input Description: -The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. - The first line of each test case contains a single string with length 3 denoting the characters written on the top faces of the first, second and third card. -The second line contains a single string with length denoting the characters written on the bottom faces of the first, second and third card. Output: YES YES NO Output Description: For each test case, print a single line containing the string "yes" (without quotes) if he can spell "bob" or "no" (without quotes) if he cannot. Constraints: 1<=T<=20,000 each string contains only lowercase English letters Explanation: Example case 1: The top faces of the cards already spell out "bob". Example case 2: He can rearrange the cards in the following way to spell "bob": the second card non-flipped, the first card flipped and the third card flipped. Example case 3: There is no way for the student to spell out "bob".

MEDIUM

marriage_rules

Marriage rules

There are a certain rules for a couple to marry. They are as follows : - A man with name M is allowed to marry a woman with name W, only if M is a subsequence of W or W is a subsequence of M. - A is said to be a subsequence of B, if A can be obtained by deleting some elements of B without changing the order of the remaining elements. Your task is to determine whether a couple is allowed to marry or not, according to above rules. Input:-3 john johanna ira ira kayla jayla Input Description: The first line contains an integer T, the number of test cases. T test cases follow. Each test case contains two space separated strings M and W. Output: YES YES NO Output Description: For each test case print "YES" if they are allowed to marry, else print "NO". (quotes are meant for clarity, please don't print them) Constraints: 1 <= T <= 100 1 <= |M|, |W| <= 25000 (|A| denotes the length of the string A.) All names consist of lowercase English letters only. Explanation: Case 1: Consider S = "johanna". So, S[0] = 'j', S[1] = 'o', S[2] = 'h' and so on. If we remove the indices [3, 4, 6] or [3, 5, 6] from S, it becomes "john". Hence "john" is a subsequence of S, so the answer is "YES". Case 2: Any string is a subsequence of it self, as it is formed after removing "0" characters. Hence the answer is "YES". Case 3: "jayla" can not be attained from "kayla" as removing any character from "kayla" would make the string length smaller than "jayla", also there is no 'j' in "kayla". Similar reasoning can be applied to see why "kayla" can't be attained from "jayla". Hence the answer is "NO".

MEDIUM

closing_tweets

Closing Tweets

Little kids, Jack and Evan like playing their favourite game mini-tanks. Today they want to play something new and came across Twitter on their father's laptop. They saw it for the first time but were already getting bored to see a bunch of sentences having at most 140 characters each. The only thing they liked to play with it is, closing and opening tweets. There are N tweets on the page and each tweet can be opened by clicking on it, to see some statistics related to that tweet. Initially all the tweets are closed. Clicking on an open tweet closes it and clicking on a closed tweet opens it. There is also a button to close all the open tweets. Given a sequence of K clicks by Jack, Evan has to guess the total number of open tweets just after each click. Please help Evan in this game. Input:-3 6 CLICK 1 CLICK 2 CLICK 3 CLICK 2 CLOSEALL CLICK 1 Input Description: First line contains two integers N K, the number of tweets (numbered 1 to N) and the number of clicks respectively (1 <= N, K <= 1000). Each of the following K lines has one of the following. CLICK X , where X is the tweet number (1 <= X <= N) CLOSEALL Output: 1 2 3 2 0 1 Output Description: Output K lines, where the ith line should contain the number of open tweets just after the ith click. Constraints: Explanation: Let open[x] = 1 if the xth tweet is open and 0 if its closed. Initially open[1..3] = { 0 , 0 , 0 }. Here is the state of open[1..3] after each click and corresponding count of open tweets. CLICK 1 : { 1, 0, 0 }, open count = 1 CLICK 2 : { 1, 1, 0 }, open count = 2 CLICK 3 : { 1, 1, 1 }, open count = 3 CLICK 2 : { 1, 0, 1 }, open count = 2 CLOSEALL : { 0, 0, 0 }, open count = 0 CLICK 1 : { 1, 0, 0 }, open count = 1

MEDIUM

coins_and_puppy

Coins and puppy

Sammy is a little dog. But despite the fact he is still a puppy he already knows about the valve of coins . He knows that for every coin he can get very tasty bone from his master. He believes that some day he will find a treasure and have loads of bones. And finally he found something interesting. A wooden chest containing N coins! But as you should remember, Sammy is just a little dog, and so he can't open it by himself. Actually, the only thing he can really do is barking. He can use his barking to attract nearby people and seek their help. He can set the loudness of his barking very precisely, and therefore you can assume that he can choose to call any number of people, from a minimum of 1, to a maximum of K. When people come and open the chest they divide all the coins between them in such a way that everyone will get the same amount of coins and this amount is maximal possible. If some coins are not used they will leave it on the ground and sammy will take them after they go away. Since Sammy is clearly not a fool, he understands that his profit depends on the number of people he will call. While Sammy works on his barking, you have to find the maximum possible number of coins he can get. Input:-2 5 2 11 3 Input Description: The first line of the input contains an integer T denoting the number of test cases. Each of next T lines contains 2 space-separated integers: N and K, for this test case. Output: 1 2 Output Description: For each test case output one integer - the maximum possible number of coins sammy can get. Constraints: 1 <= T <= 50 1 <= N, K <= 105 Explanation: In the first example he should call two people. Each of them will take 2 coins and they will leave 1 coin for Tuzik. In the second example he should call 3 people.

MEDIUM

stick_break

Stick break

Sam has a stick of length N. He can break the stick into 2 or more parts such that the parity of length of each part is same. For example, a stick of length 11 can be broken into three sticks of lengths {3,3,5} since each part is odd, but it cannot be broken into two sticks of lengths {5,6} since one is even and the other is odd. Sam can then continue applying this operation on the smaller sticks he obtains, as many times as he likes. Can Sam obtain a stick of length exactly X by doing this? Input:-3 6 1 3 2 4 3 Input Description: The first line of input will contain a single integer T, denoting The number of test cases. The description of The test cases follows. -each test case consists of a single line of input, containing two space-separated integers N,X. Output: YES NO YES Output Description: For each test case, output on a new line YES if Sam can obtain a stick of length exactly X, and NO otherwise. Each letter of the output may be printed in either lowercase or uppercase. For example, the strings YES, yEs, and Yes will be considered identical. Constraints: 1<=T<=1000 1<=X<N<=10^9 Explanation: Test case 1: Sam can initially break the stick into 3 parts of length 2 each. After that, Chef can pick any segment of length 2 and break it into 2 sticks of length 1 each. Test case 2: Sam cannot obtain a stick of length 2, since the only way to break a stick of length 3 following the given conditions is into three parts of length 1 each. Test case 3: Sam can break the stick into lengths 3 and 1.

MEDIUM

tribal_villages

Tribal villages

There are n villages in a line in an area. There are two kinds of tribes A and B that reside there. A village can be either empty or occupied by one of the tribes. An empty village is said to be controlled by a tribe of village A if it is surrounded by villages of tribes A from the left and from the right. Same goes for the tribe B. Find out the number of villages that are either occupied by or controlled by tribes A and B, respectively. Input:-4 A..A..B...B ..A.. A....A ..B..B..B.. Input Description: The first line of the input contains an integer T denoting the number of test cases. The first line of the input contains a string s denoting the configuration of the villages, each character of which can be 'A', 'B' or '.'. Output: 4 5 1 0 6 0 0 7 Output Description: For each test case, output two space-separated integers denoting the number of villages either occupied by or controlled by tribe A and B, respectively. Constraints: 1 <= T <= 20 1 <= |s| <= 105 Explanation:

MEDIUM

fitting_the_number

Fitting the number

Sam wants to store some important numerical data on his personal computer. He is using a new data type that can store values only from 0 till N both inclusive. If this data type receives a value greater than N then it is cyclically converted to fit into the range 0 to N. For example: -Value N+1 will be stored as 0. -Value N+2 will be stored as 1. and so on... Given X, the value chef wants to store in this new data type. Determine what will be the actual value in memory after storing X. Input:-5 15 0 15 10 11 12 27 37 50 49 Input Description: first line will contain T, number of testcases. Then The testcases follow. -each testcase contains a single line of input, two space separated integers N,X - The maximum value a data type can store and The value Sam wants to store In The data type respectively. Output: 0 10 0 9 49 Output Description: For each testcase, output in a single line the value which will be actually stored in memory. Constraints: 1<=T<=3000 1<=N<=50 0<=X<=50 Explanation: Test Case 1: The data type can store values from 0 to 15. If we try to put 0 in this data type, then the stored value will be the same, that is 0. Test Case 2: The data type can store values from 0 to 15. If we try to put 10 in this data type, then the stored value will be the same, that is 10. Test Case 3: The data type can store values from 0 to 11. If we try to put 12 in this data type, then the stored value will cyclically come back to 0. Hence the output is 0. Test Case 4: The data type can store values from 0 to 27. If we try to put 37 in this data type, then the stored value will cyclically convert to 9. Hence the output is 9.

MEDIUM

number_games

Number games

Two friends are playing a game. 1st gut initially has the number A and 2nd guy has the number B. There are a total of N turns in the game, and both guys alternatively take turns. In each turn the player whose turn it is, multiplies his or her number by 2. 1st guy has the first turn. Suppose after all the N turns, 1st guy’s number has become C and second guy’s number has become D. You want to calculate the integer division of the maximum number among C and D by the minimum number among C and D. Input:-3 1 2 1 3 2 3 3 7 2 Input Description: -The first line of the input contains an integer T denoting the number of test cases. The description of each testcase follows. -Each test case contains a single line with 3 integers A, B, and N. Output: 1 3 2 Output Description: For each test case output a new line with a single integer which should be the answer. Constraints: 1 <= T <= 100 1 <= A <= 1000000000 1 <= B <= 1000000000 1 <= N <= 1000000000 Explanation: In the first testcase, the initial numbers are (A = 1, B = 2). There is only one turn. In this turn 1st guy multiplies his number by 2. Hence, we get (A = 2, B = 2). Therefore C = 2, and D = 2. max(C, D)/min(C, D) = 2/2 = 1. Hence the first output is 1. In the second testcase, the initial numbers are (A = 3, B = 2). There three turns. In the first turn 1st guy multiplies his number by 2. Hence, we get (A = 6, B = 2). In the second turn 2nd guy multiplies his number by 2. Hence, we get (A = 6, B = 4). In the third turn 1st guy multiplies his number by 2. Hence, we get (A = 12, B = 4). Therefore C = 12, and D = 4. max(C, D)/min(C, D) = 12/4 = 3. Hence the second output is 3. In the third testcase, the initial numbers are (A = 3, B = 7). There two turns. In the first turn 1st guy multiplies his number by 2. Hence, we get (A = 6, B = 7). In the second turn 2nd guy multiplies his number by 2. Hence, we get (A = 6, B = 14). Therefore C = 6, and D = 14. max(C, D)/min(C, D) = 14/6 = 2, because we are doing integer division. Hence the third output is 2.

MEDIUM

stones_game

Stones game

Sam is playing a game. Currently in the game, he is at a field full of stones. There are total N kinds of stones. There is unlimited supply of each kind of stone. Sam knows that one stone of kind i needs Ai minutes to pick it from the ground and it will give sam a profit of Bi Rs. Sam has K minutes of free time. During this free time, sam want to pick stones so as to maximize his profit. But he can not pick stones of different kinds, he has to pick stones of a single kind. Please help Sam to find the maximal possible profit. Input:-1 3 10 3 4 5 4 4 5 Input Description: first line contains single integer T denoting The number of test cases. -first line of each test case contains two integers N and K. -Next line contains N integers Ai denoting The time needed to pick one stone of kind i. -Next line contains N integers Bi denoting The profit due to picking ithth stone. Output: 12 Output Description: For each test case, print a single line containing maximal possible profit. Constraints: 1 <= T <= 5 1 <= N <= 105 0 <= K <= 109 1 <= Ai, Bi <= 109 Explanation: If Sam picks stones of first kind he can pick 3 stones, he will get a profit of 3*4 = 12 Rs. If Sam picks stones of second kind he can pick 2 stones, he will get a profit of 2*4 = 8 Rs. If Sam picks stones of third kind he can pick 2 stones, he will get a profit of 2*5 = 10 Rs. So the maximum possible profit is 12.

MEDIUM

languages_and_phrases

Languages and phrases

Forgotten languages (also known as extinct languages) are languages that are no longer in use. Such languages were, probably, widely used before and no one could have ever imagined that they will become extinct at some point. Unfortunately, that is what happened to them. On the happy side of things, a language may be dead, but some of its words may continue to be used in other languages. you have acquired a dictionary of N words of a forgotten language. Meanwhile, you also know K phrases used in modern languages. For each of the words of the forgotten language, your task is to determine whether the word is still in use in any of these K modern phrases or not. Input:-2 3 2 piygu ezyfo rzotm 1 piygu 6 tefwz tefwz piygu ezyfo tefwz piygu 4 1 kssdy tjzhy ljzym kegqz 4 kegqz kegqz kegqz vxvyj Input Description: The first line of The input contains an integer T denoting The number of test cases. The description of T test cases follows. -The first line of a test case description contains two space separated positive integers N and K. -The second line of The description contains N strings denoting a dictionary of The forgotten language. -each of The Next K lines of The description starts with one positive integer L denoting The number of words In The corresponding phrase In modern languages. The integer is followed by L strings (not necessarily distinct) denoting The phrase. Output: YES YES NO NO NO NO YES Output Description: For each test case, output a single line containing N tokens (space-separated): if the ith word of the dictionary exists in at least one phrase in modern languages, then you should output YES as the ith token, otherwise NO. Constraints: 1 <= T <= 20 1 <= N <= 100 1 <= K, L <= 50 1 <= length of any string in the input <= 5 Explanation:

MEDIUM

garden_problem

Garden problem

Today Sam wants to clean his garden. Sam has N columns of ground. Each column has it's height . Sam can choose any column and increase its height by 1 using 1 cube of ground. Sam wants to spend exactly M cubes. Can he make this in such way that the heights of all columns will become equal? Input:-3 5 7 3 3 4 2 1 5 6 3 3 4 2 1 5 8 3 3 4 2 1 Input Description: -First line of input contains an integer T denoting number of test cases. -Then for each test case, The first line contains two integers N and M. -The second line contains N space-separated integers A1, A2, ..., AN denoting the initial heights of the columns". Output: Yes No No Output Description: If Sam can spend all cubes and make the columns equal print Yes else print No. Constraints: 1 <= T <= 10^2 1 <= N <= 10^2 1 <= Ai <= 10^2 0 <= M <= 10^4 Explanation: In the first case we can put cubes on columns in such count: 1, 1, 0, 2, 3. The sum equals M. In the second case we can't make the columns equal as we will receive something like 44443. In the third case we can make all columns equal but we will still have one cube extra, By using that cube, our heights of columns will become 44445.

MEDIUM

sequence_and_chains

Sequence and Chains

Sam wants to play a game called “chain”. Sam has the sequence of symbols. Each symbol is either '-' or '+'. The sequence is called Chain if each two neighboring symbols of sequence are either '-+' or '+-'. For example sequence '-+-+-+' is a Chain but sequence '-+-+--+' is not. Help Sam to calculate the minimum number of symbols he need to replace (ex. '-' to '+' or '+' to '-') to receive a Chain sequence. Input:-2 ---+-+-+++ ------- Input Description: -First line contains single integer T denoting the number of test cases. -Line of each test case contains the string S consisting of symbols '-' and '+'. Output: 2 3 Output Description: For each test case, in a single line print single interger - the minimal number of symbols Sam needs to replace to receive a Chain. Constraints: 1 <= T <= 7 1 <= |S| <= 10^5 Explanation: Example case 1. We can change symbol 2 from '-' to '+' and symbol 9 from '+' to '-' and receive '-+-+-+-+-+'. Example case 2. We can change symbols 2, 4 and 6 from '-' to '+' and receive '-+-+-+-'.

MEDIUM

lucky_ticket

Lucky ticket

Every day Sam buys a ticket. On the ticket, there is a letter-code that can be represented as a string of upper-case letters. Sam believes that the day will be successful in case exactly two different letters in the code alternate. Otherwise, he believes that the day will be unlucky. You are given a ticket code. Please determine, whether the day will be successful for Sam or not. Print "YES" or "NO" (without quotes) corresponding to the situation. Input:-2 ABABAB ABC Input Description: The first line of The input contains an integer T denoting The number of test cases. The description of T test cases follows. -The first and only line of each test case contains a single string S denoting The letter code on The ticket. Output: YES NO Output Description: For each test case, output a single line containing "YES" (without quotes) in case the day will be successful and "NO" otherwise. Constraints: 1 <= T <= 100 S consists only of upper-case letters Explanation:

MEDIUM

book_inventory_system

Book Inventory System

Create a Book class to represent books in a library inventory system. Implement methods to add a book, remove a book, and display all books. Input:-add Hamlet remove Hamlet add Twilight display stop Input Description: Input will be taken one by one, first will be operation type "add", "remove", "display", or "stop". Then second input "book_name" which we want to add or remove. Then again new operation until stop operation performed. Display will show all books stored and stop will terminate program. Output: book added successfully book removed successfully book added successfully Twilight Output Description: The output will consist of messages corresponding to each operation add: "book added successfully" remove: "book removed successfully" display: display all books one by one. if no books to display, show the message "book not found". stop: terminate the program execution. These outputs will be displayed one by one on new line depends on operations performed. Constraints: Maximum number of books is 1000. Explanation:

EASY

online_shopping_cart

Online Shopping Cart

Design a ShoppingCart class to represent a user's shopping cart in an online store. Implement methods to add items, remove items, and calculate the total cost. Input:-add laptop 1 1000.00 Input Description: The input will consist of a string representing the "add" operation, followed by the item name, quantity, and price. Output: 1000.0 Output Description: The output will be a float value representing the total price for the specified quantity. Constraints: Maximum quantity for item will be 100. Explanation:

EASY

bank_account_management

Bank Account Management

You are tasked with designing a class to manage banking operations. The class should include methods to perform two operations: "deposit" and "withdraw", with the amount. Ensure that the default balance of the account is 2500. Input:-deposit 1000 Input Description: Input will have two different operations: "deposit" and "withdraw", followed by the amount. Output: 3500.0 Output Description: The output will be the current balance of the account, specified as a float. If an invalid operation is provided the program should display "invalid operation". If attempting to withdraw more amount than available, the program should display "insufficient fund". Constraints: Explanation:

EASY

employee_management_system

Employee Management System

Design an Employee class to represent employees in a company. The class should serve as a base class for two types of employees: FullTimeEmployee and PartTimeEmployee Input:-FullTimeEmployee JohnDoe 30 Input Description: The input will consist of employee type along with as name, age for full time employee. "FullTimeEmployee JohnDoe 30". additional values such as hours worked and per hour wages for PartTimeEmployee. "PartTimeEmployee JohnDoe 30 20 10". Output: JohnDoe - FullTimeEmployee - Salary: 5000.0 Output Description: The output will display details of each employee based on the input provided: FullTimeEmployee: Display the employees name, type, and a fixed salary of 5000. PartTimeEmployee: Display the employees name, type, and calculated salary based on hours worked, hourly rate. For an invalid employee type: Display the message "invalid employee type". Constraints: Explanation:

MEDIUM

larger_number

Larger Number

Write a function that takes two numbers as input and returns the larger number. Input:-5, 10 Input Description: Input: Two numbers Output: 10 Output Description: Larger number. Constraints: 1 <= number <= 1000 Explanation:

EASY

multiplication_table

Multiplication Table

Write a function that prints the multiplication table for a given number up to 10. Input:-5 Input Description: Input: Number Output: 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 Output Description: Multiplication table. Constraints: 1 <= number <= 1000 Explanation:

MEDIUM

find_maximum_depth_of_nested_parentheses

Find Maximum Depth of Nested Parentheses

Write an anonymous function that returns the maximum depth of nested parentheses in a string. If the opening and closing parentheses do not match, return the error message "Error: Unmatched opening parentheses." for unmatched opening parentheses and "Error: Unmatched closing parentheses." for unmatched closing parentheses. Input:-((())()) Input Description: Input a string containing parentheses. Output: 3 Output Description: Output the maximum depth. Constraints: 1 <= string length <= 10^6 Explanation:

MEDIUM

find_maximum_xor_substring

Find Maximum XOR Substring

Write a function that finds the maximum XOR value of any two substrings of a given string of numbers. Input:-1, 2, 3, 4 Input Description: Input a string of numbers. Output: 7 Output Description: Output the maximum XOR value. Constraints: 1 <= string length <= 10^6 Explanation:

MEDIUM

basic_calculator

Basic Calculator

Given a string s representing a valid expression, implement a basic calculator to evaluate it,and return the result of the evaluation. Note: You are not allowed to use any built-in function which evaluates strings as mathematical expressions, such as eval(). Input:-2-1 + 2 Input Description: Given a string s representing a valid expression. Output: 3 Output Description: return the result of the evaluation. Constraints: 1 <= s.length <= 3 * 105 s consists of digits, '+', '-', '(', ')', and ' '. s represents a valid expression. '+' is not used as a unary operation. '-' could be used as a unary operation. There will be no two consecutive operators in the input. Every numb... Explanation: null

HARD

integer_to_english_words

Integer to English Words

Convert a non-negative integer number's to its English words representation.  for example 100 it is non negative number convert into English words "One hundred" Input:-123 Input Description: The first and only line of input contains the Non negative integer Output: One Hundred Twenty Three Output Description: return English words Constraints: 0 <= num <= 231 - 1 Explanation: null

HARD

rhezo_and_big_powers

Rhezo and Big Powers

Rhezo likes numbers of the form A^B . But computing A^B , for any 2 numbers Aand B is a hard task for him. He would like you to help him out in this. Input:-4  3 Input Description: First line of input contains a single integer A. Second line contains the integer B. Output: 64 Output Description: Help Rhezo find A^B . As this number can be large, print it modulo 10^9+7 . Constraints: 1<= A <=10^9  1<= B<=10^10 Explanation: null

HARD

a_very_special_multiple

A Very Special Multiple

Charlie and Johnny play a game. For every integer X Charlie gives, Johnny has to find the smallest positive integer Y such that X * Y(X multiplied by Y ) contains only 4s and 0s and starts with one or more 4s followed by zero or more 0s. For example, 404 is an invalid number but 4400, 440, and 444 are valid numbers. If is the number of 4s and is the number of 0s, can you print the value of (2*a)+b? Input:-3  4  5  80 Input Description: The first line of input contains a single integer T, the number of test cases.     T lines follow, each line containing the integer X as stated above. Output: 2  3  4 Output Description: For every X, print the output(2*a)+b in a newline as stated in the problem statement. Constraints: 1<= T <=100  1<= X <= 10^10 Explanation: null

HARD

ncr

nCr

Given two integers n and r. In how many ways can r items be chosen from items? Input:-4 2 1 4 0 5 2 10 3 Input Description: The first line contains the number of test cases T. Each of the next T lines contains two integers n and r. Output: 2 1 10 120 Output Description: Output T lines, containing the required answer for the corresponding test case. Output all answers modulo 142857. Constraints: 1<= T <=10^5  1<= n<=10^9  0<= r <= n Explanation: null

HARD

six_friends

Six Friends

Six friends go on a trip and are looking for accommodation. After looking for hours, they find a hotel which offers two types of rooms — double rooms and triple rooms. A double room costs Rs. X, while a triple room costs Rs. Y. The friends can either get three double rooms or get two triple rooms. Find the minimum amount they will have to pay to accommodate all six of them. Input:-3 10 15 6 8 4 8 Input Description: The first line contains A single integer T - The number of test cases. Then The test cases follow. -The first and only line of each test case contains two integers X and Y - The cost of A double room and The cost of A triple room. Output: 30 16 12 Output Description: For each testcase, output The minimum amount required to accommodate all The six friends. Constraints: 1<=T<=100 1<=X<Y<=100 Explanation: Test case 1: The friends can take three double rooms and thus pay a total of Rs.30. Test case 2: The friends can take two triple rooms and thus pay a total of Rs.16. Test case 3: The friends can take three double rooms and thus pay a total of Rs.12.

EASY

football_cup

Football Cup

It is the final day of a football league. A viewer has a certain criteria for assessing football matches. In particular, he only likes a match if: -The match ends in a draw, and, -At least one goal has been scored by either team. Given the goals scored by both the teams as X and Y respectively, determine whether that viewer will like the match or not. Input:-4 1 1 0 1 0 0 2 2 Input Description: The first line of input will contain A single integer T, denoting The number of test cases. The description of T test cases follows. -each test case consists of A single line of input containing two space-separated integers X and Y — The goals scored by each team. Output: YES NO NO YES Output Description: - For each test case, output YES if the viewer will like the match, else output NO. - You may print each character of the string in uppercase or lowercase (for example, the strings YeS, yEs, yes and YES will all be treated as identical). Constraints: 1<=T<=100 0<=X,Y<=9 Explanation: Test case 1: It is a draw in which both teams have scored a goal, viewer will like this match. Test case 2: The game is not a draw. Hence, viewer will not like this match. Test case 3: Neither team scored a goal, so viewer will not like this match. Test case 4: It is a draw in which both teams scored 2 goals each. viewer will like this match.

EASY

playlist

Playlist

A listener’s playlist contains 3 songs named A ,B, and C, each of duration exactly X minutes. Listener generally plays these 3 songs in loop, i.e, A?B?C?A?B?C?A?… Listener’s went on a train journey of N minutes and played his playlist on loop for the whole journey. How many times did he listen to the song C completely? Input:-5 6 1 5 1 11 2 5 8 100 9 Input Description: The first line of input will contain A single integer T, denoting The number of test cases. The description of The test cases follows. -each test case consists of A single line of input, containing two space-separated integers N,X. Output: 2 1 1 0 3 Output Description: - For each test case, output on a new line the number of times the listener listens to the song C completely. Constraints: 1<=T<=1000 1<=N<=100 1<=X<=10 Explanation: Test case 1: Since each song is of duration 1 minute and the journey is 6 minutes long, listener listens each of the songs A,B,C twice. Test case 2: Since each song is of duration 1 minute and the journey is 5 minutes long, listener listens the songs A,B twice but C only once. Test case 3: Since each song is of duration 2 minutes and the journey is 11 minutes long, listener listens the songs A,B twice but C only once. Note that listener is in the middle of listening to song C for the second time when the journey ends, but it is not counted since he hasn't listened to it fully. Test case 4: listener cannot hear any song since the journey is shorter than his song duration.

EASY

tv_subscription

TV subscription

A group of N friends in want to buy TV subscriptions. We know that 6 people can share one TV subscription. Also, the cost of one TV subscription is X rupees. Determine the minimum total cost that the group of N friends will incur so that everyone in the group is able to use TV subscription. Input:-3 1 100 12 250 16 135 Input Description: The first line contains A single integer T — The number of test cases. Then The test cases follow. -The first and only line of each test case contains two integers N and X — The size of The group of friends and The cost of one subscription. Output: 100 500 405 Output Description: For each test case, output The minimum total cost that The group will incur so that everyone in The group is able to use TV subscription. Constraints: 1<=T<=1000 1<=N<=100 1<=X<=1000 Explanation: Test case 1: There is only one person in the group. Therefore he will have to buy 1 subscription. Therefore the total cost incurred is 100. Test case 2: There are 12 people in the group. Therefore they will have to buy 2 subscriptions. Therefore the total cost incurred is 500. Test case 3: There are 16 people in the group. Therefore they will have to buy 3 subscriptions. Therefore the total cost incurred is 405.

EASY

possible_scores

Possible scores

In a test, there are N problems, each carrying X marks. In each problem, you either received X marks or 0 marks. Determine whether is it possible for you to achieve exactly Y marks. Input:-5 1 8 4 3 6 12 4 5 0 10 10 100 8 5 36 Input Description: The first line of input will contain A single integer T, denoting The number of test cases. -each test case consists of three integers N,X, and Y, The number of problems, The maximum score For each problem, and The score You want. Output: NO YES YES YES NO Output Description: For each test case, output YES if You can achieve exactly Y marks, NO otherwise. -You can print each character of The string in uppercase or lowercase. For example, The strings YES, YES, YES, and YES, are all considered identical. Constraints: 1<=T<=100 1<=N<=10 1<=X<=10 0<=Y<=N?X Explanation: Test case 1: There is no way for you to score exactly 4 marks. Test case 2: you can score 12 marks by receiving 6 marks in 2 problems and 0 marks in 1 problem. Test case 3: you can score 0 marks by receiving 0 marks in each of the 4 problems. Test case 4: you can score 100 marks by receiving 10 marks in each of the 10 problems. Test case 5: There is no way for you to score exactly 36 marks.

EASY

final_score

Final score

In discus throw, a player is given 3 throws and the throw with the longest distance is regarded as their final score. You are given the distances for all 3 throws of a player. Determine the final score of the player. Input:-3 10 15 8 32 32 32 82 45 54 Input Description: -First line will contain T, number of test cases. Then the test cases follow. -Each test case contains of a single line of input, three integers A,B, and C denoting the distances in each throw. Output: 15 32 82 Output Description: For each test case, output the final score of the player. Constraints: 1<=T<=100 1<=A,B,C<=100 Explanation: Test Case 1: The longest distance is achieved in the second throw, which is equal to 15 units. Thus, the answer is 15. Test Case 2: In all throws, the distance is 32 units. Thus, the final score is 32. Test Case 3: The longest distance is achieved in the first throw which is equal to 82 units. Thus, the answer is 82.

EASY

bathing_problem

Bathing problem

A geyser has a capacity of X litres of water and a bucket has a capacity of Y litres of water. One person requires exactly 2 buckets of water to take a bath. Find the maximum number of people that can take bath using water from one completely filled geyser. Input:-4 10 6 25 1 100 10 30 40 Input Description: first line will contain T, number of test cases. Then The test cases follow. -each test case contains A single line of input, two integers X,Y. Output: 0 12 5 0 Output Description: For each test case, output the maximum number of people that can take bath. Constraints: 1<=T<=1000 1<=X,Y<=100 Explanation: Test Case 1: One bucket has a capacity of 6 litres. This means that one person requires 2?6=12 litres of water to take a bath. Since this is less than the total water present in geyser, 0 people can take bath. Test Case 2: One bucket has a capacity of 1 litre. This means that one person requires 2?1=2 litres of water to take a bath. The total amount of water present in geyser is 25 litres. Thus, 12 people can take bath. Note that 1 litre water would remain unused in the geyser. Test Case 3: One bucket has a capacity of 10 litres. This means that one person requires 2?10=20 litres of water to take a bath. The total amount of water present in geyser is 100 litres. Thus, 5 people can take bath. Note that 0 litres of water would remain unused in the geyser after this.

EASY

mario_and_mashroom

Mario and mashroom

Mario transforms each time he eats a mushroom as follows: -If he is currently small, he turns normal. -If he is currently normal, he turns huge. -If he is currently huge, he turns small. Given that Mario was initially normal, find his size after eating X mushrooms. Input:-3 2 4 12 Input Description: The first line of input will contain one integer T, The number of test cases. Then The test cases follow. -each test case contains A single line of input, containing one integer X. Output: SMALL HUGE NORMAL Output Description: For each test case, output in a single line Mario's size after eating X mushrooms. Print: -NORMAL, if his final size is normal. -HUGE, if his final size is huge. -SMALL, if his final size is small. Each character can either be printed in uppercase or lowercase. Constraints: 1<=T<=100 1<=X<=100 Explanation: Test case 1: Mario's initial size is normal. On eating the first mushroom, he turns huge. On eating the second mushroom, he turns small. Test case 2: Mario's initial size is normal. On eating the first mushroom, he turns huge. On eating the second mushroom, he turns small. On eating the third mushroom, he turns normal. On eating the fourth mushroom, he turns huge.

EASY

in-game_bullet

In-game bullet

A bullet in game moves at X pixels per frame.We wish to hit a target standing Y pixels away from us. The target does not move. Find the minimum time (in seconds) after which you shoot the bullet, such that it hits the target after at least Z seconds from now. Input:-3 3 3 5 2 4 1 3 12 8 Input Description: The first line of input will contain an integer T, The number of test cases. Then The test cases follow. -each test case consists of A single line of input, containing three space-separated integers X,Y, and Z. Output: 4 0 4 Output Description: For each test case, output in a single line the minimum time (in seconds) after which you should shoot the bullet, such that it hits the target after at least Z seconds from now. Constraints: 1<=T<=100 1<=X,Y,Z<=100 X divides Y Explanation: Test case 1: The speed of the bullet is 3 pixels per frame and the target is 3 pixels away from you. Thus, it would take 1 second for the bullet to reach the target. You want the bullet to reach target after at least 5 seconds. So, he should fire the bullet after 4 seconds. Test case 2: The speed of the bullet is 2 pixels per frame and the target is 4 pixels away from you. Thus, it would take 2 seconds for the bullet to reach the target. You want the bullet to reach the target after at least 1 second. So, you should fire the bullet after 0 seconds. Note that, this is the minimum time after which he can shoot a bullet. Test case 3: The speed of the bullet is 3 pixels per frame and the target is 12 pixels away from you. Thus, it would take 4 seconds for the bullet to reach the target. You want the bullet to reach target after at least 8 seconds. So, he should fire the bullet after 4 seconds.

EASY

chess_rating

Chess Rating

Sam has recently started playing Chess. Her current rating is X. She noticed that when she wins a game, her rating increases by 8 points. Can you help sam in finding out the minimum number of games she needs to win in order to make her rating greater than or equal to Y? Input:-4 10 10 10 17 10 18 10 19 Input Description: The first line of input will contain an integer T — The number of test cases. The description of T test cases follows. -The first line of each test case contains two integers X and Y, as described in The problem statement. Output: 0 1 1 2 Output Description: For each test case, output the minimum number of games that sam needs to win in order to make her rating greater than or equal to Y. Constraints: 1<=T<=10 ^4 1<=X<=Y<=10^4 Explanation: Test case 1: Since Sam's current rating X is already equal to her desired rating Y, she doesn't need to win any game. Test case 2: Sam's current rating is 10. After winning 1 game, her rating will become 10+8=18, which is greater than her desired rating of 17. Thus, she has to win at least 1 game. Test case 3: Sam's current rating is 10. After winning 1 game, her rating will become 10+8=18, which is equal to her desired rating of 18. Thus, she has to win at least 1 game. Test case 4: Sam's current rating is 10. After winning 1 game, her rating will become 18, which is less than her desired rating of 19. She will need to win one more game in order to make her rating 26, which is greater than 19. Thus, she has to win at least 2 games

EASY

candy_distro

Candy distro

You have N candies. You have to distribute them to exactly M of your friends such that each friend gets equal number of candies and each friend gets even number of candies. Determine whether it is possible to do so. NOTE: You will not take any candies yourself and will distribute all the candies. Input:-4 9 3 4 1 4 2 8 3 Input Description: first line will contain T, number of test cases. Then The test cases follow. -each test case contains of A single line of input, two integers N and M, The number of candies and The number of friends. Output: No Yes Yes No Output Description: -For each test case, the output will consist of a single line containing Yes if you can distribute the candies as per the conditions and No otherwise. -You may print each character of the string in uppercase or lowercase (for example, the strings yes, Yes, yEs, and YES will all be treated as identical). Constraints: 1<=T<=1000 1<=N,M<=1000 Explanation: Test case 1: Since you have 9 candies and 3 friends, each friend will get 9/3 = 3 candies. Since 3 is not even, You don't satisfy the conditions. Test case 2: Since you have 4 candies and 1 friend, each friend will get 4/1 = 4 candies. Since 4 is even, You satisfy all the conditions. Test case 3: Since you have 4 candies and 2 friends, each friend will get 4/2 candies. Since 2 is even, You satisfy all the conditions. Test case 4: Since you have 8 candies and 3 friends. Since you won't be able to distribute all the candies equally, you don’t satisfy all the conditions.

EASY

stair_jumps

Stair jumps

You are currently standing at stair 0 and he wants to reach stair numbered X. You can climb either Y steps or 1 step in one move. Find the minimum number of moves required for you to reach exactly the stair numbered X. Input:-4 4 2 8 3 3 4 2 1 Input Description: The first line of input will contain A single integer T, denoting The number of test cases. -each test case consists of A single line of input containing two space separated integers X and Y denoting The number of stair You want to reach and The number of stairs You can climb in one move. Output: 2 4 3 2 Output Description: For each test case, output the minimum number of moves required by him to reach exactly the stair numbered X. Constraints: 1<=T<=500 1<=X,Y<=100 Explanation: Test case 1: You can make 2 moves and climb 2 steps in each move to reach stair numbered 4. Test case 2: You can make a minimum of 4 moves. You can climb 3 steps in 2 of those moves and 1 step each in remaining 2 moves to reach stair numbered 8. Test case 3: You can make 3 moves and climb 1 step in each move to reach stair numbered 3. Test case 4: You can make 2 moves and climb 1 step in each move to reach stair numbered 2.

EASY

perfect_bath

Perfect bath

You are setting up a perfect bath for himself. You have X litres of hot water and Y litres of cold water. The initial temperature of water in his bathtub is A degrees. On mixing water, the temperature of the bathtub changes as following: -The temperature rises by 1 degree on mixing 1 litre of hot water. -The temperature drops by 1 degree on mixing 1 litre of cold water. Determine whether you can set the temperature to B degrees for a perfect bath. Input:-4 24 25 2 0 37 37 2 9 30 20 10 9 30 31 0 20 Input Description: The first line of input will contain A single integer T, denoting The number of test cases. -each test case consists of four space-separated integers A,B,X, and Y — The initial temperature of bathtub, The desired temperature of bathtub, The amount of hot water in litres, and The amount of cold water in litres respectively. Output: YES YES NO NO Output Description: -For each test case, output on a new line, YES if you can get the desired temperature for his bath, and NO otherwise. -You may print each character of the string in uppercase or lowercase (for example, the strings YES, yEs, yes, and yeS will all be treated as identical). Constraints: 1<=T<=2000 0<=A,B<=40 0<=X,Y<=20 Explanation: Test case 1: The initial temperature of water is 24 and the desired temperature is 25. You have 2 litres of hot water. You can add 1 litre hot water in the tub and change the temperature to 24+1=25 degrees. Test case 2: The initial temperature of water is 37 and the desired temperature is also 37. Thus, you don’t need to add any more water in the bathtub. Test case 3: The initial temperature of water is 30 and the desired temperature is 20.You need to add 10 litres of cold water to reach the desired temperature. Since you only have 9 litres of cold water, you cannot reach the desired temperature. Test case 4: The initial temperature of water is 30 and the desired temperature is 31. You need to add 1 litre of hot water to reach the desired temperature. Since you have no hot water, you cannot reach the desired temperature.

EASY

count-by

Count By

Implement a function countBy(array, iteratee) that generates an object with keys derived from the results of applying each element of the array to the iteratee function, where the values correspond to the frequency of each key returned by the iteratee, with iteratees supporting both functions and strings as properties.

MEDIUM

topological-sort

Topological Sort

Implement a function that performs a topological sort on a directed graph (in adjacency list format), where the keys represent nodes and values are an array of nodes that have an outgoing edge to the current node.

MEDIUM