Company: Flipkart_19july
Difficulty: medium
Connected Flower Field Problem Description Bob is a florist who owns a field in the form of a grid of m x n cells. He has planted different types of flowers in the field, with one cell in the grid having a flower of one type only. One day he gets an order for a large flower bouquet, with the requirement that the bouquet can contain at most two types of flowers. Bob wants to finish the job as quickly as possible since he has a doctor's appointment, so he goes to the field and decides to pick flowers only from the largest connected area where he can move easily between adjacent cells i.e. cells sharing a side. However he is not sure how to choose such an area. Write a program to help Bob find the largest connected area which has only one or two types of flowers, and print the number of cells he can cover as the output. Read the input from STDIN and print the output to STDOUT. Do not print arbitrary strings anywhere in the program, as these contribute to the standard output and test cases