Solve Problem1 and Problem2

[sarvesh-gaurishankar-sawant]

No description provided.

[super30admin]

• Strengths:
  • The student demonstrates a clear understanding of BFS and topological sort algorithms.
  • The code is well-commented, making it easy to follow the logic.
  • The solutions handle edge cases effectively (e.g., null root in Problem1 and no independent courses in Problem2).
• Areas for Improvement:
  • In Problem1, the result list is declared as a class variable, which is unnecessary. It could be declared within the levelOrder method to avoid potential issues with state retention.
  • In Problem2, the initial check for count == numCourses could be moved after the loop that enqueues independent courses to avoid redundancy.
  • The variable name indegress in Problem2 should be corrected to indegrees for better readability.