Due to NDA I won\'t get into exact details of the questions, but will give an overview.\n\n**Question 1**\n\nGiven a map representing an organizational hierarchy (`Map<String, ArrayList<String>>`) and an employee (`String`), return the overall size of the given employee\'s org structure.\n\nFollow up: how could this be optimized for future calls to not require recomputing previous results counts?\n\n**Question 2**\n\nGiven a random string that is either a hexadecimal color or RGB, optimize the string for shortest length possible. Hexadecimal strings can be shortened if there air pairs.\n\n**Question 3**\n\nGiven a starting and endpoint point and list of valid points, find the path to the endpoint point (breadth first search).\n\nFollow up: How could it be optimized in a case where the starting point is not provided immediately, but given later?\n\nFollow up: How would you determine a point to remove as a possible starting point that would result in the highest percentage of removed solvable paths?\n\n**Question 4**\n\nGiven an array of elements, find all consecutive contiguous subarrays for a given element and return the total count.\n\n**Question 5**\n\nDo a level order traversal of a binary tree and print each level.

Due to NDA I won\'t get into exact details of the questions, but will give an overview.\n\nQuestion 1\n\nGiven a map representing an organizational hierarchy (M