Facebook Interview Question for Web Developers


Country: United States
Interview Type: Phone Interview




Comment hidden because of low score. Click to expand.
2
of 2 vote

The number of combinations that can arise due to the size of the numbers are huge. So I think its a good idea to talk to the interviewer to see how large the number will be.

In the below example, I have taken a number till thousand. (Logic will remain the same for the larger numbers as well)

There are couple of special handling scenarios that we need to handle.
1. Number that ends in 0.
--> for such numbers, we dont call out last 0. example for 510, we convert this number to "five hundred ten". We dont say "five hundred ten zero"
2. Number that has 1 in its tenth position.
--> For such numbers we write **teen. Example for 513, we convert this number to "five hundred thirteen". We dont say "five hundred ten three"
3. Single digit numbers

Here is the code that handles

public class NumberToEnglishPhrase {

	static Map<String, String> tenToNinteen = new HashMap<>();
	static Map<String, String> tens = new HashMap<>();
	static Map<String, String> digit = new HashMap<>();
	
	public static void main(String[] args) {
		int[] n = {512,5123, 10, 9, 340};
		populateData();
		for(int x: n) 
			System.out.println(englishPhrase(x));
	}

	private static String englishPhrase(int n) {
		//special handling for smaller than 10
		if(n < 10) {
			return digit.get(n+"");
		}
		
		//special handling for numbers with 1 in tenth position
		Stack<String> stack = new Stack<>();
		String s = n+"";
		char[] digits = s.toCharArray();
		if(digits.length > 1) {
			if(digits[digits.length-2] == '1') {
				String lastTwo = new String(digits[digits.length-2]+"") + new String(digits[digits.length-1]+"");
				stack.push(tenToNinteen.get(lastTwo));
			} else {
				String last = digits[digits.length-1]+"";
				if(! last.equals("0")) {
					stack.push(digit.get(last));
				}
				String secondLast = digits[digits.length-2]+"";
				int num = Integer.valueOf(secondLast)*10;
				stack.push(tens.get( num + ""));
			}
		}
		int x = 2;
		for(int i = digits.length - 3; i >=0; i--) {
			if(x == 2) stack.push("hundred and");
			if(x == 3) stack.push("thousand");
			stack.push(digit.get(digits[i]+""));
			x++;
		}
		
		StringBuilder sb = new StringBuilder();
		while(!stack.isEmpty())
			sb.append(stack.pop() + " ");
		
		return sb.toString();
	}
	
	private static void populateData() {
		tenToNinteen.put("10", "ten");
		tenToNinteen.put("11", "eleven");
		tenToNinteen.put("12", "twelve");
		tenToNinteen.put("13", "thrteen");
		tenToNinteen.put("14", "forteen");
		tenToNinteen.put("15", "fifteen");
		tenToNinteen.put("16", "sixteen");
		tenToNinteen.put("17", "seventeen");
		tenToNinteen.put("18", "eighteen");
		tenToNinteen.put("19", "nineteen");
		
		
		tens.put("20", "twenty");
		tens.put("30", "thirty");
		tens.put("40", "forty");
		tens.put("50", "fifty");
		tens.put("60", "sixty");
		tens.put("70", "seventy");
		tens.put("80", "eighty");
		tens.put("90", "ninety");
		
		digit.put("1", "one");
		digit.put("2", "two");
		digit.put("3", "three");
		digit.put("4", "four");
		digit.put("5", "five");
		digit.put("6", "six");
		digit.put("7", "seven");
		digit.put("8", "eight");
		digit.put("9", "nine");
	}
}

Output:
=======
five hundred and twelve 
five thousand one hundred and twenty three 
ten 
nine
three hundred and forty

- Saurabh August 20, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

See leetcode problem 273 (Integer to English Words).

- adr August 20, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

This is my take on the question

case num ==0 output Zero
case num != 0
    split it in 1000s (0-999) append thousand, million or billion appropriately
        split it in 100s (0-99)
            case 0-19 append the word from n0to19
            case 20-99 append tens place from n10s and ones place from n0to19
        split hundreds place append word from n0to19 and hundred if not empty
Note : need to append "and" if number is less than 1000 and has tens and ones place

