package com.amcat;

import java.text.NumberFormat;
import java.util.Locale;

public class NumbersTOWord {

public static String numToWord(Integer i) {

final String[] units = { "Zero", "One", "Two", "Three",
"Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven",
"Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen",
"Seventeen", "Eighteen", "Nineteen" };
final String[] tens = { "", "", "Twenty", "Thirty", "Forty",
"Fifty", "Sixty", "Seventy", "Eighty", "Ninety" };

if (i < 20)
return units[i];
if (i < 100)
return tens[i / 10] + ((i % 10 > 0) ? " " + numToWord(i % 10) : "");
if (i < 1000)
return units[i / 100] + " Hundred"
+ ((i % 100 > 0) ? " and " + numToWord(i % 100) : "");
if (i < 1000000)
return numToWord(i / 1000) + " Thousand "
+ ((i % 1000 > 0) ? " " + numToWord(i % 1000) : "");
return numToWord(i / 1000000) + " Million "
+ ((i % 1000000 > 0) ? " " + numToWord(i % 1000000) : "");
}
public static void main(String[] args) {

System.out.println(numToWord(101));

}

}

package com.amcat;

public class Balancedparanthesis {
static class stack {
int top = -1;
char items[] = new char[100];

void push(char x) {
if (top == 99) {
System.out.println("Stack full");
} else {
items[++top] = x;
}
}

char pop() {
if (top == -1) {
System.out.println("Underflow error");
return '\0';
} else {
char element = items[top];
top--;
return element;
}
}

boolean isEmpty() {
return (top == -1) ? true : false;
}
}

static boolean isMatchingPair(char character1, char character2) {
if (character1 == '(' && character2 == ')')
return true;
else if (character1 == '{' && character2 == '}')
return true;
else if (character1 == '[' && character2 == ']')
return true;
else
return false;
}

/*
* Return true if expression has balanced Parenthesis
*/
static boolean areParenthesisBalanced(char exp[]) {

stack st = new stack();

for (int i = 0; i < exp.length; i++) {

if (exp[i] == '{' || exp[i] == '(' || exp[i] == '[')
st.push(exp[i]);
if (exp[i] == '}' || exp[i] == ')' || exp[i] == ']') {
if (st.isEmpty()) {
return false;
}

else if (!isMatchingPair(st.pop(), exp[i])) {
return false;
}
}

}

if (st.isEmpty())
return true; /* balanced */
else { /* not balanced */
return false;
}
}

public static void main(String[] args) {
char exp[] = { '{', '(', ')', '}', '[', ']' };
if (areParenthesisBalanced(exp))
System.out.println("Balanced ");
else
System.out.println("Not Balanced ");
}

}