@raulbc777
In addition:
My result Python == my result Excel (calculation in Excel on basis of https://www.maa.org/sites/default/files/0746834215798.di020710.02p0187t.pdf for gcd==1)
I can my results send to you by e-mail(for p=2470 pos=219)

Hi!
I can't solve the task.
For this task (where Triangle has integtal side and one angle twice another):
gcd(a,b,c)=1
a=i2
b=j*i
c=j2-i2
where
i<j<i*20.5. The inequality for Python -> i<j<2i+1 or i<j<2i

Me code for p=2470 and side (715,729,1026) return order num = 219 (autor order number = 215). I think that my code return excess triangle, but I verified results for criterion of Heronian triangles.
I can send my code or You will send to me (smenergy@inbox.ru) list your results for order number 1...219

Java is still broken

• This should've passed but failed the random test

IN: [E, W, N, S, S, S, S, N, E, S] 
OUT: [S, S, S, E]

• Description says return an empty array but example test is expecting new String[]{""}. That aint no empty array. That's an array with 1 empty string in it

because if you inspect the type 'k' is axctually a char and it explicitly says to only deal with strings

The Hint is at https://en.wikipedia.org/wiki/Integer_triangle. Search the case: Integer Triangles Having One Angle The Double of Another .

Try to find the triangles such that gcd(a, b, c) = 1 (G.C.D. greatest common divisor)

I thought I've written that in the instructions but I didn't. I'll add it to be clearer, thanks for the feedback.

they are hidden deeply within the this object you have to do a deep search to find the keys and return the values

I'm currently fixing the java translation, just having problems with the site right now.

I put the array into my own code and by hand and got a length of 16. I don't know where the 17 is from. Is this the python version?

Fixin' that. Typo in the details. Shouldn't matter in your solution, as number will vary.