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 →

  • hariprasaadsoun1
    2 months ago+ 0 comments

    Javascript Solution using Recursion. Time complexity O(N). No Arrays

    function getNode(llist, positionFromTail) {
    
        let counter = 0;
        let flag = false;
        let res = null;
        function recur(llist,positionFromTail,flag){
            if(llist && !flag){
                recur(llist.next,positionFromTail,flag)
                counter += 1;
                if(counter == positionFromTail+1) {
                    res = llist.data;
                    flag = true;
                }
            } 
        }
        recur(llist,positionFromTail)
        return res;
    
    }
    
    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy