CareerCup

class FileCountWords {
public static void main(String[] args) throws Exception {
Scanner input = new Scanner(System.in);
System.out.println("Enter File name with path: ");
String filename = input.next();
File f = new File(filename);
BufferedReader br = new BufferedReader(new FileReader(f));
StringBuffer buffer = new StringBuffer();
String str;
while ((str = br.readLine()) != null) {
buffer.append(str);
buffer.append(" ");
}
ArrayList<String> list = new ArrayList<String>();
StringTokenizer st = new StringTokenizer(buffer.toString()
.toLowerCase());
while (st.hasMoreTokens()) {
String s = st.nextToken();
list.add(s);
}
while (!list.isEmpty()) {
int i = 0;
String uniqueStr = list.get(i);
int index = list.lastIndexOf(uniqueStr);
int uniqueStrCount = 1;
while (i != index) {
uniqueStrCount++;
list.remove(index);
index = list.lastIndexOf(uniqueStr);
}
System.out.println("count of word " + "-" + uniqueStr + "-"
+ " in the file is : " + uniqueStrCount);
list.remove(i);
i++;
}
}
}

output is :
Index:0 4
Index:1 1
Index:1 2
Index:3 5

This one works on (N^2)/2
public class SumInArr2 {
public static void findSumHashMap(int[] arr, int key) {
for(int i=0;i<=arr.length-2;i++){
for(int j=i+1;j<=arr.length-1;j++){
if (key-arr[i]==arr[j]){
System.out.println(arr[i]+ "index:"+i+" "+arr[j]+ "index:"+j);}}} }
public static void main(String[] args) {
int[] arr={32,40,28,37,4,12,2,51,23,50,20,56};
int sum = 60;
findSumHashMap(arr,sum); }}

I think using hashmap duplicates cannot be allowed. This works on log(n).When you add a duplicate it updates the value to later one. here is java code
public class SumInArr3 {
public static void findSumHashMap(int[] arr, int key) {
Map<Integer, Integer> valMap = new HashMap<Integer, Integer>();
for (int i = 0; i < arr.length; i++) {
valMap.put(arr[i], i); }
for (int i = 0; i < arr.length; i++) {
if (valMap.containsKey(key - arr[i])
&& valMap.get(key - arr[i]) != i) {
if (valMap.get(key - arr[i]) < i) {
int diff = key - arr[i];
System.out.println(arr[i] + " " + diff);}}}}
public static void main(String[] args) {
int[] arr = { 32, 40, 28, 37, 4, 12, 2, 51, 23, 50, 20, 56, 32,-50,110 };
int sum = 60;
findSumHashMap(arr, sum); }}

Referential integrity has been enforced here.

The below program in java returns 4. Actually it is not returning 4*4 here. It is returning 16 instead.
public class Sqare {
static int SQUARE1(int i){
return i*i; }
public static void main(String[] args) {
int s;
s = 64/SQUARE1(4);
System.out.println(s); }}

public class StringSplit {
public static void main(String[] args) {
String append = "I am Chandu";
String[] splits = append.split(" ");
append="";
System.out.println("splits.size: " + splits.length);
for(int i=0; i<splits.length;i++){
append=append+splits[i]+"abc";}
System.out.println(append); }}

Web services work on RESTful and SOAP protocols..

On SOAP you need to have a proxy set up. Your IDE's like Jdeveloper and Eclipse can create those proxies. The proxy will generate the API's that web services are exposing. You can have the proxy in any language like C# or JAVA or anything of your choice. Once you have the proxy set up you can test the web services using API level programming.

import java.lang.*;
public class ArraySort {
public static void main(String[] args) {
char[] ch1= {'A', 'B', 'A', 'C', 'A', 'B', 'B', 'C', 'A'};
char[] ch2= {'A', 'B', 'C'};
char[]ch3=new char[ch1.length];
int k=0;
for (int i=0;i<ch2.length;i++){
for(int j=0;j<ch1.length;j++){
if((Character.toUpperCase(ch2[i])==Character.toUpperCase(ch1[j]))){
ch3[k]=ch1[j];
k++;
}}}
System.out.println(ch3);}}

import java.util.*;
public class StringReverse{
public static void main(String[] args) {
String st1= "This is a new string and want it to be reversed";
char[] ch1= st1.toCharArray();
int length =ch1.length-1;
for(int i=length;i>=0;i--){
System.out.print(ch1[i]);
}}}

Hi Folks,
I have 80% of this working. If I have the base to the power of fraction, there there is problem. Else this program takes number of inputs mentioned in java.lang.math.pow doc..

import java.lang.Math;

public class PowClass {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
double a = 3;
int b =(int) 2;
System.out.println("computed value is: " + powFunc(a, b));
System.out.println(java.lang.Math.pow(a, b));
}
public static double powFunc(double a, int b) {
double value = 1;
if ((a == 0) && (b < 0)) {
value = Double.POSITIVE_INFINITY;
return value;
}
if (a == Double.POSITIVE_INFINITY && b == Double.POSITIVE_INFINITY) {
value = Double.POSITIVE_INFINITY;
return value;
}
if (a == 1 && b == Double.POSITIVE_INFINITY) {
value = Double.NaN;
return value;
}
if (a == 0)
return a;
if (b == 0)
return 1;
if ((a < 0) && (b % 1 != 0)) {
value = Double.NaN;
return value;
}
if (b % 1 != 0) {
double var = Math.round(b);
b=(int)(b-var);
while (var-- > 0)
value *= a;
a = a * b;
System.out.println(a);
value *= a;
return value;
} else if (b < 0) {
double negIndx = -b;
while (negIndx-- > 0)
value *= a;
return 1 / value;
} else {
while (b-- > 0)
value *= a;
return value;
}

}
}

public class PairNumber {
public int[] array =new int[]{0,1,2,3,4,5);
public void displayPairNumber(int value){
array ={0,1,2,3,4,5);
for (int i=0;i++;i<=value){
n=value;
if (i+n=value){

System.out.println(array(i)+,+array(n));
}
if (n==i){
break; } } }