I recently interviewed at airbnb and failed at second phone interview round.\nRole Senior Software Engineer\nLocation: SF\n\n**Question 1:**\nhttps://leetcode.com/problems/smallest-common-region/\n\n**Question 2:**\nThere are 10 wizards, 0-9, you are given a list that each entry is a list of wizards known by wizard. Define the cost between wizards and wizard as square of different of i and j. To find the min cost between 0 and 9.\n\nFor example:\n\nwizard[0] list: 1, 4, 5\u2028\n\nwizard[4] list: 9\n\n\u2028wizard 0 to 9 min distance is (0-4)^2+(4-9)^2=41 (wizard[0]->wizard[4]->wizard[9])\nhttps://github.com/allaboutjst/airbnb/blob/master/src/main/java/ten_wizards/TenWizards.java

I recently interviewed at airbnb and failed at second phone interview round.\nRole Senior Software Engineer\nLocation: SF\n\nQuestion 1:\nhttps://leetcode.com/p