public class Num2W
{
    static String[] n0to19 = {"",         " One",       " Two",      " Three",
                              " Four",    " Five",      " Six",      " Seven",
                              " Eight",   " Nine",      " Ten",      " Eleven",
                              " Twelve",  " Thirteen",  " Fourteen", " Fifteen",
                              " Sixteen", " Seventeen", " Eighteen", " Nineteen"};
    static String[] n10s   = {" Twenty",  " Thirty",    " Fourty",   " Fifty", 
                              " Sixty",   " Seventy",   " Eighty",   " Ninety"};
    static String[] nmulk  = {"",         " Thousand,", " Million,", " Billion,"};

    private static String convert(int n, int sfix)
    {
        String inW = "";
        if (n != 0) {
            int tmp = n % 100;
            if (tmp != 0) {
                if (tmp < 20)
                    inW = n0to19[tmp];
                else
                    inW = n10s[(tmp / 10) - 2] + n0to19[tmp % 10];
                if (sfix == 0)
                    inW = " and" + inW;
            }
            tmp = n / 100;
            if (tmp != 0)
                inW = n0to19[tmp] + " Hundred" + inW;
            inW += nmulk[sfix];
        }
        return inW;
    }

    public static void main(String[] args)
    {
        int n = (new Scanner(System.in)).nextInt();
        String out = "";

        if (n == 0)
            out = " Zero";
        else
            for (int i = 0; n != 0; i++) {
                out = convert(n % 1000, i) + out;
                n /= 1000;
            }
        System.out.println("In Words :" + out);
    }
}

- PeyarTheriyaa August 21, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

const _trillion = 1000000000000;
const _billion  = 1000000000;
const _million  = 1000000;
const _thousand = 1000;
const _hundred  = 100;

function describe_less_than_ten( n ) {
    if( n==9 )
        return "nine";
    if( n==8 )
        return "eight";
    if( n==7 )
        return "seven";
    if( n==6 )
        return "six";
    if( n==5 )
        return "five";
    if( n==4 )
        return "four";
    if( n==3 )
        return "three";
    if( n==2 )
        return "two";
    if( n==1 )
        return "one";
    return "zero"
}
function describe_less_than_hundred( n ) {
    // TODO: generate: these numbers by describe_less_than_ten()+"ty"???
    if( n>=90 )
        return "ninety" +((n%10)?" "+describe_less_than_ten(n%10):"");
    if( n>=80 )
        return "eighty" +((n%10)?" "+describe_less_than_ten(n%10):"");
    if( n>=70 )
        return "seventy"+((n%10)?" "+describe_less_than_ten(n%10):"");
    if( n>=60 )
        return "sixty"  +((n%10)?" "+describe_less_than_ten(n%10):"");
    if( n>=50 )
        return "fifty"  +((n%10)?" "+describe_less_than_ten(n%10):"");
    if( n>=40 )
        return "fourty" +((n%10)?" "+describe_less_than_ten(n%10):"");
    if( n>=30 )
        return "thirty" +((n%10)?" "+describe_less_than_ten(n%10):"");
    if( n>=20 )
        return "twenty" +((n%10)?" "+describe_less_than_ten(n%10):"");
    // TODO: generate *teen numbers by describe_less_than_ten()+"teen"???
    if( n==19 )
        return "nineteen";
    if( n==18 )
        return "eighteen";
    if( n==17 )
        return "seventeen";
    if( n==16 )
        return "sixteen";
    if( n==15 )
        return "fifteen";
    if( n==14 )
        return "fourteen";
    if( n==13 )
        return "thirteen";
    if( n==12 )
        return "twelve";
    if( n==11 )
        return "eleven";
    if( n==10 )
        return "ten";
    return describe_less_than_ten(n);
}
function describe_less_than_thousand( n ) {
    if( n<_hundred )
        return describe_less_than_hundred(n);
    return describe_less_than_ten(Math.floor(n/_hundred))+" hundred "+describe_less_than_hundred(n%_hundred);
}
function smart_join( trillions, billions, millions, thousands, hundreds, therest ) {
    let result = [];
    if( trillions>0 )
        result.push(describe_less_than_thousand(trillions)+" trillion");
    if( billions>0 )
        result.push(describe_less_than_thousand(billions)+" billion");
    if( millions>0 )
        result.push(describe_less_than_thousand(millions)+" million");
    if( thousands>0 )
        result.push(describe_less_than_thousand(thousands)+" thousand");
    if( hundreds>0 )
        result.push(describe_less_than_hundred(hundreds)+" hundred");
    if( therest>0 )
        result.push(describe_less_than_hundred(therest));
    if( result.length==0 )
        result.push("zero");
    return result.join(" ");
}
function describe_number( n ) {
    if( n<0 )
        return "negative "+describe_number(-n);
    return smart_join(
        Math.floor( n/_trillion ),
        Math.floor( (n%_trillion)/_billion ),
        Math.floor( (n%_billion)/_million ),
        Math.floor( (n%_million)/_thousand ),
        Math.floor( (n%_thousand)/_hundred ),
        (n%_hundred));
}

