karpagaganesh
BAN USERpublic class phonebookDictionary {
public static void main(String[] args) {
Hashtable<String,Integer> phonebook = new Hashtable<String,Integer>();
String value,userIp,key;
phonebook.put("Rihana",233222232);
phonebook.put("Ricky", 134242444);
phonebook.put("Peter",224323423);
phonebook.put("Ron", 988232323);
System.out.println("Enter char to be searched:");
Scanner input = new Scanner(System.in);
userIp = input.next();
Set s = phonebook.entrySet();
Iterator it = s.iterator();
boolean flag = true;
while(it.hasNext()){
Map.Entry me = (Map.Entry)it.next();
key = (String)me.getKey();
for(int i =0;i<userIp.length();i++){
flag = true;
if(userIp.charAt(i) != key.charAt(i)){
flag = false;
}
}
if(flag){
System.out.println(key);
System.out.println(me.getValue());
}
}
}
}
public class findMissingElementV1 {
public static void main(String args[]) {
int[] a ={1,2,3,6};
int mainSum=0,i=0,sum=0;
for(i=0;i<7;i++){
mainSum += i;
}
for(i=0;i<a.length;i++){
sum =sum+ a[i];
}
int missingelement = mainSum-sum;
System.out.println(missingelement);
if(missingelement < 6){
System.out.println("Missing Element" +missingelement);
}
else{
int x=0,y=0,missProd=0;
mainSum =1;sum =1;
for(i=1;i<7;i++){
mainSum *= i;
}
for(i=1;i<a.length;i++){
sum =sum * a[i];
}
missProd = mainSum/sum;
System.out.println(missProd);
x = (int) (missingelement + Math.sqrt((missingelement*missingelement)-4*missProd));
x = x/2;
y = missingelement - x;
System.out.println("Missing Element "+x);
System.out.println("Missing Element "+y);
}
}
}
public class removeComma {
public static void main(String args[]){
String arr = "1,234,34,54";
StringBuffer a = new StringBuffer();
for(int i =0;i<arr.length();i++)
if(arr.charAt(i) != ',')
a.append(arr.charAt(i));
System.out.println(a.toString());
}
}
public class pairofPoints {
public static void main(String[] args) {
int[] pair1 = {1,1};
int[] pair2 = {3,3};
float x=0,y=0;
x = ((float)pair1[0] + (float)pair2[0])/2;
y = ((float)pair1[1] + (float)pair2[1])/2;
if((Math.floor(x) == Math.ceil(x)) && (Math.floor(y) == Math.ceil(y))){
System.out.println("Have Integer Mid Point");
}
else
System.out.println("Dont Have Integer Mid Point");
}
}
public class player {
public static void main(String args[]){
int[] player = {1,2,1,2,1,2,1,2};int i=0;
ArrayList<Integer> player1 = new ArrayList<Integer>();
ArrayList<Integer> player2 = new ArrayList<Integer>();
for( i =0;i<player.length;i++){
if(player[i] == 1)
player1.add(1);
if(player[i] == 2)
player2.add(2);
}
for( i=0;i<player1.size();i++)
player[i] = player1.get(i);
for(int j=0;j<player2.size();j++){
player[i] = player2.get(j);
i++;
}
for( i =0;i<player.length;i++)
System.out.println(player[i]);
}
}
public class pairofNum {
public static void main(String args[]){
int i =0,j=0,sum=0,temp =0;
int[] arr = {9,6,-3,1,7};
int[] pair = new int[2];
boolean flag = false;
for(i=0;i<arr.length-1;i++){
temp = 0;
for(j=i+1;j<arr.length;j++){
temp = arr[i]+arr[j];
if(temp == 4){
pair[0] = arr[i];
pair[1] = arr[j];
flag = true;
}
}
if(flag)
break;
}
System.out.println(pair[0]+" "+pair[1]);
}
}
public class CommonElements {
public static void main(String[] args) {
HashMap<Integer,Integer> table = new HashMap<Integer,Integer>();
int[] a1 = {1,2,3,4,5};
int[] a2 = {2,3,5,1,9};
int[] a3 = {3,4,1,2,5};
int[] a4 = {9,7,6,7,3};
int[] a5 = {3,2,1,5,8};
int i =0;
for (i=0;i<a1.length;i++)
table.put(a1[i],1);
for (i=0;i<a2.length;i++)
if(table.get(a2[i]) != null)
table.put(a2[i],(table.get(a2[i])+1));
for (i=0;i<a3.length;i++)
if(table.get(a3[i]) != null)
table.put(a3[i],(table.get(a3[i])+1));
for (i=0;i<a4.length;i++)
if(table.get(a4[i]) != null)
table.put(a4[i],(table.get(a4[i])+1));
for (i=0;i<a5.length;i++)
if(table.get(a5[i]) != null)
table.put(a5[i],(table.get(a5[i])+1));
Set set = table.entrySet();
Iterator ii = set.iterator();
while(ii.hasNext()){
Map.Entry me = (Map.Entry)ii.next();
int key = (Integer) me.getKey();
int value = (Integer)me.getValue();
if(value == 5){
System.out.println("Number : "+key);
}
}
}
}
public class sieveoferatosthenes {
public static void main(String args[]){
ArrayList<Integer> omit = new ArrayList<Integer>();
for(int i = 2; i < 125;i++){
if(!omit.contains(i)){
System.out.println(i);
}
for(int j = i; j<125;j++){
if(j%i == 0)
omit.add(j);
}
}
}
}
public class lexicographicOrdering {
public static void main(String[] args) {
int N = 25, i =0 , j =0;
for(i=1;i<=(N/10);i++){
System.out.println(i);
for(j=10*i;(j<(10*(i+1)))&&j<=N;j++){
System.out.println(j);
}
}
}
}
public class maximumProblem {
public static void main(String args[]){
int[] ip ={5, 9, 6, 2, 4, 8, 3, 1};
int[] iparr = new int[ip.length-1];
int max = 0, left = 0,right = 0,sum=0,i,j = 0;
for(i = 0;i<ip.length-1;i++){
iparr[i] = ip[i+1] - ip[i];
}
System.out.println(" ");
for(i =0;i<iparr.length;i++){
for(j = i;j<iparr.length;j++){
sum = sum +iparr[j];
if(sum > max){
max = sum;
left = i+1;
right = j+1;
}
}
sum = 0;
}
System.out.println("Profit is :"+max+"\nFrom Day: "+left+ " To Day: " +right);
}
}
public class findFirstNonDuplicate {
public static void main(String[] args) {
String s ="aabbcdccefff";
char x = 0;int i;boolean flag = true;
for( i = 0;i<s.length();i++){
x = s.charAt(i);
for(int j =0;j<s.length();j++){
if(i!= j && x == s.charAt(j)){
flag = false;
continue;
}
}
if(flag == true){
System.out.println("First Non Duplicate Occurence: "+x);
break;
}
flag = true;
}
}
}
public class minInStack {
int[] stack = new int[20];
int top = -1;
public void push(int element){
top++;
stack[top] = element;
}
public int pop (){
return stack[top--];
}
public static void main(String[] args) {
minInStack obj = new minInStack();
int[] ip = {10,2,4,5,6,7,8,9}; // Sample input to stack
int i=0,min = 0,pop;
for ( ; i< ip.length;i++){
obj.push(ip[i]);
}
min = obj.pop();
for (i = 1;i<ip.length-1;i++){
pop = obj.pop();
if(pop < min)
min = pop;
}
System.out.println("Minimum Element in Stack: "+min);
}
}
1) Select a fruit from Mixed basket 'M'
2) if (fruit == Apple(A))
then
change basket Mixed(M) to Apple(A)
change basket Apple(A) to Orange(O)
change basket Orange(O) to Mixed(M)
end
else
then
change basket Mixed(M) to Orange(O)
change basket Orange(O) to Apple(A)
change basket Apple(A) to Mixed(M)
end
end
public class findMissingElement {
public static void main(String args[]){
// For sample input 0,5,2,3,1,4,6,10,8,9 where N is 10
int[] iparr = {0,5,2,3,1,4,6,10,8,9};
int sum = 0,s=0,max =0;
for (int i =0;i<iparr.length;i++)
if (iparr[i] >max)
max = iparr[i];
for (int i =0;i<=max;i++)
sum = sum + i;
for (int i =0;i<iparr.length;i++)
s = s + iparr[i];
System.out.println("Missing Element "+(sum-s));
}
public class longestrunstring {
public static void main(String args[]){
String a = args[0];
int max = 0;
char longest = ' ';
int count = 1;
if(a.length() >0){
for(int i = 1; i < a.length() - 1;i++){
if(a.charAt(i) == a.charAt(i+1)){
count++;
}
else {
if(count+1 > max){
max = count+1;
longest = a.charAt(i);
}
count = 0;
}
}
if(count+1 > max){
max = count+1;
longest = a.charAt(a.length()-1);
}
if(max == 0){
max = count+1;
longest = a.charAt(0);
}
}
for (int i = 0;i< max;i++)
System.out.print(longest);
}
}
public class longestrepeatingstring {
public static void main(String args[]){
String a = args[0];
int max = 0;
char longest = ' ';
int count = 1;
if(a.length() >0){
for(int i = 1; i < a.length() - 1;i++){
if(a.charAt(i) == a.charAt(i+1)){
count++;
}
else {
if(count+1 > max){
max = count+1;
longest = a.charAt(i);
}
count = 0;
}
}
if(count+1 > max){
max = count+1;
longest = a.charAt(a.length()-1);
}
if(max == 0){
max = count+1;
longest = a.charAt(0);
}
}
System.out.println(max);
System.out.println(longest);
}
}
- karpagaganesh March 08, 2014