[Python3] Straight-forward comparision based solution + early Termination [Time: O(n^2) Space: O(1)]
\nclass Solution:\n    def canFormArray(self, arr: List[int], pieces: List[List[int]]) -> bool:\n        #checks if each array in pieces is valid array or not \
```\nclass Solution:\n    def canFormArray(self, arr: List[int], pieces: List[List[int]]) -> bool:\n        #checks if each array in pieces is valid array or not \n        def helper(arr, test):\n            start = None\n            try:\n                start = arr.index(test[0])\n            except:\n                return False\n\n            i = 0\n            while i < len(test):\n                if i + start == len(arr) or test[i] != arr[i+start]:\n                    return False\n                i+=1\n\n            return True\n        \n        \n        if len(arr) != sum([len(a) for a in pieces]) : return False\n        for test in pieces:\n            if helper(arr, test) == False: return False\n\n        return True\n```
['Python']