CODE EXAMPLE FOR JAVA

set java time complexity

 For HashSet, LinkedHashSet, and EnumSet the add(), remove() and contains() operations cost constant O(1) time. Thanks to the internal HashMap implementation.