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

  • ihorfinance
     + 0 comments

    C++ (more at https: //github.com /IhorVodko/Hackerrank_solutions , feel free to give a star :) )

    int findMergeNode(
        SinglyLinkedListNode * _head1
    ,   SinglyLinkedListNode * _head2
){
    auto node1 = _head1;
    auto node2 = _head2;
    while(node1 != node2){
        node1 = node1->next ? node1->next : _head1;
        node2 = node2->next ? node2->next : _head2;
    }
    return node1->data;
}