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
  • Apply
  • Hiring developers?
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Delete a Node
  5. Discussions

Delete a Node

Problem
Submissions
Leaderboard
Discussions
Editorial

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

  • iscodand
    4 months ago+ 0 comments

    simple and descritive python solution

    def deleteNode(llist: SinglyLinkedListNode, position: int):
        if llist == None:
            return
        
        if position == 0:
            return llist.next
            
        position_counter: int = 0
        current: SinglyLinkedListNode = llist
        
        while current != None and position_counter < position - 1:
            position_counter += 1
            current = current.next
    
        current.next = current.next.next
        return llist
    
    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy