To the Top
File:  root - text - article - 2019 - 11 - Remove-k-th-Last-Element-From-Linked-List.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 477 Views, 32170 Search Bots | 120 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by AirBNB:

You are given a singly linked list and an integer k. Return the linked list, removing the k-th last element from the list.

Try to do it in a single pass and using constant space.

Here's a starting point:


class Node:
def __init__(self, val, next=None):
self.val = val
self.next = next
def __str__(self):
current_node = self
result = []
while current_node:
result.append(current_node.val)
current_node = current_node.next
return str(result)

def remove_kth_from_linked_list(head, k):
# Fill this in

head = Node(1, Node(2, Node(3, Node(4, Node(5)))))
print(head)
# [1, 2, 3, 4, 5]
head = remove_kth_from_linked_list(head, 3)
print(head)
# [1, 2, 4, 5]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 477 Views, 32170 Search Bots | 120 Words Subscribe to Feed Burner

Related Articles

  1. Reverse a Directed Graph
  2. Two-Sum
  3. Daily Interview Question: Create a Simple Calculator
  4. Floor and Ceiling of a Binary Search Tree
  5. Daily Interview Problem: Min Range Needed to Sort
  6. Daily Interview Problem: Sort Colors
  7. Most Frequent Subtree Sum
  8. Daily Interview Question: Find Cycles in a Graph
  9. Number of Ways to Climb Stairs
  10. Algorithm Interview: Determine If Linked List is Palindrome

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">