1) I have 3 classes called Hospital and Doctor, and Patient as below
Class Hospital {
    String hospitalName;
    Doctor doc;
    Address hospitalAddress;
}
Doctor {
   int docId;
   String name;
   String specialization;
   
}
Address {
   String address1;
   String address2;
   String city;
   String state;
   int zipCode;
}

1)Write a program to identify the eliminate the duplicate hospital, if I enter same hospitalName and hospitalAddress ?
2)If user enters his zipcode, identify the hospital near by( use logic by subtracting user zip code with hospital zip code, for example: if user enter 20170 and your hosiptal zipcodes 20186 and 20184 then 20184 is the near one.)
3)If user enters his zipcode, and his illness, identify the hospital near by which supports specialization.
4)Store all hospitalDetails with key as hospitalName and value as HospitalObject. Same for Doctor and Address. If I enter hospital name then list out all the doctor details that are part of the hospital(you can have same hospital name with different location. its like having branches. Duplicate elimination is based on hospitalName and Address.)
5)If user request specialization availability then list out all hospital that have the doctor with those specialization.

2)Find Minimum element of Java ArrayList Example
3)Find Minimum element of Java HashSet Example
4)Reverse order of all elements of Java ArrayList Example
5)Check if a particular key exists in Java HashMap example
6)Check if a particular value exists in Java HashMap example
7)Get lowest and highest key stored in Java TreeMap example