CareerCup

Write code to sum 2 integer but u cant use a+b method, you have to use either ++ or --. How you will handle negative numbers.

There is a two storey home. We have three switch on the first floor and three rooms on the second floor. You can go upstairs only once and can touch switches only one. How will you find out which switch is for what room?

Check if tree is BST.

We have a char array and we need to reverse it. say Char Array is “Northern California USA”, need to print “USA California Northern”. Can’t use any other data structures or buffer. Can only use a char temp.

Find the kth minimum element into binary search.

We have array of strings. Go through each element of array and eliminate duplicates if any string is having. You have to save in the same array.

What is the diffenrce between join() and wait()?
What is sleep(). Which method releases the lock?

How can we implement asynchronous call in Java? Say I want to query Google but don’t want to use all the urls want to use later. How can we do that?

Whats the difference between quick sort and merge sort? Which one to use? Do we need file sorted before merge sort?

How can we divide a large file between multi threads to process it? If we are running a multi threaded application and input is a large file and we have to provide each thread a part of the file to make it fast. How we can achieve it in java?

If we have all the variables and methods are as static. So would that class be thread safe?

There is a test automation running and fails 14%, say 1/7 times? How you will debug? There is no code change or test code change.

There are several words in a file. Get the occurrence of every word and sort it based on the occurrence, if more than one word is having same occurrence than sort it alphabetically.

We have one single linked list. How we’ll travers it that we reach till second last (n-1) node. If we want to reach till (n\2) node.

In a directory we have several big log files? How u’ll find it how many number of lines are there in file? Aggregated count for all the files. What is if multiple threads are using those files? How will u be assigning files to them? What if one file size is way bigger than others.

Design a system for elevator and write all the classes and interfaces and show the relationships in between them.

What is out in System.out.println(). How can we redirect System.out.println to file than showing on console? Say we have
System.out.println("Hello World!!"). We want "Hello World!!" written to file than showing on console.

Write code for tree traversal. If we have cyclic dependency in tree, say child is pointing to parent, how can we traverse it?

1. If we have 2 column in table, user id and date which user has logged in. How can we find the user id who has logged in most. means max number of time.

How does one application implement similar to DropBox? How can we Mmake sure they are in sync for files. How u’ll check for files are downloaded. How u’ll download files. What protocols u’ll use?

How can we get square of a number without using * or carrot sign.

Write a query which return 5 persons who had spent most from a table and table contains customer id, product id and expenses. Customer id can be duplicate.

There is 3 text file, like file1.txt, file2.txt etc. Every file contains customer id, product id and expenses. Now write java code which will return 5 persons who spent most in these three files. Customer id can be duplicate all over files.

How can we get the square of a number without using * or carrot sign.

Consider the following class definition:
class Node {
List<Node> children;
void addChild (Node child);
}

Assume you have a node object like above. This node object can contain a child node object. Assuming you are given one of these objects, write a function to determine the maximum path length from the root node to the most distant remote node. .

Consider the following class definition:
class Node {
List<Node> node;
void addChild (Node testNode);
}

Assume you have a node object like above. This node object can contain a child node object. Assuming you are given one of these objects, write a function to determine the maximum path length from the root node to the most distant remote node.
Its not exactly tree as it doesnt have any left and right information but it has nodes on both sides.