CareerCup

#include <stdio.h>
#include<ctpye.h>
#include <conio.h>
#include <string.h>


int main()
{
	int i,l1=0,l2=0;
	char str1[30],str2[30];
	printf("\nEnter the string1, string 2:\n");
	scanf("%s%s",str1,str2);
	
	for(i=0;i<strlen(str1);i++)
	{
		if(isdigit(str1[i]))
			l1++;
	}
	for(i=0;i<(strlen(str2));i++)
	{
		if(isdigit(str2[i]))
			l2++;
	}
	if(l1>l2)
		printf("\n%s has more numbers",str1);
	else if(l2>l1) 
		printf("\n%s has more numbers",str2);
	if(l1==l2)
	{
		if(strlen(str1)>=strlen(str2))
			printf("\n%s has more numbers",str1);
		else
			printf("\n%s has more numbers",str2);
	}
	printf("\npress any key to continue");
	getch();
}

public static String leastNum(String[] myS) {
		
		String[] myHash = new String[10]; //this assumes max 10 numeric characters per string
		int count = 0;
		
		for (String s: myS) {
			for (char c: s.toCharArray()) {
				if (c >= 48 && c <= 57) {
					count++;
				}
			}
			if (myHash[count] != null && s.length() > myHash[count].length()) {
				myHash[count] = s;
			}
			else if (myHash[count] == null){
				myHash[count] = s;
			}
			count = 0;
		}
		
		String solution = null;
		
		for (int i=9; i>=0; i--) {
			if (myHash[i] != null) {
				System.out.println(myHash[i]);
				solution = myHash[i];
				break;
			}
		}
		
		return solution;

}

public class FastFindString {

    public String fastFind(String[] array)
    {
        if (array.length == 1)
        {
            return array[0];
        }
        if (array.length == 2)
        {
            if (array[0].equalsIgnoreCase(array[1]))
            {
                return array[0];
            }
        }

        String leastNumString = null;
        int leastCount = -1;

        for (int i=0; i<array.length; i++)
        {
            String str = array[i];
            String num_str = str.replaceAll("[^-?0-9]+", " ");

            if (null != num_str)
            {
                List<String> numList = Arrays.asList(num_str.trim().split(" "));
                int count = numList.size();
                if (i==0)
                {
                    leastCount = count;
                }
                if (count < leastCount)
                {
                    leastCount = count;
                    leastNumString = str;
                }
            }


        }
        return leastNumString;
    }


    public static void main(String[] args)
    {
        FastFindString fastFind = new FastFindString();
        String[] input = {"ABCDEF", "ABCDEF"};
        System.out.println(fastFind.fastFind(input));
    }

}

public class FastFindString {

    public String fastFind(String[] array)
    {
        if (array.length == 1)
        {
            return array[0];
        }
        if (array.length == 2)
        {
            if (array[0].equalsIgnoreCase(array[1]))
            {
                return array[0];
            }
        }

        String leastNumString = null;
        int leastCount = -1;

        for (int i=0; i<array.length; i++)
        {
            String str = array[i];
            String num_str = str.replaceAll("[^-?0-9]+", " ");

            if (null != num_str)
            {
                List<String> numList = Arrays.asList(num_str.trim().split(" "));
                int count = numList.size();
                if (i==0)
                {
                    leastCount = count;
                }
                if (count < leastCount)
                {
                    leastCount = count;
                    leastNumString = str;
                }
            }


        }
        return leastNumString;
    }


    public static void main(String[] args)
    {
        FastFindString fastFind = new FastFindString();
        String[] input = {"ABCDEF", "ABCDEF"};
        System.out.println(fastFind.fastFind(input));
    }
}

xs

Use treemap with key as number of digits and value as string and it's length(inner class and list of values)