console.log(describe_number(Number(process.argv[2])));

- catfat August 23, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Hi there,

in this solution I'm taking advatange of generating words for three digits. When you look at any number you can see that mainly you generate words up till hundrets and after that you just add specific word if needed eg. thousand, milion etc. My solution can be easliy extended, by just adding new values into array like billion etc.

{
        static string[] singleArray = new string[]{"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten",
                                            "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"};
        static string[] dozensArray = new string[]{"","Ten","Twenty","Thirty","Fourty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"};
        static string hundretLiteral = "Hundret";
        static string[] higherOrdersArray = new string[]{"","Thousand","Milion"};//etc.

        static int Main(string[] args){
            int number = 5113257;
            string stringToAppend= String.Empty;
            StringBuilder result = new StringBuilder();
            int i=0;
            while(number!=0 && i<higherOrdersArray.Length){
                ThreeDigitsToString(result, ref number, i);
                i++;
            }
            Console.WriteLine(result.ToString());
            return 0;
        }

        private static void ThreeDigitsToString(StringBuilder result, ref int number, int counter)
        {
            //Dozens to string
            int modNumber = number % 100;
            string outputString = String.Empty;
            if(modNumber<20 && modNumber>0){
                outputString = singleArray[modNumber]+" ";
            }else{
                outputString=dozensArray[(number/10)%10]+" "+singleArray[number%10]+" ";
            }
            int dividedNumber = number/100;
            modNumber=dividedNumber%10;
            //hundrets to string
            if(modNumber>0){
                outputString = singleArray[modNumber]+" "+hundretLiteral+(counter>0?" ":" and ") + outputString;
            }
            //higher order endings
            if(counter>0){
                outputString = outputString+ higherOrdersArray[counter]+", ";
            }
            number = dividedNumber/10;
            result.Insert(0,outputString);
        }
    }

- DoubleA August 28, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

A code to support from 1 to 9999

public class ConvertInteger2EnglishPhrase {

    public static void main(String[] args) {

        String[] ones = {"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine"};

        String[] teens = {"", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Ninteen"};

        String[] tens = {"", "Ten", "Twenty", "Thirty", "Fourty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninty"};

        String[] hundreds = new String[10];
        for (int i = 0; i < 10; i++) {
            hundreds[i] = ones[i] + " " + "Hundred";
        }

        String[] thousands = new String[10];
        for (int i = 0; i < 10; i++) {
            thousands[i] = ones[i] + " " + "Thousand";
        }

        String[][] numbers = {ones, tens, hundreds, thousands};


        int input = 117;
        String out = "";

        int len;

        int divider = 1;

        for (int j = 1; j <= 9999; j++) {

            input = j;
            out = "";

            while (input > 0) {

                if (input > 0 && input < 10) {
                    out += " " + ones[input % 10];
                    break;
                } else if (input > 10 && input < 20) {
                    out += " " + teens[input % 10];
                    break;
                } else {

                    // get # of digit
                    len = String.valueOf(input).length();

                    divider = 1;
                    for (int i = 0; i < (len - 1); i++)
                        divider *= 10;

                    int quotient = input / divider;

                    out += " " + numbers[len - 1][quotient];

                    input -= divider * quotient;
                }
            }

            System.out.println(out);
        }
    }
}

- CJ September 11, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

How much time was giving by the interviewer for such question?

- timello September 16, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Here's my solution in C#.NET. I haven't been able to break it yet. It handles values up to 999 trillion, easy to extend, relatively easy to read, fast

public class WholeNumberParser
    {
        private Stack<long> intermediateAddends = new Stack<long>();
        private Stack<long> intermediateNumbers = new Stack<long>();
        private Dictionary<string, long> numbers = new Dictionary<string, long>()
        {
            { "one", 1 },
            { "two", 2 },
            { "three", 3 },
            { "four", 4 },
            { "five", 5 },
            { "six", 6 },
            { "seven", 7 },
            { "eight", 8 },
            { "nine", 9 },
            {"ten", 10 },
            {"eleven", 11 },
            {"twelve", 12 },
            {"thirteen", 13 },
            {"fourteen", 14 },
            {"fifteen", 15 },
            {"sixteen", 16 },
            {"seventeen", 17 },
            {"eighteen", 18 },
            {"nineteen", 19 },
        };

