Start with self-introduction and some questions related to my resume.\nThen, 2 coding questions\n10 minutes left for asking questions\n\nQuestion 1: Given a number, check if it is a palindrome\n```\nboolean isPalindrome(int x) {\n    // Your code here\n}\n```\n\nQuestion 2: Print all accessible nodes inorder \n```\npublic class Node {\n    Node up;\n    Node right;\n    Node down;\n    int value;\n}\n\n// all upper nodes are less than value of that node\n// all lower nodes are greater than value of that node\n// all right nodes are greater than value of that node and its lower nodes\n// the upper node cannot access to the lower node (unidirectional)\n\nvoid printInorderNode(Node node) {\n    // Print all accessible nodes in order\n}\n```\n\nFor example\n```\n 1\n ^\n |\n 2         7    10\n ^         ^    ^\n |         |    |\n 3 -> 5 -> 8 -> 11 -> 12\n |    |    |\n v    v    v \n 4    6    9\n```\n\nCalling printInorderNode(3) should print [1,2,3,4,5,6,7,8,9,10,11,12]\nCalling printInorderNode(5) should print [5,6,7,8,9,10,11,12]\n

Start with self-introduction and some questions related to my resume.\nThen, 2 coding questions\n10 minutes left for asking questions\n\nQuestion 1: Given a num