this was a good one :)

Your solution is not exactly correct. It incorrectly recognizes some non-square numbers as squares, for example 114 or 155.

One of the test cases (89) return 136 instead of -1. In my IDE (Eclipse) works just fine. Am I missing something?

hello

please do not raise an issue to ask for help. your latest code submission does not time out, but it is incorrect

Strange, my solution works in online C compilers, but here it goes to overclocking 12000ms.

Your solution cannot be correct for large numbers. The Convert.ToInt64(Math.Pow(n, 2)) does not seem to be a correct thing to do.

LC translation

The recursive version worked locally but not here

I used C#.

In what language?
What is your code?

Anyone met this test case?
Just only this case failed. How to resolve it?

Test Failed num: 4589308700496892969 Expected: 4589308704781427344 But was: 4589308704781427200

I thought calculus is for python programmers it also exist in js