We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Find Merge Point of Two Lists
  5. Discussions

Find Merge Point of Two Lists

  • muhammadnabilas2
     + 0 comments

    The Constraint LIES:

    head1 != head2

    that is a lie. i fixed my code by allowing search for head it answered correctly.

    c++ solution:

    int findMergeNode(SinglyLinkedListNode* head1, SinglyLinkedListNode* head2) {
    auto first = head1;
    auto second = head2;
    while (first != second) {
        first = (first->next) ? first->next : head2;
        second = (second->next) ? second->next : head1;
    }
    // no merge, should never happend
    if (first == nullptr)
        throw -1;
    return first->data;
}