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.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Get Node Value
  5. Discussions

Get Node Value

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • mohamedhazemwwe
    2 months ago+ 0 comments

    here's my C++ solution. If we can get the length of the linked list, we can get that position form the head. Why? Because I'm initially given the head pointer so I just have to count certain number from that head.

    int getNode(SinglyLinkedListNode* llist, int positionFromTail)
    {
        int LSize = 0;
        SinglyLinkedListNode* counter = llist;
        while(counter)
        {
            ++LSize;
            counter = counter->next;
        }
        int positionFromHead = LSize - positionFromTail;
        while (positionFromHead-- > 1)
        {
            llist = llist->next;
        }
        return llist->data;
    }
    
    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy