**Round 1: Glider**\nFind all sets of palindromes in a string. \n\n**Round 2: Craft Demo**\nDemo on question: All subtrees formed once a node in a given tree is removed. \nQuestion was given a day before, just had to already have a solution and present it. \nSum of two huge numbers (without using BigInteger, long etc). Changes to enable subtraction of such big numbers. \n\n**Round 3: Value Assessor**\n15 minutes high level component oral discussion on an analystics system collecting data of location of devices spread throughout the world. \nGiven busy time schedules of two people and a time interval, return a time period where a meeting can be set between both people. \n\n**Round 4: Assessor**\nRemove all consecutive characters in a string. \nAll permutations of the elements in a given list. \n\n**Round 5: Hiring Manager**\nGeneral project details for 30 minutes.

Round 1: Glider\nFind all sets of palindromes in a string. \n\nRound 2: Craft Demo\nDemo on question: All subtrees formed once a node in a given tree is removed