        private Dictionary<string, long> addends = new Dictionary<string, long>
        {
            {"twenty", 20 },
            {"thirty", 30 },
            {"fourty", 40 },
            {"fifty", 50 },
            {"sixty", 60 },
            {"seventy", 70 },
            {"eighty", 80 },
            {"ninety", 90 },
        };

        private Dictionary<string, long> factors = new Dictionary<string, long>()
        {
            {"hundred", 100 },
            {"thousand", 1000 },
            {"million", 1000000 },
            {"billion", 1000000000 },
            {"trillion", 1000000000000 },
        };

        private Regex ignored = new Regex("and", RegexOptions.IgnoreCase | RegexOptions.Multiline);

        public long? Parse(string numberExpression)
        {
            bool success = false;
            var tokens = numberExpression.Split(' ');
            for (var i = 0; i < tokens.Length; ++i)
            {
                var token = tokens[i];
                if(ignored.IsMatch(token)) continue;

                success = PushValues(token);
                if (success == false) break;
            }
            return success ? TotalValues() : null;
        }

        private bool PushValues(string token)
        {
            bool success = false;

            long addend;
            success = GetAddend(token, out addend);
            if (success)
            {
                if (intermediateNumbers.Any())
                {
                    addend += intermediateNumbers.Pop();
                }
                intermediateAddends.Push(addend);
                return true;
            }

            long number;
            success = GetNumber(token, out number);
            if (success)
            {
                if (intermediateAddends.Any())
                {
                    var intermediateAddend = intermediateAddends.Pop();
                    number += intermediateAddend;
                }
                intermediateNumbers.Push(number);
                return true;
            }

            long factor;
            success = GetFactor(token, out factor);
            if (success)
            {
                if (intermediateNumbers.Any())
                {
                    var intermediateNumber = intermediateNumbers.Pop();
                    factor *= intermediateNumber;
                }
                intermediateNumbers.Push(factor);
                return true;
            }

            return false;
        }

        private bool GetAddend(string numberExpression, out long addend)
        {
            return addends.TryGetValue(numberExpression, out addend);
        }

        private bool GetNumber(string numberExpression, out long number)
        {
            return numbers.TryGetValue(numberExpression, out number);
        }

        private bool GetFactor(string numberExpression, out long number)
        {
            return factors.TryGetValue(numberExpression, out number);
        }

