We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
# Write your code here
x = []
y = []
z = []
for i in range(4):
x.append(points[i][0])
y.append(points[i][1])
z.append(points[i][2])
xx = list(set(x))
yy = list(set(y))
zz = list(set(z))
if(len(xx)==1 or len(yy)==1 or len(zz)==1):
return "YES"
else:
return "NO"
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Sherlock and Planes
You are viewing a single comment's thread. Return to all comments →
def solve(points):