I got two rounds of phone screening.\n\nthe first round was not bad, they asked me to do self-introduction and asked several questions based on my experience, then we start coderpad testing, four questions involved this time.\n\nhttps://leetcode.com/problems/valid-perfect-square/\nhttps://leetcode.com/problems/coin-change-2/\nhttps://leetcode.com/problems/reverse-string/\nhttps://leetcode.com/problems/reverse-integer/\nthen I receieved an system generated email for the second round of the phone interview. they only asked one question and I was not able to find a good solution. I didn\'t find the problem here, so I\'m including the description below, hopefully someone could help to solve this problem.\n\n**input: list contains number from 1 to n\noutput should be a re-arranged list, with the format like this [1,3,6,10,15...]\nwhich has the following capability:\na). the sum of each adjacent pair should be a valid perfect square, like 1+3=2^2, 3+6=3^2, 6+10=4^2, 10+15=5^2, etc.**\n\nthis should be a graph problem, need sharpe brains within this community to find out a good approach to solve this problem, thanks in advance!!!

I got two rounds of phone screening.\n\nthe first round was not bad, they asked me to do self-introduction and asked several questions based on my experience, t