List Comprehensions - Hackerrank solution

 

List Comprehensions

---

Task

---

Let's learn about list comprehensions! You are given three integers x,y and z representing the dimensions of a cuboid along with an integer n.
Print a list of all possible coordinates given by(i,j,k) on a 3D grid where the sum of i+j+k is not equal to n. Here, 0<=i<=x;0<=j<=y;0<=k<=z. Please use list comprehensions rather than multiple loops, as a learning exercise.

---

Solution:

x = int(input()) y = int(input()) z = int(input()) N = int(input()) arr = [[X, Y, Z] for X in range(x+1) for Y in range(y+1) for Z in range(z+1)  if X + Y + Z != N] print(arr)

---

Note:

This Code is Verified by all Test Cases.If any error occurs then Comment correct code Below in comment box.

Disclaimer:-

 The above hole problem statement is given by hackerrank.com, but the solution is generated by the CodexRitik . if any of the query regarding this post or website fill the following contact form Thank You.