Buggy python submission (verdict: Time Limit Exceeded):
import sys

class Node:
	def __init__(self, value):
		self.value = value
		self.prev = None
		self.next = None

class DoublyLinkedList:
	def __init__(self):
		self.head = None
		self.tail = None
		self.size = 0
	
	def get_size(self):
		return self.size
	
	def is_empty(self):
		return self.size == 0
	
	def appendToHead(self, value):
		node = Node(value)
		if self.head == None and self.tail == None:
			self.head = self.tail = node
		else:
			node.next = self.head
			self.head.prev = node
			self.head = node
		self.size += 1
	
	def removeFirst(self):
		if self.is_empty(): return
		if self.size == 1:
			self.head = self.tail = None
		else:
			next = self.head.next
			next.prev = None
			self.head = next
			if next.next == None:
				self.tail = next
		self.size -= 1		
		
	def removeLast(self):
		if self.is_empty(): return 
		if self.size == 1:
			self.head = self.tail = None
		else:
			prev = self.tail.prev
			prev.next = None
			self.tail = prev
			if prev.prev == None:
				self.head = prev
		self.size -= 1

	def remove(self, value):
		if self.is_empty(): return
		if self.head.value == value:
			self.removeFirst()
		else:
			node = self.head.next
			while node != None:
				if node.value == value:
					prev = node.prev
					next = node.next
					prev.next = next
					if next != None:
						next.prev = prev
					else:
						self.tail = prev
					self.size -= 1
					break
				else:
					node = node.next
		
	def print(self):
			node = self.head
			while node != None:
				sys.stdout.write(str(node.value))
				node = node.next
				if node != None:
					sys.stdout.write(' ')
			print()
	
n = int(input())
dll = DoublyLinkedList()
for i in range(n):
	cmd = str(input())
	if cmd == 'deleteFirst':
		dll.removeFirst()
	elif cmd == 'deleteLast':
		dll.removeLast()
	else:
		cmd, value = cmd.split()
		if cmd == 'insert':
			dll.appendToHead(int(value))
		elif cmd == 'delete':
			dll.remove(int(value))
		else:
			print('Unknown command:' + cmd)
	
dll.print()


Fixed submission:
class Node(object):
    def __init__(self, num, prv = None, nxt = None):
        self.num = num
        self.prv = prv
        self.nxt = nxt
 
 
