I take it back actually this is nothing but a standard Khan's algorithm

from collections import deque

class Solution:
  def findOrder(self, tasks, prerequisites):
    result = []
    
    graph = {}
    indegree = {}
    for i in range(tasks):
      ...

Fixed!