Amazon Coding Question – Solved

Question

Delete Even

Given a linked list of integers, return a linked list containing only nodes having odd integers in their node->data field.

Example
n=3

listHead=1->4->7

The linked list containing only nodes having odd integers is 1 -> 7.

Function Description
Complete the function deleteEven in the editor below.

deleteEven has the following parameter(s):
list listHead: a reference to the

TreasuresBase Expert · Accepted Answer

import math
import os
import random
import re
import sys

class SinglyLinkedListNode:
    def __init__(self, node_data):
        self.data = node_data
        self.next = None

class SinglyLinkedList:
    def __init__(self):
        self.head = None
        self.tail = None

    def insert_node(self, node_data):
        node = SinglyLinkedListNode(node_data)

        if not self.head:
            self.head = node
        else:
            self.tail.next = node

        self.tail = node

def print_singly_linked_list(node, sep, fptr):
    while node:
        fptr.write(str(node.data))

        node = node.next

        if node:
            fptr.write(sep)



#
# Complete the 'deleteEven' function below.
#
# The function is expected to return an INTEGER_SINGLY_LINKED_LIST.
# The function accepts INTEGER_SINGLY_LINKED_LIST listHead as parameter.
#

#
# For your reference:
#
# SinglyLinkedListNode:
#     int data
#     SinglyLinkedListNode next
#
#

def deleteEven(listHead):
    # Write your code here
    temp = []
    current = listHead
    while current != None:
        if current.data%2:
            temp.append(current.data)
        current = current.next
    first = SinglyLinkedListNode(1)
    s = first
    for j in temp:
        t = SinglyLinkedListNode(j)
        first.next = t
        first = t
    return s.next
    listHead = s.next

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    listHead_count = int(input().strip())

    listHead = SinglyLinkedList()

    for _ in range(listHead_count):
        listHead_item = int(input().strip())
        listHead.insert_node(listHead_item)

    result = deleteEven(listHead.head)

    print_singly_linked_list(result, '
', fptr)
    fptr.write('
')

    fptr.close()

Amazon Coding Question – Solved

Image of the Question

All Testcases Passed ✔

Solution

🔒 Please login to view the solution

Explanation

Related Questions