completed hashing-1

[anjanaouseph]

Already submitted these as part of competitive-coding-1 accidentally, re-submitting in this repo.

[super30admin]

• Strengths:

  • The student demonstrates a strong understanding of hash map usage and bijective mappings.
  • The solutions are well-commented and easy to follow.
  • The student correctly analyzes time and space complexities.

• Areas for Improvement:

  • In problem14.py, the space complexity analysis could be more concise. The student mentions "O(nK + n + nk)" which is redundant; simply stating O(N*K) would suffice.
  • The student could consider using defaultdict from the collections module in Python to simplify the hash map initialization in problem14.py.