Domanda di colloquio di Tata Consultancy Services

Find the longest substring without repeating characters. Implement an LRU cache. Given a binary tree, return its vertical order traversal.