CareerCup

public class MyHashMap<K,T> {
	static class Pair<K,T>{
		K key;
		T value;
		Pair(K k,T v){
			key = k;
			value = v;
		}
	}
	int size=10;
	LinkedList buckets[]=new LinkedList[size];
	int hash(K key){
		return key.hashCode()%size;
	}
	void put(K key,T value){
		int index=hash(key);
		if(buckets[index]==null){
			buckets[index]=new LinkedList();
		}
		for(Object p:buckets[index]){
			Pair<K,T> pair=(Pair<K,T>)p;
			if(pair.key.equals(key)){
				pair.value=value;
				return;
			}
		}
		buckets[index].add(new Pair(key,value));
	}
	T get(K key){
		int index=hash(key);
		if(buckets[index]==null) return null;
		for(Object p:buckets[index]){
			Pair<K,T> pair=(Pair<K,T>)p;
			if(pair.key.equals(key))
				return pair.value;
		}
		return null;
	}
	

}

Thanks for solution Charlie. Here is code with test data:

public class MyHashMap<K, T> {

	public static void main(String[] args) {
		MyHashMap<String, String> map = new MyHashMap<String, String>();
		map.put("CA", "California");
		map.put("TX", "Texas");
		map.put("TX", "Texas1");
		map.put("TX", "Texas2");
		map.put("GA", "Georgia");
		String s = map.get("CA");
		System.out.println(map.get("CA"));
		System.out.println(map.get("TX"));
		System.out.println(map.get("GA"));

	}

	static class Pair<K, T> {
		K key;
		T value;

		Pair(K k, T v) {
			key = k;
			value = v;
		}
	}

	int size = 10;
	LinkedList buckets[] = new LinkedList[size];

	int hash(K key) {
		return key.hashCode() % size;
	}

	void put(K key, T value) {
		int index = hash(key);
		if (buckets[index] == null) {
			buckets[index] = new LinkedList();
		}
		for (Object p : buckets[index]) {
			Pair<K, T> pair = (Pair<K, T>) p;
			if (pair.key.equals(key)) {
				pair.value = value;
				return;
			}
		}
		buckets[index].add(new Pair(key, value));
	}

	T get(K key) {
		int index = hash(key);
		if (buckets[index] == null)
			return null;
		for (Object p : buckets[index]) {
			Pair<K, T> pair = (Pair<K, T>) p;
			if (pair.key.equals(key))
				return pair.value;
		}
		return null;
	}

}

Map

My pet dog is called hashmap.

Interface IHashMap {
    void eat(IFood chow);
    void bark(ISound bark);
    Stitches[] bite(ITime duration);
   void goRabid(ITime duration);
   void heel(ITime duration);
   void stay(ITime duration);
   void fetch(IFetchable f, IDistance how_far);
}