Easy learning with example program codes

how to search a key in hashmap in java?


HashMap extends AbstractMap class and implements the Map interface. It contains the elements in key-value pair form. It not maintains any order for its elements. It not allowed duplicate key. A HashMap can have only one null key and multiple null values.

We can use containsKey() method to search a key in hashmap in java.

containsKey(Object k): Returns true if this map contains specified key otherwise returns false.
Syntax: public boolean containsKey(Object k)


package com.codesjava;
import java.util.HashMap;
public class Test {
  public static void main(String args[]){
	//Create HashMap object.
	HashMap<Integer, String> hashMap = new HashMap<Integer, String>();
	//Add objects to the HashSet.
	hashMap.put(4, "Roxy");
	hashMap.put(2, "Sunil");
	hashMap.put(5, "Sandy");
	hashMap.put(1, "Munish");
	hashMap.put(3, "Pardeep");
	//Print the HashMap object.
	System.out.println("HashMap elements:");
            System.out.println("Hashmap contains key 4");
        } else {
            System.out.println("Hashmap does not contains key 4");


HashMap elements:
{1=Munish, 2=Sunil, 3=Pardeep, 4=Roxy, 5=Sandy}
Hashmap contains key 4
Sign Up/ Sign In
Ask a Question

Copyright © 2018 CodesJava Protection Status SiteMap Reference: Java Wiki