class DoublyLinkedList(object):
    def __init__(self):
        self.start = self.last = None
 
    def insert(self, num):
        new_elem = Node(num)
 
        if self.start is None:
            self.start = self.last = new_elem
        else:
            new_elem.nxt = self.start
            self.start.prv = new_elem
            self.start = new_elem
 
    def delete_num(self, target):
        it = self.start
        while it is not None:
            if it.num == target:
                if it.prv is None and it.nxt is None:
                    self.start = self.last = None
                else:
                    if it.prv is not None:
                        it.prv.nxt = it.nxt
                    else:
                        self.start = self.start.nxt
 
                    if it.nxt is not None:
                        it.nxt.prv = it.prv
                    else:
                        self.last = self.last.prv
                break
            it = it.nxt
 
    def delete_start(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.start.nxt.prv = None
            self.start = self.start.nxt
 
    def delete_last(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.last.prv.nxt = None
            self.last = self.last.prv
 
    def get_content(self):
        ret = []
        it = self.start
 
        while it is not None:
            ret.append(it.num)
            it = it.nxt
 
        return ' '.join(ret)
 
 
def _main():
    from sys import stdin
 
    n = int(input())
 
    lst = DoublyLinkedList()
     
    for _ in range(n):
        cmd = stdin.readline().strip().split()
        if cmd[0] == 'insert':
            lst.insert(cmd[1])
        elif cmd[0] == 'delete':
            lst.delete_num(cmd[1])
        elif cmd[0] == 'deleteFirst':
            lst.delete_start()
        elif cmd[0] == 'deleteLast':
            lst.delete_last()
 
    print(lst.get_content())
 
 
if __name__ == '__main__':
    _main()

Buggy python submission (verdict: Runtime Error):
import java.util.Iterator;
import java.util.Scanner;
import java.util.LinkedList;

public class Main {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		LinkedList<Integer> list = new LinkedList<Integer>();
		for (int i = 0; i < n; i++) {
			String command = sc.next();
			if (command.equals("insert") || command.equals("delete")) {
				Integer value = sc.nextInt();
				if (command.equals("insert")) {
					list.addFirst(value);
				} else {
					list.remove(value);
				}
			} else if (command.equals("deleteFirst")) {
				list.removeFirst();
			} else if (command.equals("deleteLast")) {
				list.removeLast();
			} else {
				System.out.println("Unknown command:" + command);
			}
		}
		sc.close();	
		Iterator<Integer> itr = list.iterator();
		while (itr.hasNext()) {
			Integer value = itr.next();
			System.out.print(value);
			if (itr.hasNext()) {
				System.out.print(" ");
			}
		}
		System.out.println("");
	}	
}


Fixed submission:
class Node(object):
    def __init__(self, num, prv = None, nxt = None):
        self.num = num
        self.prv = prv
        self.nxt = nxt
 
 
class DoublyLinkedList(object):
    def __init__(self):
        self.start = self.last = None
 
    def insert(self, num):
        new_elem = Node(num)
 
        if self.start is None:
            self.start = self.last = new_elem
        else:
            new_elem.nxt = self.start
            self.start.prv = new_elem
            self.start = new_elem
 
    def delete_num(self, target):
        it = self.start
        while it is not None:
            if it.num == target:
                if it.prv is None and it.nxt is None:
                    self.start = self.last = None
                else:
                    if it.prv is not None:
                        it.prv.nxt = it.nxt
                    else:
                        self.start = self.start.nxt
 
                    if it.nxt is not None:
                        it.nxt.prv = it.prv
                    else:
                        self.last = self.last.prv
                break
            it = it.nxt
 
    def delete_start(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.start.nxt.prv = None
            self.start = self.start.nxt
 
    def delete_last(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.last.prv.nxt = None
            self.last = self.last.prv
 
    def get_content(self):
        ret = []
        it = self.start
 
        while it is not None:
            ret.append(it.num)
            it = it.nxt
 
        return ' '.join(ret)
 
 
def _main():
    from sys import stdin
 
    n = int(input())
 
    lst = DoublyLinkedList()
     
    for _ in range(n):
        cmd = stdin.readline().strip().split()
        if cmd[0] == 'insert':
            lst.insert(cmd[1])
        elif cmd[0] == 'delete':
            lst.delete_num(cmd[1])
        elif cmd[0] == 'deleteFirst':
            lst.delete_start()
        elif cmd[0] == 'deleteLast':
            lst.delete_last()
 
    print(lst.get_content())
 
 
if __name__ == '__main__':
    _main()

Buggy python submission (verdict: Time Limit Exceeded):
import sys

class Node:
	def __init__(self, value):
		self.value = value
		self.prev = None
		self.next = None

class DoublyLinkedList:
	def __init__(self):
		self.head = None
		self.tail = None
		self.size = 0

	def get_size(self):
		return self.size

	def is_empty(self):
		return self.size == 0

	def insert(self, value):
		node = Node(value)
		if self.is_empty():
			self.head = self.tail = node
		else:
			self.head.prev = node
			node.next = self.head
			self.head = node
		self.size += 1

	def deleteFirst(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.head = self.head.next
			self.head.prev = None
		self.size -= 1
	
	def deleteLast(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.tail = self.tail.prev
			self.tail.next = None
		self.size -= 1

	def delete(self, value):
		if self.is_empty():
			return
		if self.head.value == value:
			self.deleteFirst()
		else:
			node1 = self.head.next
			node2 = self.tail
			node3 = None
			while node1 != None:
				if node1.value == value:
					prev = node1.prev
					next = node1.next
					prev.next = next
					if next != None:
						next.prev = prev
					else:
						self.tail = prev
					self.size -= 1
					break
				elif node1 == node2:
					if node3 == None:
						break;
					else:
						node1 = node3
				else:
					node1 = node1.next
					if node2.value == value:
						node3 = node2
					node2 = node2.prev
		return

	def print(self):
		node = self.head
		while node != None:
			sys.stdout.write(str(node.value))
			node = node.next
			if node != None:
				sys.stdout.write(' ')
		print()

n = int(input())
dll = DoublyLinkedList()
for i in range(n):
	cmd = str(input())
	if cmd == 'deleteFirst':
		dll.deleteFirst()
	elif cmd == 'deleteLast':
		dll.deleteLast()
	else:
		cmd, value = cmd.split()
		if cmd == 'insert':
			dll.insert(int(value))
		else:
			dll.delete(int(value))
dll.print()



Fixed submission:
class Node(object):
    def __init__(self, num, prv = None, nxt = None):
        self.num = num
        self.prv = prv
        self.nxt = nxt
 
 
class DoublyLinkedList(object):
    def __init__(self):
        self.start = self.last = None
 
    def insert(self, num):
        new_elem = Node(num)
 
        if self.start is None:
            self.start = self.last = new_elem
        else:
            new_elem.nxt = self.start
            self.start.prv = new_elem
            self.start = new_elem
 
    def delete_num(self, target):
        it = self.start
        while it is not None:
            if it.num == target:
                if it.prv is None and it.nxt is None:
                    self.start = self.last = None
                else:
                    if it.prv is not None:
                        it.prv.nxt = it.nxt
                    else:
                        self.start = self.start.nxt
 
                    if it.nxt is not None:
                        it.nxt.prv = it.prv
                    else:
                        self.last = self.last.prv
                break
            it = it.nxt
 
    def delete_start(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.start.nxt.prv = None
            self.start = self.start.nxt
 
    def delete_last(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.last.prv.nxt = None
            self.last = self.last.prv
 
    def get_content(self):
        ret = []
        it = self.start
 
        while it is not None:
            ret.append(it.num)
            it = it.nxt
 
        return ' '.join(ret)
 
 
def _main():
    from sys import stdin
 
    n = int(input())
 
    lst = DoublyLinkedList()
     
    for _ in range(n):
        cmd = stdin.readline().strip().split()
        if cmd[0] == 'insert':
            lst.insert(cmd[1])
        elif cmd[0] == 'delete':
            lst.delete_num(cmd[1])
        elif cmd[0] == 'deleteFirst':
            lst.delete_start()
        elif cmd[0] == 'deleteLast':
            lst.delete_last()
 
    print(lst.get_content())
 
 
if __name__ == '__main__':
    _main()

Buggy python submission (verdict: Time Limit Exceeded):
import sys

class Node:
	def __init__(self, value):
		self.value = value
		self.prev = None
		self.next = None

class DoublyLinkedList:
	def __init__(self):
		self.head = None
		self.tail = None
		self.size = 0

	def get_size(self):
		return self.size

	def is_empty(self):
		return self.size == 0

	def insert(self, value):
		node = Node(value)
		if self.is_empty():
			self.head = self.tail = node
		else:
			self.head.prev = node
			node.next = self.head
			self.head = node
		self.size += 1

	def deleteFirst(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.head = self.head.next
			self.head.prev = None
		self.size -= 1
	
	def deleteLast(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.tail = self.tail.prev
			self.tail.next = None
		self.size -= 1

	def delete(self, value):
		if self.is_empty():
			return
		if self.head.value == value:
			self.deleteFirst()
		else:
			node1 = self.head.next
			node2 = self.tail
			node3 = None
			while node1 != None:
				if node1.value == value:
					prev = node1.prev
					next = node1.next
					prev.next = next
					if next != None:
						next.prev = prev
					else:
						self.tail = prev
					self.size -= 1
					break
				elif node1 == node2:
					if node3 == None:
						break;
					else:
						node1 = node3
				else:
					node1 = node1.next
					if node2.value == value:
						node3 = node2
					node2 = node2.prev
		return

	def print(self):
		node = self.head
		while node != None:
			sys.stdout.write(str(node.value))
			node = node.next
			if node != None:
				sys.stdout.write(' ')
		print()

n = int(input())
dll = DoublyLinkedList()
for n in range(n):
	cmd = sys.stdin.readline().strip().split()
	if cmd[0] == 'deleteFirst':
		dll.deleteFirst()
	elif cmd[0] == 'deleteLast':
		dll.deleteLast()
	else:
		if cmd[0] == 'insert':
			dll.insert(int(cmd[1]))
		else:
			dll.delete(int(cmd[1]))
dll.print()



Fixed submission:
class Node(object):
    def __init__(self, num, prv = None, nxt = None):
        self.num = num
        self.prv = prv
        self.nxt = nxt
 
 
class DoublyLinkedList(object):
    def __init__(self):
        self.start = self.last = None
 
    def insert(self, num):
        new_elem = Node(num)
 
        if self.start is None:
            self.start = self.last = new_elem
        else:
            new_elem.nxt = self.start
            self.start.prv = new_elem
            self.start = new_elem
 
    def delete_num(self, target):
        it = self.start
        while it is not None:
            if it.num == target:
                if it.prv is None and it.nxt is None:
                    self.start = self.last = None
                else:
                    if it.prv is not None:
                        it.prv.nxt = it.nxt
                    else:
                        self.start = self.start.nxt
 
                    if it.nxt is not None:
                        it.nxt.prv = it.prv
                    else:
                        self.last = self.last.prv
                break
            it = it.nxt
 
    def delete_start(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.start.nxt.prv = None
            self.start = self.start.nxt
 
    def delete_last(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.last.prv.nxt = None
            self.last = self.last.prv
 
    def get_content(self):
        ret = []
        it = self.start
 
        while it is not None:
            ret.append(it.num)
            it = it.nxt
 
        return ' '.join(ret)
 
 
def _main():
    from sys import stdin
 
    n = int(input())
 
    lst = DoublyLinkedList()
     
    for _ in range(n):
        cmd = stdin.readline().strip().split()
        if cmd[0] == 'insert':
            lst.insert(cmd[1])
        elif cmd[0] == 'delete':
            lst.delete_num(cmd[1])
        elif cmd[0] == 'deleteFirst':
            lst.delete_start()
        elif cmd[0] == 'deleteLast':
            lst.delete_last()
 
    print(lst.get_content())
 
 
if __name__ == '__main__':
    _main()

Buggy python submission (verdict: Time Limit Exceeded):
import sys

class Node:
	def __init__(self, value):
		self.value = value
		self.prev = None
		self.next = None

class DoublyLinkedList:
	def __init__(self):
		self.head = None
		self.tail = None
		self.size = 0

	def get_size(self):
		return self.size

	def is_empty(self):
		return self.size == 0

	def insert(self, value):
		node = Node(value)
		if self.is_empty():
			self.head = self.tail = node
		else:
			self.head.prev = node
			node.next = self.head
			self.head = node
		self.size += 1

	def deleteFirst(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.head = self.head.next
			self.head.prev = None
		self.size -= 1
	
	def deleteLast(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.tail = self.tail.prev
			self.tail.next = None
		self.size -= 1

	def delete(self, value):
		if self.is_empty():
			return
		if self.head.value == value:
			self.deleteFirst()
		else:
			node1 = self.head.next
			node2 = self.tail
			node3 = None
			while node1 != None:
				if node1.value == value:
					prev = node1.prev
					next = node1.next
					prev.next = next
					if next != None:
						next.prev = prev
					else:
						self.tail = prev
					self.size -= 1
					break
				elif node1 == node2:
					if node3 == None:
						break;
					else:
						node1 = node3
				else:
					node1 = node1.next
					if node2.value == value:
						node3 = node2
					node2 = node2.prev
		return

	def print(self):
		node = self.head
		while node != None:
			sys.stdout.write(str(node.value))
			node = node.next
			if node != None:
				sys.stdout.write(' ')
		print()

n = int(input())
dll = DoublyLinkedList()
for _ in range(n):
	cmd = sys.stdin.readline().strip().split()
	if cmd[0] == 'deleteFirst':
		dll.deleteFirst()
	elif cmd[0] == 'deleteLast':
		dll.deleteLast()
	else:
		if cmd[0] == 'insert':
			dll.insert(int(cmd[1]))
		else:
			dll.delete(int(cmd[1]))
dll.print()



Fixed submission:
class Node(object):
    def __init__(self, num, prv = None, nxt = None):
        self.num = num
        self.prv = prv
        self.nxt = nxt
 
 
class DoublyLinkedList(object):
    def __init__(self):
        self.start = self.last = None
 
    def insert(self, num):
        new_elem = Node(num)
 
        if self.start is None:
            self.start = self.last = new_elem
        else:
            new_elem.nxt = self.start
            self.start.prv = new_elem
            self.start = new_elem
 
    def delete_num(self, target):
        it = self.start
        while it is not None:
            if it.num == target:
                if it.prv is None and it.nxt is None:
                    self.start = self.last = None
                else:
                    if it.prv is not None:
                        it.prv.nxt = it.nxt
                    else:
                        self.start = self.start.nxt
 
                    if it.nxt is not None:
                        it.nxt.prv = it.prv
                    else:
                        self.last = self.last.prv
                break
            it = it.nxt
 
    def delete_start(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.start.nxt.prv = None
            self.start = self.start.nxt
 
    def delete_last(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.last.prv.nxt = None
            self.last = self.last.prv
 
    def get_content(self):
        ret = []
        it = self.start
 
        while it is not None:
            ret.append(it.num)
            it = it.nxt
 
        return ' '.join(ret)
 
 
def _main():
    from sys import stdin
 
    n = int(input())
 
    lst = DoublyLinkedList()
     
    for _ in range(n):
        cmd = stdin.readline().strip().split()
        if cmd[0] == 'insert':
            lst.insert(cmd[1])
        elif cmd[0] == 'delete':
            lst.delete_num(cmd[1])
        elif cmd[0] == 'deleteFirst':
            lst.delete_start()
        elif cmd[0] == 'deleteLast':
            lst.delete_last()
 
    print(lst.get_content())
 
 
if __name__ == '__main__':
    _main()

Buggy python submission (verdict: Time Limit Exceeded):
import sys

class Node:
	def __init__(self, value):
		self.value = value
		self.prev = None
		self.next = None

class DoublyLinkedList:
	def __init__(self):
		self.head = None
		self.tail = None
		self.size = 0

	def get_size(self):
		return self.size

	def is_empty(self):
		return self.size == 0

	def insert(self, value):
		node = Node(value)
		if self.is_empty():
			self.head = self.tail = node
		else:
			self.head.prev = node
			node.next = self.head
			self.head = node
		self.size += 1

	def deleteFirst(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.head = self.head.next
			self.head.prev = None
		self.size -= 1
	
	def deleteLast(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.tail = self.tail.prev
			self.tail.next = None
		self.size -= 1

	def delete(self, value):
		if self.is_empty():
			return
		if self.head.value == value:
			self.deleteFirst()
		else:
			node1 = self.head.next
			node2 = self.tail
			node3 = None
			while node1 != None:
				if node1.value == value:
					prev = node1.prev
					next = node1.next
					prev.next = next
					if next != None:
						next.prev = prev
					else:
						self.tail = prev
					self.size -= 1
					break
				elif node1 == node2:
					if node3 == None:
						break;
					else:
						node1 = node3
				else:
					node1 = node1.next
					if node2.value == value:
						node3 = node2
					node2 = node2.prev
		return

	def print(self):
		node = self.head
		while node != None:
			sys.stdout.write(str(node.value))
			node = node.next
			if node != None:
				sys.stdout.write(' ')
		print()

	def get_content(self):
		ret = []
		it = self.head

		while it is not None:
			ret.append(str(it.value))
			it = it.next

		return ' '.join(ret)

n = int(input())
dll = DoublyLinkedList()
for _ in range(n):
	cmd = sys.stdin.readline().strip().split()
	if cmd[0] == 'deleteFirst':
		dll.deleteFirst()
	elif cmd[0] == 'deleteLast':
		dll.deleteLast()
	else:
		if cmd[0] == 'insert':
			dll.insert(int(cmd[1]))
		else:
			dll.delete(int(cmd[1]))
print(dll.get_content())



Fixed submission:
class Node(object):
    def __init__(self, num, prv = None, nxt = None):
        self.num = num
        self.prv = prv
        self.nxt = nxt
 
 
class DoublyLinkedList(object):
    def __init__(self):
        self.start = self.last = None
 
    def insert(self, num):
        new_elem = Node(num)
 
        if self.start is None:
            self.start = self.last = new_elem
        else:
            new_elem.nxt = self.start
            self.start.prv = new_elem
            self.start = new_elem
 
    def delete_num(self, target):
        it = self.start
        while it is not None:
            if it.num == target:
                if it.prv is None and it.nxt is None:
                    self.start = self.last = None
                else:
                    if it.prv is not None:
                        it.prv.nxt = it.nxt
                    else:
                        self.start = self.start.nxt
 
                    if it.nxt is not None:
                        it.nxt.prv = it.prv
                    else:
                        self.last = self.last.prv
                break
            it = it.nxt
 
    def delete_start(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.start.nxt.prv = None
            self.start = self.start.nxt
 
    def delete_last(self):
        if self.start is self.last:
            self.start = self.last = None
        else:
            self.last.prv.nxt = None
            self.last = self.last.prv
 
    def get_content(self):
        ret = []
        it = self.start
 
        while it is not None:
            ret.append(it.num)
            it = it.nxt
 
        return ' '.join(ret)
 
 
def _main():
    from sys import stdin
 
    n = int(input())
 
    lst = DoublyLinkedList()
     
    for _ in range(n):
        cmd = stdin.readline().strip().split()
        if cmd[0] == 'insert':
            lst.insert(cmd[1])
        elif cmd[0] == 'delete':
            lst.delete_num(cmd[1])
        elif cmd[0] == 'deleteFirst':
            lst.delete_start()
        elif cmd[0] == 'deleteLast':
            lst.delete_last()
 
    print(lst.get_content())
 
 
if __name__ == '__main__':
    _main()