Object-Oriented Programming · Disney · Medium
Build a Set that stores integers. You may not write or invoke any hash function, and you may not rely on a built-in set or HashSet. The set must provide these operations: add(x): insert the integer x; if x is already present, leave the set unchanged. remove(x): delete the integer x; if x is not present, leave the set unchanged. contains(x): report whether x is currently in the set. size(): report how many elements the set currently holds. Store the elements in a linear…