getIntersectionofNode HW

[Amaan-29]

No description provided.

[super30admin]

1. Correctness: The solution does not solve the BST Iterator problem. It addresses a different problem (finding the intersection of two linked lists), which is not what was asked.
2. Time Complexity: Not applicable since the solution is for a different problem.
3. Space Complexity: Not applicable since the solution is for a different problem.
4. Code Quality: The code for the linked list intersection problem is well-structured and readable, but it is not relevant to the BST Iterator problem.
5. Efficiency: The linked list solution is efficient for its intended problem, but again, it does not address the BST Iterator problem.

Suggestions for Improvement:

• Carefully read and understand the problem statement before starting to code.
• Ensure that the solution matches the problem requirements.
• For the BST Iterator problem, consider using a stack to simulate in-order traversal, as shown in the reference solution.

[Amaan-29]

This solution/code is for ## Problem4 (https://leetcode.com/problems/intersection-of-two-linked-lists/), I havent uploaded BST iterator solution yet.
Can you please confirm.