Pregunta de entrevista de Moovit

1. Java multithreading question, like "what will this code print" 2. Leetcode 121, but the array is the change of the price, not the price itself. 3. Check if a binary tree is complete, every node has 2 sons, every level is full. 4. Leetcode 678