        private long? TotalValues()
        {
            return intermediateNumbers.Aggregate((total, value) => total += value);
        }
    }

- captainrdubb September 19, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Very easily extendable code/

// C++ program to find count of endless points 
#include<bits/stdc++.h> 
#include <stdio.h> 
#include <string.h> 
#include <stdlib.h> 

using namespace std; 

const int MAX = 100; 

/* The first string is not used, it is to make 
	array indexing simple */
string single_digits[10] = { "", "one", "two", 
						"three", "four","five", 
						"six", "seven", "eight", "nine"}; 

/* The first string is not used, it is to make 
	array indexing simple */
string two_digits[11] = {"", "ten", "eleven", "twelve", 
						"thirteen", "fourteen", 
						"fifteen", "sixteen", 
						"seventeen", "eighteen", "nineteen"}; 

/* The first two string are not used, they are to make 
	array indexing simple*/
string tens_multiple[10] = {"", "", "twenty", "thirty", "forty", "fifty", 
						"sixty", "seventy", "eighty", "ninety"}; 

string hundred= "hundred";
string power3[] = {"", "thousand", "million"};

string printlessThanThousand(int i) {
    string output;
    if (i >100) {
        output += single_digits[i/100];
        output += " ";
        output += hundred;
        i = i%100;
    } 
    
    if (i>9 && i < 20) {
        output += " ";
        output += two_digits[i-9];
        return output;
    }
    if (i>19) {
        output += " ";
        output += tens_multiple[i/10];
        i = i%10;
    } 
    
    output += " ";
    output += single_digits[i];
    
    return output;
}

void convert_to_words(int i)
{
    std::string words = std::to_string(i);
    
    /* Base cases */
	if (words.size() == 0) { 
		fprintf(stderr, "empty string\n"); 
		return; 
	} 
	if (words.size() > 7) { 
		fprintf(stderr, "Length more than 7 is not supported\n"); 
		return; 
	}
	
	if (i == 0) cout << "Zero" << endl;
	
	int allowed = sizeof power3/sizeof power3[0];
	string output;
	
	for (int x=allowed; x >= 0; --x) {
	    int p = pow(1000, x);
	  
    	if (i/p > 0) {
    	    output += printlessThanThousand(int(i/p));
    	    output += " ";
    	    output += power3[x];
    	    output += " ";
    	    i %= p;
    	}
	}
	
    cout << output << endl;
}

/* Driver program to test above function */
int main(void) 
{ 
	convert_to_words(9923); 
	convert_to_words(523); 
	convert_to_words(89); 
	convert_to_words(8989); 
	
	convert_to_words(8123989); 

	return 0; 
}

- Ak13 October 22, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public String announce(int value) {
        String total_number = "";
        String number[] = {"", "one", "two", "three", "four", "five", "six", "seven","eight", "nine", "ten"};
        String tens[] = {"", "ten", "twenty", "thirty", "forty", "fifty", "sixty","seventy", "eighty", "ninety"};
        String teens[] = {"", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen","seventeen", "eighteen", "nineteen"};
        String thousands[] = {"", "thousand", "million", "billion", "trillion"};
        int count = 0;
        Stack<Integer> stack = new Stack<>();
        int tempVal = value;
        while (tempVal/1000 > 0) {
            stack.push(tempVal % 1000);
            count ++;
            tempVal /= 1000;
        }
        do {
            if (!total_number.isEmpty()) {
                total_number+= " and ";
            }
            boolean added = false;
            if (tempVal /100 > 0) {
                total_number += number[tempVal/100]+" hundred ";
                added = true;
            }
            tempVal %= 100;
            if (tempVal > 0) {
                if (added)
                    total_number += "and ";
                if (tempVal < 11) {
                    total_number+= number[tempVal];
                } else if (tempVal %10 == 0) {
                    total_number+= tens[tempVal/10];
                } else if (tempVal/10 == 1) {
                    total_number += teens[tempVal %10];
                } else {
                    total_number += tens[tempVal/10] + " "+ number[tempVal%10];
                }
            }
            if (count > 0) {
                if (tempVal > 0)
                    total_number += " " + thousands[count];
                count --;
                if (!stack.isEmpty())
                    tempVal = stack.pop();
                else
                    tempVal = -1;
            } else
                tempVal = -1;
        } while(tempVal != -1);
        return total_number;
    }

- Prashanth October 30, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public String announce(int value) {
        String total_number = "";
        String number[] = {"", "one", "two", "three", "four", "five", "six", "seven","eight", "nine", "ten"};
        String tens[] = {"", "ten", "twenty", "thirty", "forty", "fifty", "sixty","seventy", "eighty", "ninety"};
        String teens[] = {"", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen","seventeen", "eighteen", "nineteen"};
        String thousands[] = {"", "thousand", "million", "billion", "trillion"};
        int count = 0;
        Stack<Integer> stack = new Stack<>();
        int tempVal = value;
        while (tempVal/1000 > 0) {
            stack.push(tempVal % 1000);
            count ++;
            tempVal /= 1000;
        }
        do {
            if (!total_number.isEmpty()) {
                total_number+= " and ";
            }
            boolean added = false;
            if (tempVal /100 > 0) {
                total_number += number[tempVal/100]+" hundred ";
                added = true;
            }
            tempVal %= 100;
            if (tempVal > 0) {
                if (added)
                    total_number += "and ";
                if (tempVal < 11) {
                    total_number+= number[tempVal];
                } else if (tempVal %10 == 0) {
                    total_number+= tens[tempVal/10];
                } else if (tempVal/10 == 1) {
                    total_number += teens[tempVal %10];
                } else {
                    total_number += tens[tempVal/10] + " "+ number[tempVal%10];
                }
            }
            if (count > 0) {
                if (tempVal > 0)
                    total_number += " " + thousands[count];
                count --;
                if (!stack.isEmpty())
                    tempVal = stack.pop();
                else
                    tempVal = -1;
            } else
                tempVal = -1;
        } while(tempVal != -1);
        return total_number;
    }

- Prashanth October 30, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public class IntToString {

    static Map<Integer,String>  digit2Text = new HashMap<>();
    static Map<Integer, String> decimalDigits = new HashMap<>();


    static{
        digit2Text.put(1,"one");
        digit2Text.put(2,"two");
        digit2Text.put(3,"three");
        digit2Text.put(4,"four");
        digit2Text.put(5,"five");
        digit2Text.put(6,"six");
        digit2Text.put(7,"seven");
        digit2Text.put(8,"eight");
        digit2Text.put(9,"nine");
        digit2Text.put(10,"ten");
        digit2Text.put(11,"eleven");
        digit2Text.put(12,"twelve");
        digit2Text.put(13,"thirteen");
        digit2Text.put(14,"fourteen");
        digit2Text.put(15,"fifteen");
        digit2Text.put(16,"sixteen");
        digit2Text.put(17,"seventeen");
        digit2Text.put(18,"eighteen");
        digit2Text.put(19,"nineteen");


        decimalDigits.put(2, "twenty");
        decimalDigits.put(3, "thirty");
        decimalDigits.put(4, "fourty");
        decimalDigits.put(5, "fifty");
        decimalDigits.put(6, "sixty");
        decimalDigits.put(7, "seventy");
        decimalDigits.put(8, "eighty");
        decimalDigits.put(9, "ninety");
    }

    public static void main(String[] args){
        System.out.println("55: " + IntToString.getCurrNumStr(55));
        System.out.println("305: " + IntToString.getCurrNumStr(305));
        System.out.println("52168: " + IntToString.int2Str(52168));
        System.out.println("1234567890: " + IntToString.int2Str(1234567890));
    }

    public static Queue<String> getOrder(){
        Queue<String> order = new LinkedList<>();
        order.add("");
        order.add("thousand");
        order.add("million");
        order.add("billion");
        order.add("trillion");
        return order;
    }

    public static String int2Str(int num){
        String retVal = "";
        Queue<String> order = getOrder();

        while(num > 0) {
            String currOrder = order.poll();
            int currNum = num % 1000;
            num = num / 1000;

            retVal = getCurrNumStr(currNum) + " " + currOrder + " "+ retVal;
        }

        return retVal;
    }

    public static String getCurrNumStr(int num){
        String retVal = "";

        int hundreds = num / 100;
        int belowHundreed = num % 100;

        if(belowHundreed < 20){
            retVal = digit2Text.get(belowHundreed);
        } else {
            int digit = belowHundreed % 10;
            int decimalDigit = belowHundreed / 10;

            if (digit != 0) {
                retVal = digit2Text.get(digit);

                if (decimalDigit != 0) {
                    retVal = decimalDigits.get(decimalDigit) + " " + retVal;
                }
            } else {
                if (decimalDigit != 0) {
                    retVal = decimalDigits.get(decimalDigit) + " " + retVal;
                }
            }
        }

        if(hundreds != 0){
            String hundredsStr = digit2Text.get(hundreds);
            hundredsStr = hundredsStr + " hundreed";
            if(retVal.length() > 0){
                retVal = hundredsStr + " and " + retVal;
            } else {
                retVal = hundredsStr;
            }
        }

        return retVal;

    }
}

- miki November 01, 2018 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More