bhuvanachandu9
BAN USERimport java.util.Hashtable;
import java.util.Scanner;
public class SecondMost{
public static void main(String args[]){
Scanner in = new Scanner(System.in).useDelimiter("\n");
Hashtable<String , Integer> hash = new Hashtable<String,Integer>();
String k= in.next(),s;
Scanner sp = new Scanner(k).useDelimiter(" ");
while(sp.hasNext()){
s=sp.next();
if(!hash.containsKey(s))
hash.put(s,1);
else
hash.put(s,hash.get(s)+1);
}
//For Finding Second most String in Hash
String maxStr="",secondMaxStr="",temp;
int maxInt=0,secondMaxInt=0,value;
//for Finding First Max ----> O(n)
for(String key:hash.keySet()){
value=hash.get(key);
if(maxInt<value){
maxInt=value;
maxStr=key;
}
}
for(String key:hash.keySet()){
if(key.equals(maxStr))
continue;
value=hash.get(key);
if(secondMaxInt<value){
secondMaxInt=value;
secondMaxStr=key;
}
}
System.out.println(secondMaxStr);
}
}
import java.util.Scanner;
import java.util.Stack;
public class BalancedParanthesis{
public static void main(String args[]){
Stack<Integer> stack= new Stack<Integer>();
Scanner in= new Scanner(System.in);
StringBuilder str = new StringBuilder(in.next());
in.close();
int i,n=str.length();
for(i=0;i<n;i++){
if(str.charAt(i)=='(')
stack.push(i);
else if(str.charAt(i)==')'){
if(stack.isEmpty()){
str.deleteCharAt(i--);
n--;
}
else
stack.pop();
}
}
while(!stack.isEmpty())
{
str.deleteCharAt(stack.peek());
stack.pop();
}
System.out.println(str);
}
}
- bhuvanachandu9 July 08, 2017