Implement hash Set and min stack

[paridhimalviya]

No description provided.

[super30admin]

1. Correctness: The ImplementSet.swift file shows a reasonable approach to implementing a hash set with double hashing, but without the problem description, it's hard to verify complete correctness.
2. Time Complexity: The operations appear to be O(1) as expected for a hash set implementation.
3. Space Complexity: The space usage seems appropriate for the implementation.
4. Code Quality: The code is generally well-structured and readable, with clear method names and comments.
5. Efficiency: The implementation seems efficient, though without the problem constraints, it's hard to suggest optimizations.

Areas for improvement:

• Please ensure you're solving the correct problem and submitting only relevant files.
• Include proper problem descriptions when submitting solutions.
• The .DS_Store file should not be included in submissions.
• The LinkedListToStackAdapter.swift and MinStack.swift files appear to be solutions for different problems.

[super30admin]

• The student needs to ensure they are solving the correct problem. The problem requires implementing a HashSet, but the submitted files contain implementations of a stack and min stack.
• The student should carefully read the problem statement and ensure their solution matches the requirements.
• The code quality for the stack and min stack implementations is good, with clear methods and comments. However, this does not help in solving the HashSet problem.
• The student should remove unrelated files (like .DS_Store) from their submission to avoid confusion.