# 1
def isPalindrome(arr):
    for i in arr:
        for j in arr:
            if arr[i] == arr.length - j - 1:
                return true
            else: 
                continue

# 2
def sLL(List):
    def SLNode(value):
        this.val = value
        this.next = null

    def SLQueue():
        head = null
        tail = null

    def add(node):
        while(node.next):
            if node.next == null:
                sLL.next = node.val
                node.next = null

    def remove(node):
        while()
        

# 3
def Queue(List):



# 4
def Stack(arr):



# 5
def rmDup(arr):
    for i in arr:
        for j in range(1, arr.length):
            if arr[j] == arr[i]:
                pop(i)

# 6
def braces(str):



# 7
def search(arr, val):
