Completed Graph-1, 2 problems

[meetrpatels30]

No description provided.

[super30admin]

• Strengths:
  • Both solutions are correct and efficiently implemented.
  • The code is clean, well-commented, and easy to understand.
  • Time and space complexities are accurately analyzed and stated.
• Areas for Improvement:
  • In "the-maze", consider using a more efficient data structure for the queue (e.g., a linked list or a double-ended queue) to avoid the O(n) shift operation, which can be costly for large queues.
  • In "find-the-town-judge", the comment "check for n-1, to exclude judge" could be clarified to explain why n-1 is the threshold (since the judge must be trusted by everyone else and trust no one).