Sort by

recency

|

1209 Discussions

|

  • + 0 comments

    I also face this problem with my mod editor website. Do not read any input from stdin/console is what the instructions indicate, yet the code editor says the exact opposite.

  • + 0 comments

    Python Code

    def findMergeNode(head1, head2):
        l1, l2 = head1, head2
        dummy = {}
        while l1:
            dummy[id(l1)] = l1.data
            l1=l1.next
        while l2:
            if id(l2) in dummy:
                return dummy[id(l2)]
            else:
                l2=l2.next
    
  • + 0 comments

    The given classes for C# do not compile. I hope they fix this.

    It would be nice to have sample input and output.

  • + 0 comments

    The instructions say "Do not read any input from stdin/console" but the code editor literally says the opposite.

  • + 0 comments

    Given pointers to the head nodes of linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share a common node, return that node's value.

    Note: After the merge point, both lists will share the same node pointers.

    Example

    In the diagram below, the two lists converge at Node x:

    [List #1] a--->b--->c \ x--->y--->z--->NULL / [List #2] p--->q Function Description

    Complete the findMergeNode function in the editor below.

    findMergeNode has the following parameters:

    SinglyLinkedListNode pointer head1: a reference to the head of the first list SinglyLinkedListNode pointer head2: a reference to the head of the second list Returns

    int: the value of the node where the lists merge Input Format

    Do not read any input from stdin/console.

    The first line contains an integer , the number of test cases.

    Each of the test cases is in the following format: The first line contains an integer, , the node number where the merge will occur. The next line contains an integer, that is the number of nodes in the first list. Each of the following lines contains a value for a node. The next line contains an integer, that is the number of nodes in the second list. Each of the following lines contains a value for a node.

    Constraints

    The lists will merge. . .