Scribd Logo
Upload

Welcome to Scribd!

  • New Text Document

    Uploaded by

    Karampuri Anuhya
    4 views1 page
    The document defines a subsets function that takes in an array, list of numbers, size of the list, and index. It recursively prints all subsets by adding elements to the array and incrementing the index. It also contains code to implement a stack using a list with push and pop operations on either end based on input commands and prints the final list. Finally, it defines another subsets function that uses backtracking to find all subsets of a given list and append them to a results list.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document defines a subsets function that takes in an array, list of numbers, size of the list, and index. It recursively prints all subsets by adding elements to the array and incrementing the index. It also contains code to implement a stack using a list with push and pop operations on either end based on input commands and prints the final list. Finally, it defines another subsets function that uses backtracking to find all subsets of a given list and append them to a results list.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    New Text Document

    Uploaded by

    Karampuri Anuhya
    The document defines a subsets function that takes in an array, list of numbers, size of the list, and index. It recursively prints all subsets by adding elements to the array and incrementing the index. It also contains code to implement a stack using a list with push and pop operations on either end based on input commands and prints the final list. Finally, it defines another subsets function that uses backtracking to find all subsets of a given list and append them to a results list.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    def subsets(arr,nums,n,ind):

    if ind < n:
    for i in range(ind,n):
    subsets(arr+[nums[i]],nums,n,i+1)
    print(arr)

    t=int(input())
    l=[0]*11
    n=len(l)
    top1=-1
    top2= n
    for i in range(t):
    s=input().split()

    if s[0]=="push1":
    x=int(s[-1])
    if top1 < top2-1:
    top1+=1
    l[top1]=x
    else:
    print("Full hi")

    elif s[0]=="push2":
    x=int(s[-1])
    if top1 < top2-1:
    top2-=1
    l[top2]=x
    else:
    print("full hello")

    elif s[0]=="pop1":
    if top1>=0:
    print(l[top1])
    top1-=1
    else:
    print("Empty hi")

    elif s[0]=="pop2":
    if top2<n:
    print([top2])
    top2+=1
    else:
    print("empty hello")
    print(l)

    def subsets(nums):
    res = []
    backtrack(res, [], nums, 0)
    return res

    def backtrack(res, temp, nums, start):


    res.append(sum(temp[:]))
    for i in range(start, len(nums)):
    temp.append(nums[i])
    backtrack(res, temp, nums, i + 1)
    temp.pop()

    You might also like