Max Winning Streak Game Points

PKJ

 Coding Problem Keys 

 Max Winning Streak Game Points 

 Problem Statement 

Alok is playing N round of card games with his friend Brinda. He gets positive or negative based on whether he won or lost in a specific round. Alok can also get zero points in case of a tie.

Given the points obtained in N rounds, the program must print the maximum sum of points obtained in any of the winning streak sequence.

 Boundary Condition(s) 

3 <= N <= 100
-100 <= P(i) <= 100

 Input Format 

The first line contains N.
The second line contains the points P(i), i = 1 to N with the points separated by a space.

 Output Format 

The first line contains M which represents the maximum number of points obtained in any of the winning sequence.

 Example Input/Output 1 

 Input 

7
9 2 3 -1 1 2 4

 Output 

14

 Example Input/Output 2 

 Input 

15
11 20 6 7 -4 2 -5 15 8 3 16 8 3 -1 -2 

 Output 

53

 Example Input/Output 3 

 Input 

5
-1 -2 -4 -9 -3

 Output 

0

 Note: Max Execution Time Limit: 5000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

n=int(input())
l=list(map(int,input().split()))
k=[0,];s=[]
for i in range(n):
    if l[i]>0:
        s.append(l[i])
        if i==n-1:
            k.append(sum(s))
    if l[i]<=0 and s!=[]:
        k.append(sum(s))
        s=[]
print(max(k))

# Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Function decimalToBinary - CTS Pattern

PKJ
 Coding Problem Keys   CTS Pattern   Function decimalToBinary   Problem Statement  You are required to fix all the logical errors in the given code. You can click on run anytime to check the compilation/execution status of the program. You can use printf to debug your code. The submitted code should be logically/syntactically correct and pass all test cases. Do not write the main() function as it is not required. Code Approach:  For this question, you will need to correct the given implementation. We do not expect you to modify the approach or incorporate any additional library methods. The function decimalToBinary (int N) accepts an integer N as the input. The function is supposed to print the binary representation of N. The function compiles succesfully but fails to print the desired result due to logical errors.  Your task is to debug the program to passes all test cases.  Max Execution Time Limit: 5000 millisecs   Give...
Click to Continue...

Flowchart Logic 047

PKJ
 Coding Problem Keys   Flowchart Logic 047   Problem Statement  Please fill in the lines of code to implement the logic present in the flowchart.  Example Input/Output 1   Input  18 4 10  Output  1 2 11 13 14 16 17  Note: Max Execution Time Limit: 50 millisecs   Solution   Programming Language: Python 3 Language  N,X,Y= map ( int , input ().split()) ctr= 1 while (ctr<=N): if ((ctr<X or ctr>Y) and ctr% 3 != 0 ): print (ctr,end= " " ) ctr+= 1 # Published By PKJCODERS  Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main () { int N,X,Y; scanf( "%d%d%d" ,&N,&X,&Y); int ctr= 1 ; while (ctr<=N){ if ((ctr<X || ctr>Y) && ctr% 3 != 0 ){ printf( "%d " ,ctr); } ctr++; } } // Published By PKJCODERS  ( Note:  Inca...
Click to Continue...

Interface Implementation - Pair

PKJ
 Interface Implementation - Pair   Problem Statement:  You must define the class Node which implements the interface Pair so that program runs successfully. The class Hello accepts two integers as the input. It prints the HCF of the given two integers as shown in the Example Input/Output section. Then it prints the string value " YES " if the given two integers are co-prime. Else it prints the string value " NO ".  Example Input/Output 1:   Input:  21 22  Output:  HCF: 1 YES Explanation: The HCF of the given two integers is 1 . So the given integers are co-prime . Hence the output is HCF: 1 YES Example Input/Output 2: Input: 21 27 Output: HCF: 3 NO  Note: Max Execution Time Limit: 50 millisecs   Solution:   Programming Language: JAVA Language  import java.util.* ; interface Pair { public long getHCF ( int a , int b ); public boolean areCoPrime ( int a , int b ); } class Node im...
Click to Continue...

Bank Account Balance

PKJ
 Coding Problem Keys   Bank Account Balance   Problem Statement  In a given month, N transactions related to a bank account are passed as the input along with the initial balance IB present in the bank account. The program must print the final balance FB in the account after all the N transactions have been completed. Each transaction has a code followed by the amount. The following are the possible codes and a code is classified either as credit or debit. CASH - Cash deposit in the account ( CREDIT ) ATM - Withdrawal using ATM ( DEBIT ) CHQ - Cheque deposit ( CREDIT ) CHQW - Payment made using a cheque to another entity ( DEBIT ) INT - Interest credited ( CREDIT ) MNT - Account Maintenance Charges ( DEBIT ) CARD - Purchase using Debit Card ( DEBIT ) ET - Electronic Transfer using NEFT/RTGS/IMPS etc If more than L ATM withdrawals are made in a month, then Rs. X is deducted for each withdrawal. If a card purchase is made for more than Rs. Y, then 10%...
Click to Continue...

Desktop Products

PKJ
 Coding Problem Keys   Desktop Products   Problem Statement  A company DigiComparts manufactures 52 types of unique products for laptop and desktop computers. It manufactures 10 types of laptop products and 42 types of desktop products. Each product manufactured by the company has a unique productID from a-z and and A-Z. The laptop products have productIDs (a, i, e, o, u, A, I, E, O, U) while the rest of the productIDs are assigned to the desktop products. The company manager wishes to find the sales data for the desktop products. Given a list of productIDs of the sales of the last N products, write an algorithm to help the manager find the productIDs of the desktop products.  Input Format  The first line of the input consists of an integer numOfProducts, representing the number of products to be considered in the sales data (N). The second line consists of N space-separated characters - productID 1 , productID 2 , ... , productID N  represen...
Click to Continue...

Decreasing Sequence from N

PKJ
 Coding Problem Keys   Decreasing Sequence from N   Problem Statement  Two integers N and D are passed as input. The program must print the decreasing sequence from N to 1 with common difference D.  Boundary Condition(s)  2 <= N <= 9999999 1 <= D <= 9999999  Input Format  The first line contains N and D separated by a space.  Output Format  The first line contains integers separated by a space.  Example Input/Output 1   Input  20 3  Output  17 14 11 8 5 2  Explanation  The output is obtained by the cyclic manner of reducing value of 20 with 3 which is separated by space.  Example Input/Output 2   Input  26 5  Output  21 16 11 6 1  Explanation  The output is obtained by the cyclic manner of reducing value of 26 with 5 which is separated by space.  Max Execution Time Limit: 5000 millisecs   Solution   Programming L...
Click to Continue...