Position: E5\n\n[339. Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/)\n[973. K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)\n\nFor the second one, I used `heapq` in Python. It seems like interviewer has different opinoin about the O(n) Time Complexity. \nHere is the approvement of O(n) to build a heapq [Time Complexity of building a heap](https://www.***.org/time-complexity-of-building-a-heap/)

Position: E5\n\n339. Nested List Weight Sum\n973. K Closest Points to Origin\n\nFor the second one, I used heapq in Python. It seems like interviewer has differ