Java Code for Zero Count (TCS Codevita) | PrepInsta
Zero Count
TCS CodeVita is a coding competition organized by TCS every year, in search of world’s best coder. This is a global level coding competition in which coders from all around the world compete for the title of World’s Best Coder. Zero Count is one of the sample problem of this year TCS CodeVita season 11 competition.
Question -:You are given a binary string B of length L which contains K ones and remaining zeros. You are required to place the K ones in the binary string in such a way that the longest consecutive zeros have the least length possible. Once such a binary string is constructed, you are required to print the length of the contiguous block of zeros, which has the largest length.
Constraints
0 <= K <= L
Java
Java
Run
import java.util.Scanner;
public class ZeroCount {
public static int zeroCount(int L, int K) {
if (K == 0) {
return L;
}
if (K == L) {
return 0;
}
int maxZeros = 0;
if (K > 0) {
maxZeros = 1;
}
return maxZeros;
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int L = scanner.nextInt();
int K = scanner.nextInt();
int result = zeroCount(L, K);
System.out.println(result);
scanner.close();
}
}
Login/Signup to comment