[Feature]: Implement set

[opabhijeet]

Implement Set methods

• You have to implement set data structure without using any library ( not even iostream )
• You have to implement the functions mentioned in DSA_DOJO/Hard/Day1/Set.h
• You don't have to add any file and only need to modify DSA_DOJO/Hard/Day1/Set.h
• Set should be dynamic and should consist of Nodes
• Functions of the class should be defined outside the class
• You should handle all the exceptions that may occur
• You are free to add any other functionality
• You should not delete anything in DSA_DOJO/Hard/Day1/Set.h
• If your solution is found to be plagiarised heavy penalty would be imposed
• You would be given 8 working hours ( 2 Days ) to submit the solution

Functions that need to be implemented are:

• Set Union(Set &s) ---> return a set containing union of elements present in current set and s
• Set Intersection(Set &s) ---> return a set containing intersection of elements present in current set and s
• Set operator-(Set& s) ---> return the difference of two sets
• bool operator==(Set& s) ---> return true if both sets are equal and false otherwise
• void operator*(Set& s) ---> print the cartesian product of two sets
• T upper_bound(T num) ---> find upper bound of num in set
• T lower_bound(T num) ---> find lower bound of num in set

Code of Conduct

• I agree to follow this project's Code of Conduct

[codingmonk070]

@opabhijeet and @Roshu2003 Please assign me this issue in order to add required features

[Roshu2003]

@codingmonk070 Submit the solution by tomorrow

[sharvil-lade]

@Roshu2003 @opabhijeet please assign this task to me.