apoorvahp

apoorvahp's Stars

• Amrutha-M/CGV_Mini_Project

  Language:C++4

• kavya-shetty765/CGV_LAB_PROGRAMS

  1

• kavya-077/kavyya-CGV-LAB-PROGRAMS

  2

• anvithapo99/CGV-LAB-PROGRAM

  1

• chetana-H/chetana-cgv-program

  2

• Bhramari-P-shetty/hacker-and-traffic-light

  Language:Java7

• Bhramari-P-shetty/spellbee

  Given a pair of words (the first is the correct spelling and the second is the contestant’s spelling of the word) determine if the word is spelt correctly. The degree of correctness is as follows: CORRECT if it is an exact match ALMOST CORRECT if no more than 2 letters are wrong WRONG if 3 or more letters are wrong Input Format: Input consists of a pair of words. Output Format: Output the contestant’s spelling of the word and the degree of correctness. All letters are upper case. The output is to be formatted exactly like that for the sample output given below. Assumptions: Words contain only upper case letters. The maximum word length is 10. Sample Input: SAMPLE SIMPLE Sample Output: SIMPLE IS ALMOST CORRECT PROGRAM

  Language:C++2

• Bhramari-P-shetty/pubg

  Yatin is playing PUBG and he has reached a place with a large staircase in front of him. And there is an enemy at each landing of the staircase. The staircase is analogous to a binary tree with each of its nodes as a landing of the staircase and each of its edges as stairs from one landing to another. Yatin wants to kill the maximum possible number of enemies. He can kill every person he can see from his position with his suppressed sniper gun. But he can see only the persons at the leftmost standing at each level and cannot see the rest. Before starting shooting them, he wants to know how many persons he can kill. He is busy keeping an eye on the enemies. So he wants you to find out the maximum number of people he can kill from that location by providing you with the analogous a binary search tree. [ Note: Players do not change their position after one player has died, i.e. the leftmost node remains the same even after player on that node has died. Or we can say that the nodes are not removed after the player on that node has died.]

  2

• Bhramari-P-shetty/schedule

  Disneyland provides various attractions like Fireworks, Adventures, Character experience, etc.,. Patrick and Johnny wants to enjoy as much as they can and wants to plan everything prior to their visit to disneyland. Help them to plan by displaying them the timings of the events. Input Format : The first line of the input consists of an character array of size 50, which corresponds to name of the event. The second input consists of an float, which corresponds to start time of the event. The third input consists of an float, which corresponds to end time of the event. Output Format : Refer sample output for formatting specifications. Assume that the event will always start in the morning and end in the evening. Display two digits after the decimal point. [All text in bold corresponds to input and the rest corresponds to output] Sample Input and Output: Enter event : Fireworks Enter Start Time : 8.00 Enter End Time : 6.00 Fireworks : 8.00 AM to 6.00 PM

  Language:C++5

• Bhramari-P-shetty/CGV-

  6

• Suchitraheggade/Pubg

  Yatin plays PUBG: Yatin is playing PUBG and he has reached a place with a large staircase in front of him. And there is an enemy at each landing of the staircase. The staircase is analogous to a binary tree with each of its nodes as a landing of the staircase and each of its edges as stairs from one landing to another. Yatin wants to kill the maximum possible number of enemies. He can kill every person he can see from his position with his suppressed sniper gun. But he can see only the persons at the leftmost standing at each level and cannot see the rest. Before starting shooting them, he wants to know how many persons he can kill. He is busy keeping an eye on the enemies. So he wants you to find out the maximum number of people he can kill from that location by providing you with the analogous a binary search tree. Input Format: The first line of input contains a number t denoting the number of test cases. The first line of each test case contains n, the number of nodes in the tree. The second line of each test case contains n space separated integers (unique) ai denoting the value at each node of the BST.

  71

• Bhramari-P-shetty/micro

  Language:Java9

• Bhramari-P-shetty/hamiltonn

  Language:Java9

• Bhramari-P-shetty/hamilton

  Language:Java8

• Bhramari-P-shetty/frustrated-coders

  Language:C++6

• Bhramari-P-shetty/pink-Floyd

  Language:Java9

• Bhramari-P-shetty/monk-watching-fight

  Language:C++9

• Bhramari-P-shetty/hacker-and-traffic

  Language:Java9

• chetana-H/pg1

  7

• chetana-H/chetu

  5