Skip to main content

InfyTQ Python Coding Questions & Answers 2022 - Amusement park

 

InfyTQ Python Coding Questions & Answers  2022

Amusement park

Problem Statement – 

Aashay loves to go to WONDERLA , an amusement park. They are offering students who can code well with some discount. Our task is to reduce the cost of the ticket as low as possible.

The cost of tickets can be removed by removing the digits from the price given. They will give some k turns to remove the digits from the price of the ticket. Your task is to help Aashay in coding a program that can help him to reduce the cost of a ticket by removing the digits from its price and getting the maximum possible discount.

Note – You cannot make the cost of a ticket zero. For eg -: If the cost of a ticket is 100, and you have 2 turns to reduce the price, the final price will be 1 and not zero.

Constraints:

1 <= number of tickets <= 10^5

1 <= K <= number of tickets

Input Format for Custom Testing:

The first line contains a string,Tickets, denoting the given cost of each ticket.

The next line contains an integer, K, denoting the number of tickets that is to be removed.

Sample Cases:

Sample Input 1
203
3

Sample Output 1
0

Program :

 

import sys

n=input("Cost of each Ticket : ")

k=int(input("Number of Tickets that is to be Removed : "))

n1=len(n)

if len(n)<=k:

          print(0)

          sys.exit()

 

a=''

i=0

while i < (n1-1) and k>0:

          if int(n[i])>int(n[i+1]):

                   i+=1

                   k-=1

                   continue

          else:

                   a+=n[i]

                   i+=1

 

a+=n[i]

i+=1

if k>0:

          a=a[:-k]

 

if i<=(n1-1):

          while i < n1:

                   a+=n[i]

                   i+=1

 

print(int(a)%((10**9)+7))


for execution and output so check the video :



Comments

Popular posts from this blog

Hackerrank Java Coding Questions and Answers - Maximum Passengers

  Hackerrank Java Coding Questions and Answers Maximum Passengers Problem Statement -:  A taxi can take multiple passengers to the railway station at the same time.On the way back to the starting point,the taxi driver may pick up additional passengers for his next trip to the airport.A map of passenger location has been created,represented as a square matrix. The Matrix is filled with cells,and each cell will have an initial value as follows: A value greater than or equal to zero represents a path. A value equal to 1 represents a passenger. A value equal to -1 represents an obstruction. The rules of motion of taxi are as follows: The Taxi driver starts at (0,0) and the railway station is at (n-1,n-1).Movement towards the railway station is right or down,through valid path cells. After reaching (n-1,n-1) the taxi driver travels back to (0,0) by travelling left or up through valid path cells. When passing through a path cell containing a passenger,the passe...

HackerRank Java Coding Questions and Answers - Disk Space Analysis

  HackerRank   Java   Coding   Questions   and   Answers Disk Space Analysis Problem Statement -:   You are given an array, You have to choose a contiguous subarray of length ‘k’, and find the minimum of that segment, return the maximum of those minimums. Sample input 1 →  Length of segment x =1 5 →  size of space n = 5 1 → space = [ 1,2,3,1,2] 2  3  1  2  Sample output 3 Explanation The subarrays of size x = 1 are [1],[2],[3],[1], and [2],Because each subarray only contains 1 element, each value is minimal with respect to the subarray it is in. The maximum of these values is 3. Therefore, the answer is 3   Program :   // Hackerrank Java Coding Questions and Answers //   Disk Space Analysis   import java.util.*; class DiskSpace {   public static void main(String[] args) {   Scanner sc=new Scanner(System.in);   System.out.println...

TCS CodeVita Coding Questions with Answers - Counting Rock Sample

  TCS CodeVita Coding Questions with Answers Counting Rock Sample Problem Description Question – :  Juan Marquinho is a geologist and he needs to count rock samples in order to send it to a chemical laboratory. He has a problem: The laboratory only accepts rock samples by a range of its size in ppm (parts per million). Juan Marquinho receives the rock samples one by one and he classifies the rock samples according to the range of the laboratory. This process is very hard because the number of rock samples may be in millions. Juan Marquinho needs your help, your task is to develop a program to get the number of rocks in each of the ranges accepted by the laboratory. Input Format :  An positive integer S (the number of rock samples) separated by a blank space, and a positive integer R (the number of ranges of the laboratory); A list of the sizes of S samples (in ppm), as positive integers separated by space R lines where the ith line containing two positive...