Meta | SWE E4 | London
666

They ask me an Easy tagged and one untagged Hard

  1. 238 (with space complexity O(min(n,k))
    https://leetcode.com/problems/contains-duplicate-ii/description/

  2. The second was untagged not even in Leetcode, merge 3 srtted arrays (similar with merge k sorted lists tagged 23 )https://leetcode.com/problems/merge-k-sorted-lists/description/

He waste my time in the first one cause he didnt want O(n) space complexity from the map
For the second i didnt have the time, but i remembered the k sorted lists problem and i suggest
a PriotityQueue but again we waste me my time with questions.

Result: reject and cool down 12 months

Comments (6)