I\'ve just started practicing leetcode and I am very rusty. I\'m practicing in Python, but I can follow along in any other languages. Much appreciated!\n\nGiven a list of dictionaries containing set of ids, find folders and assignments such that the iteration\nover the list will produce the sub items of the folders along with hyphen.\nFind the results in O(n) time complexity. Also mention about the space complexity as well.\n\n```\neg:\n    input = [\n        {"id": 1, "name": "US History", "parent_id": None},\n        {"id": 2, "name": "Third Assignment", "parent_id": 3},\n        {"id": 3, "name": "First Chapter", "parent_id": 1},\n        {"id": 4, "name": "Second Assignment", "parent_id": 1},\n        {"id": 5, "name": "First Assignment", "parent_id": 6},\n        {"id": 6, "name": "Canadian History", "parent_id": None},\n    ]\n  output:\n\tUS History\n\t-First Chapter\n\t--Third Assignment\n\t-Second Assignment\n\tCanadian History\n\t-First Assignment\n```

I\'ve just started practicing leetcode and I am very rusty. I\'m practicing in Python, but I can follow along in any other languages. Much appreciated!\n\nGiven