Pregunta de entrevista de Qubole
Only DS and algo. problem solving and basic system design - Tree zigzag traversal - LL queue (Blocking queue) implementation - Design task scheduler - Fuzzy score (on given two strings, find the matching score based on similar chars) - Find a node in graph (similar to BFS)
Respuesta de la entrevista
Anónimo
- Tree zigzag traversal Ans : Used two stack and boolean flag to visit every level - Fuzzy score I shared different points but interviewer did not accept any of my approach, he was expecting what is in his mind - Find a given node in a graph Ans : Used BFS approach (using queue), visiting the initial node and adding the neighbour nodes in the queue. The interviewer was expecting me to use hashmap for better space complexity, but I don't see any difference in space complexity whether queue/hashmap, the interviewer did not accept my points.