Problem Statement

Candy pairs Problem Description You have a box of candies of different brands and different sizes represented by the string candies. There are two sizes of candies produced by each brand which are small and large. Uppercase alphabets are used to represent large candies, while lowercase alphabets are used to represent small candies. If one brand is higher in alphabetical order than another, for example, C > B, then that brand is better. Therefore, Brand C is better than Brand B. Find the best candy pair in the box that is the best brand that has both small and large candies in the box, and return 0 if it isn't there. You are given an integer N where N represents the total number of candies in the box. You are given an array of candies representing the brand and type of candies in the box. Each candy is represented by an English alphabet where lowercase alphabets denote the small candies and uppercase alphabets denote the large candies. Return the uppercase representation of the best bra