# Google Kick Start Round E 2020 SOLUTIONS

Page Contents

## Google Kick Start Round E 2020 SOLUTIONS

Google Kick Start Round E all questions solutions are been posted here Please cooperate with us we are working for you guys to provide the answers as fast as possible by us.

## Codechef Long Challenge Solutions

### 3 thoughts on “Google Kick Start Round E 2020 SOLUTIONS”

1. My solution :

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Solution {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int t= scanner.nextInt();
for(int t1=1;t1<=t;t1++){
int n=scanner.nextInt();
int[] num = new int[n];
for(int i=0;i temp = new ArrayList<>();
int check=0;
if(n-i>=len){
for(int j=i+1;jlen){
len=temp.size();
}
}
}

System.out.println("Case #"+t1+": "+len);
}
}
}

2. Longest Arthmetic (Python 3)

for j in range(int(input())):
n=int(input())
f=[]
m=0
l=list(map(int,input().split()))
for i in range(len(l)-1):
if l[i]-l[i+1] in f:
f.append(l[i]-l[i+1])
if len(f)>m:
m=len(f)

else:
f=[]
f.append(l[i]-l[i+1])
if len(f)>m:
m=len(f)
print("Case #"+str(j+1)+": "+str(m+1))