CareerCup

Given a list of 4 billion integers, find an integer not in the list using 4MB of memory. (interview was in Java)

Make a JAVA program for an array of classes.
class should have 4 or 5 attribute and Array should contain 10 data which all have that 4 or 5 attribute of class. And Retrieve each attribute from all data. (Like Array of structure in C).

Make a Java/C program that takes n as input and gives you all sequence of n by using recurssion. For example if n=3, output will be:
111
112
113
121
.........
........
331
332
333.

What is polymorphism? what does it do?

There are 2 arraylists each consisting of 1 million records.
Give me the same objects present in both the lists.
The objects in the list can be any thing of our choice.

i have 2 class class employee which has empname and Title(manager,team lead) and class person which has name age and gender.. now i need to create a hasmap which has key and value pair as employee and person and if i give employee as key it should give me person values and if i give person as key it should give me employee value

How do you write a custom error handler in Java?

what happens when you re-throw an exception in Java?

What is SOAP? What is REST? What are the major differences between SOAP & REST?

You need to develop the game Snake. What data structures will you use? Code your solution.

As a member of the cab finder app team, you are tasked with implementing a CabFinder class that has the following minimal public interface:

class CabFinder implements CabStatusListener {
/**
* Initiates CabFinder. Called only once per app startup.
* @app An application object providing services implemented by
* the rest of the application.
* @maxCabs Nearest number of cabs that can be returned to the user
*/
public void initialize(CabApp app, int maxCabs) {
//Insert code here...
}

/**
* Gets nearest cabs within 1km of the current user’s location.
* These must be the *nearest possible* @maxCabs in the 1km area.
* @return An unordered list of the nearest cabs.
*/
public Cab[] getNearestCabs() {
//Insert code here...
}

/**
* Asynchronous Callback per CabStatusListener (see below). Called when the position of a cab has changed.
*/
void onCabPositionChanged(Cab cab) {
//Insert code here…
}

/**
* Asynchronous Callback per CabStatusListener (see below). Called when a cab’s availability changes.
* @cab The cab whose availability has changed
* @isAvailable true if the cab is now available, false otherwise
*/
void onCabAvailabilityChanged (Cab cab, boolean isAvailable) {
//Insert code here…
}
}


Supporting Classes:
Here are the classes and utilities that are available for your use (you are not required to write any implementation for these classes)
/**
* Coordinates on a 2D map with a one meter granularity.
*/
class Position {
public int x;
public int y;
}

interface Cab {
/**
* Unique identifier of a cab.
*/
int getID();

/**
* Gets the current position of the cab
*/
Position getCabPosition();

/**
* Returns whether or not the cab is available
*/
boolean isAvailable();
}

/**
* Provides services implemented by the rest of the Cab Application.
*/
interface CabApp {
/**
* Gets the current location of the user
*/
Position getUserPosition();

/**
* Returns an iterator that gives access to the list of all cabs in the city
*/
Iterator<Cab> getCabs();

/**
* Registers a CabStatusListener object for change notifications of cab object data.
*/
void register(CabStatusListener listener);
}

/**
* The CabStatusListener interface
*/
interface CabStatusListener {
/**
* Called when the position of a cab has changed.
* @cab The cab object
*/
void onCabPositionChanged(Cab cab);

/**
* Called when a cab’s availability changes.
* @cab The cab object
* @isAvailable true if the cab is available, false otherwise
*
*/
void onCabAvailabilityChanged (Cab cab, boolean isAvailable);
}

A String is given ilke--abdecadc...szx..any thing..like this...element in this given pattern can be any this(like int also and letter till z also)
you have to arrange in pattern--aabbcclike....ie.same charactor together...

Implement data structure for garbage collector in java

We have a fictitious multi-level marketing scheme where a member can recruit one or more other members. At the end of the month, member’s payout is calculated at 10% of his direct sales (items the members sells
themselves) and 4% of sales generated by his recruits and their recruits.
Write a function that calculates the monthly compensation for all members given the original member. You can assume a member can only be recruited by a single existing member.

Given the following interface, please implement the MemberPayoutUtil.calculatePayout function.

public interface Member {
    public double getMonthlySales();
    private Collection<Member> getRecruitedMembers(); }
 

public class MemberPayoutUtil {
    public static double calculatePayout(Member member) {
        // Implement me!
    }
}

you have the string ={ aabb, aafd,acff,aacg,.....} , if i am writing a as first char or first two char or first three char and so on, it should show the all unique combination of words started with the that characters for eg. say if iam writing aa then it show that aabb or aafd

i have tried using hashmap is it increase my complexity or should i have to use list

what is green thread in java..??

Given a list of ranges as input ((1,2),(3,4),(3,6),(8,10)),the output would be those ranges that don't overlap.For example, the output could be merging the ranges 1) (1,2),(3,4)
2) (1,2) (3,6) etc

The output cannot contain (3,4),(3,6) as 3 is common to both

Write an interface for HashMap.

quicksort using divide and counquer . Need code please java

Using a Java data structure, eliminate all unnecessary/stop words from a string. Assume you are given the string
"To be or not to be - that is the question: Whether it is nobler in the mind to suffer, the slings and arrows of outrageous fortune. Or to take up arms against a sea of troubles, and by opposing end them"
The unnecessary words to remove are "a", "be", "to", "the", "that", "this", "or"
So the resulting string should be like this
"not - is question: Whether it is nobler in mind suffer…

when we have to override equals and hashcode in java..?
what will happened if you dont override .. Explain with program.

why strings are immutable ?
how many objects will be created in
String temp = "A" + "B" + "C" ;
explain your answer in detail.

C={1,2,2,3,4,5}
Sum=5

subset;
{1,2,2}
{1,4}
{2,3}
using exhaustive force in java

ideas

how do we compare two objects in java.

I am capturing the voice as buffer at client side and sending that buffer to server using Socket programming, then at server side I receive it and play using SourceDataLine , and its properly running on LAN but when I deploy it to Remote Server the voice carry noise data.
tell me the solution.

which are wrong statements in this code?

interface TestInterface{

void myMethod();

abstract void myMethod2();

private void myMethod3();

}

Difference in SOAP and IIOP?

What is externalizable interface?

java code to calculate size of String without using any length or size method?

String input = "abcde ";
int output = 5;

Write code in java to move char to next position with minimum space requirement?

String input = "abcde";

String output = "eabcd";