File: root - text - article - 2019 - 11 - Remove-Consecutive-Nodes-that-Sum-to-0.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 229 Views, 22225 Search Bots | 146 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 229 Views, 22225 Search Bots | 146 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Uber:
Given a linked list of integers, remove all consecutive nodes that sum up to 0.
Example:
Input: 10 -> 5 -> -3 -> -3 -> 1 -> 4 -> -4
Output: 10
The consecutive nodes 5 -> -3 -> -3 -> 1 sums up to 0 so that sequence should be removed. 4 -> -4 also sums up to 0 too so that sequence should also be removed.
Here's a starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 229 Views, 22225 Search Bots | 146 Words Given a linked list of integers, remove all consecutive nodes that sum up to 0.
Example:
Input: 10 -> 5 -> -3 -> -3 -> 1 -> 4 -> -4
Output: 10
The consecutive nodes 5 -> -3 -> -3 -> 1 sums up to 0 so that sequence should be removed. 4 -> -4 also sums up to 0 too so that sequence should also be removed.
Here's a starting point:
class Node:
def __init__(self, value, next=None):
self.value = value
self.next = next
def removeConsecutiveSumTo0(node):
# Fill this in.
node = Node(10)
node.next = Node(5)
node.next.next = Node(-3)
node.next.next.next = Node(-3)
node.next.next.next.next = Node(1)
node.next.next.next.next.next = Node(4)
node.next.next.next.next.next.next = Node(-4)
node = removeConsecutiveSumTo0(node)
while node:
print node.value,
node = node.next
# 10
Related Articles
- [Daily Problem] Longest Palindromic Substring
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- Daily Interview Problem: Contiguous Subarray with Maximum Sum
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- [Daily Problem] Angles of a Clock
- Daily Interview Problem: Deepest Node in a Binary Tree
- First and Last Indices of an Element in a Sorted Array
- Print a tree level-by-level, with line-breaks
- Patterns for breaking down questions you haven
- Daily Interview Question: Find Cycles in a Graph
©2006~2024 SteakOverCooked - 0.01598 Seconds(s) - 1283.835 KB/s - 23 Online Memory: 494.38 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="index, 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 !