ashu102

ashu102's Stars

• Jchethana1990/monkwatchingfight

  Language:Java1

• akshatkhandelwal1/akshat-repository

  7

• kavya-shetty765/PinkFloydAndHappiness

  Pink is sad because of some reasons, he wants to cheer up by listening to some songs from his favorite band, Pink Floyd. There are N records and Pink will be happy if he listens to them in the ascending order, i.e., first the song No. 1, then No.2 and so on (He has to listen to all the N songs to become Happy). Pink is delivered his records in some given order, he can either add the record to the Playlist in the delivered order or put some on another table. After being put on the table only the topmost record can be added to the playlist at any time. Print whether Pink will be sad or happy after the delivery of the records. Input Format N - Number of records followed by N numbers- order of records. Output Format Print "Happy" if the playlist has songs from 1 to N in order else "Sad".

  Language:C5

• spoorthybalaji/Monk

  5

• Suchitraheggade/Hacker

  5. Hacker and traffic lights Zolo is stuck in a traffic due to dysfunctional traffic light. Zolo is a professional hacker and he can get into the system and change the state of the light. His planet has different types of traffic lights such that there are N bulbs on the traffic board and only when all of them are green(G) the cars can pass. there are 2 other states also which the bulb can show; i.e. Red(R) & Yellow(Y). Note that the lights are designed such that they follow a state change cyclic pattern as follows: R------>Y------>G------->R Once Zolo gets into the system he can select any position i and update all elements between i to min(N, i + K - 1) by increasing their state by 1.This whole process takes 1 sec and he can repeat this process any no. of times until he gets all lights = G . Find the minimum time to do the process as Zolo is getting late for work.

  9

• JagathHaren/Micro-and-Array-Update

  Micro purchased an array A having N integer values. After playing it for a while, he got bored of it and decided to update value of its element. In one second he can increase value of each array element by 1. He wants each array element's value to become greater than or equal to K. Please help Micro to find out the minimum amount of time it will take, for him to do so.

  Language:Java5

• ashwiniachar/ashwiniacharya

  7

• hemalatha36/monk

  Language:C6

• hemalatha36/hackers-and-traffic-light

  82

• JagathHaren/Frustrated-coders

  There are N frustrated coders standing in a circle with a gun in their hands. Each coder has a skill value S[ i ] and he can only kill those coders that have strictly less skill than him. One more thing, all the guns have only 1 bullet. This roulette can take place in any random order. Fortunately, you have the time stone (haaan wo harre wala) and you can see all possible outcomes of this scenario. Find the outcome where the total sum of the remaining coder's skill is minimum. Print this sum.

  Language:Java71

• akshatkhandelwal1/Frustrated-Coders

  7

• spoorthybalaji/Pubg

  6

• maheksa1234/question.c-

  101

• apoorvahp/haunted

  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

• JayrajShah/Last-Occurrence

  You have been given an array of size N consisting of integers. In addition you have been given an element M you need to find and print the index of the last occurrence of this element M in the array if it exists in it, otherwise print -1. Consider this array to be 1 indexed.

  Language:Java8

• JayrajShah/RegistrationForm-JSP

  A simple registration form using JSP and HTML. Form reads the input and displays on the next page. NO DATABASE USED

  142

• anvithapo99/-Print-Array-in-Reverse

  Language:Jupyter Notebook7

• Bhramari-P-shetty/Remove-friends

  Language:C++7

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

  Language:Java9

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

  Language:Java7

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

  Language:C++9

• neenaarun12345/code1.c-

  8

• deshika101/program-8a

  7

• apoorvahp/pink

  Language:Java2

• kanakabs/kannubs.github.io

  Language:HTML7

• anvithapo99/prog1

  9

• kanakabs/code-1.c-

  6

• nayananik/sample

  9

• nayananik/question.c-

  11