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 | 456 Views, 30825 Search Bots | 120 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 456 Views, 30825 Search Bots | 120 Words
| 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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 456 Views, 30825 Search Bots | 120 Words 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]
Related Articles
- Daily Interview Problem: Buddy Strings
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Absolute Path
- [Daily Problem] Longest Palindromic Substring
- Spectrum Master
- Daily Interview Problem: Maximum Profit From Stocks
- Daily Interview Question: Create a Simple Calculator
- Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
- CVE-2015-8874 - cPanel EasyApache Vulnerabilities
- Algorithm Interview: Subarray With Target Sum
©2006~2024 SteakOverCooked - 0.0166 Seconds(s) - 1181.381 KB/s - 51 Online Memory: 492.01 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !