Bachelor\'s University Grad\n\nNo intro.\n\n2 coding problems:\n\n- The first one was similar to https://leetcode.com/problems/valid-number/ but "easier"\n\n```txt\nGiven a  string, write a method that returns true if the string is a valid number or false otherwise.\nOnly integers and decimals should be considered as valid. In other words,\nonly characters allowed are digits, "-" and ".".\nThe string can be very long (think millions of characters) and no built-in function/class\ncan handle it without overflowing or losing precision.\n\nSome example strings and expected output:\n"13"    ---> true\n"3.0"   ---> true\n"-7.4"  ---> true\n"-13.5" ---> true\n"abc"   ---> false\n"123a"  ---> false\n"-."    ---> false\n"-..--" ---> false\n"1.0.0.1" -> false\n```\nThe interviewer didn\'t mention more test cases such as `"007"` or `".9"`, be sure to think about every possible input.\n\n- I don\'t have a link for this second question but I\'m pretty sure there has to be in LeetCode already:\n\n```txt\nImplement a function to merge 3 sorted integer arrays.\nThe output should be another sorted integer array consisting of\nall integers from the 3 input arrays.\nThe input arrays may have duplicates, but the output array shouldn\'t have any duplicate.\n```\n\nThe interviewer didn\'t mention any edge case.\n\nI was able to explain my approach with time and space complexities, code both and ran tests but found bugs, and ran out of time to fix them.\n\n5 minutes at the end to ask questions.

Bachelor\'s University Grad\n\nNo intro.\n\n2 coding problems:\n\n- The first one was similar to https://leetcode.com/problems/valid-number/ but "easier"\n\ntxt