added omar loves candies from a2oj

Author: purplesmurf45

Omar and Candies/Problem Statement.txt

@@ -0,0 +1,24 @@
+Omar can get as many candies as he wants but all of them must be of the same type. Find the candy having the biggest quantity in the store so that Omar can have maximum number of candies.
+
+
+Input Format:
+
+The first line of the input will be a single integer T, the number of test cases (1 <= T <= 100). Followed by the test cases, each test case is described in one line which contains a non-empty string which consists of up to 100 letters, each letter is a lower case English letter (from 'a' to 'z'). This string represents all candies in the store, each candy is described using 1 character, so if the string is "abac" this means the store contains 2 candies of type 'a', 1 candy of type 'b' and 1 candy of type 'c'.
+
+
+Output Format:
+
+For each test case, print a single line which contains a single integer representing the maximum number of candies that Omar can get followed by a space then a letter which represents the kind of that candy. If there are multiple candies with the same number, print the one which occurs relatively first in the English alphabet.
+
+
+Sample Input:
+3
+abac
+abc
+zzz
+
+
+Sample Output:
+2 a
+1 a
+3 z

Omar and Candies/Solution.c

@@ -0,0 +1,28 @@
+#include<stdio.h>
+#include<string.h>
+#include<stdlib.h>
+
+int main()
+{
+  int t;
+  scanf("%d",&t);
+  while(t--){
+  char str[100];
+  scanf("%s",str);
+  int i;
+  int *arr = (int*)calloc(26,sizeof(int));
+  for(i=0;i<strlen(str);i++){
+    arr[str[i]-97]++;
+  }
+  int max=arr[0],c=0;
+  for(i=1;i<26;i++)
+  {
+    if(arr[i]>max){
+      max = arr[i];
+      c=i;
+    }
+  }
+  printf("%d %c\n",max,c+97);
+}
+  return 0;
+}