Question

I was asked this question:

Given any input series a corresponding graph must be generated without the use of any libraries.

After, trying my best, I arrived at this solution to which they replied it had a logical issue.

# Create the matrix
print("Enter the sequence with spaces: ")
arr = list(map(int, input().split()))
count = len(arr)
rows = int(sum(arr)) 
cols = int(sum(arr) + 4)
content = [[" "]*cols for _ in range(rows)]
maxq = 0
maxp = 0
content[0][0] = "/"

# Apply the positions in the matrix
p = 0
q = arr[0]
k = 0
for l in range(q):
    if (k != q):
        content[k][p] = "/"
        p = p + 1
        k = k + 1
p = q
flag = 1
i = 0
j = 0
k = 0
c = 0
temp = 0
r = 0
flag = 1
for i,j in enumerate(arr):
    c = c + 1
    if c < count:
        k = arr[i+1]
    else:
        k = 0
    if arr[i]:
        if flag == 1:
            content[q][p] = "/\\"
            if maxq < q:
                maxq = q
                maxp = p
            qori = q
            pori = p
            p = p + k
            temp = q - k
            if temp < 0:
                q = q + k
                for l in range(k):
                    if ((qori != q) and (pori != p)):
                        qori = qori + 1
                        pori = pori + 1
                        content[qori][pori] = "/"
                        flag = 1
            else:
                q = q - k
                for l in range(k):
                    if (((qori != q) or (qori > 0)) and ((pori != p) or (pori > 0))):
                        qori = qori - 1
                        pori = pori + 1
                        content[qori][pori] = "\\"
                        flag = 2
        
        elif flag == 2:
            content[q][p] = "\/"
            if content[q-1][p-1] == "/":
                content[q][p] = "/\\"
            if maxq < q:
                maxq = q
                maxp = p
            qori = q
            pori = p
            q = q + k
            p = p + k
            for l in range(k):
                if ((qori != q) and (pori != p)):
                    qori = qori + 1
                    pori = pori + 1
                    content[qori][pori] = "/"
            flag = 1


# Apply the top data
content[maxq][maxp] = "<O>"


# build frame
width       = len(str(max(rows,cols)-1))
contentLine = "# | values |"
dashes      = "-".join("-"*width for _ in range(cols))
frameLine   = contentLine.replace("values",dashes)
frameLine   = frameLine.replace("#"," "*width)
frameLine   = frameLine.replace("| ","+-").replace(" |","-+")


# print grid
print(frameLine)
for i,row in enumerate(reversed(content),1):
    values = " ".join(f"{v:{width}s}" for v in row)
    line   = contentLine.replace("values",values)
    line   = line.replace("#"," ")
    print(line)
print(frameLine)


# x-axis
numLine = contentLine.replace("|"," ")
numLine = numLine.replace("#"," "*width)
numLine = numLine.replace("values"," ")
print(numLine)

I was given this as a hint/reference to solve my logical issue:

#!/usr/bin/env python
# coding: utf-8
num = input("Enter the number of elements")
a= list()
for i in range(int(num)):
    n = input()
    a.append(int(n))
# In[6]:
b=[]
g=0
m=0
mini=0
mi=-1
c=0
for i in a:
    for j in range(i):
        if g%2==0:
            b.append(1)
            c=c+1
            if c>m:
                m=c
                mi=len(b)-1        
        else:
            b.append(-1)
            c=c-1
            if c<mini:
                mini = c
    g=g+1
# In[7]:
ans=[[' ' for i in range(len(b)+1)] for j in range(m+3-mini)]
g=0
h=-mini
for i in range(len(b)):
    t=0
    if i>mi:
       t=1 
    if b[i]==1:
        ans[2+-mini+m-h][i+t]='/'
#         print(i,h)
#         print(ans[i][h])
        h=h+1
    else:
        h=h-1
        ans[2+m-h-mini][i+t]="\\"
# ans
print(len(b))
ans[0][mi+1]='o'
ans[1][mi]='/'
ans[1][mi+2]='\\'
ans[1][mi+1]='|'
ans[2][mi]='<'
ans[2][mi+2]='>'
for i in ans:
    for j in i:
        print(j,end="")
    print('')