human
What is a the Python code you requested given the following:
I found an interesting problem on https://leetcode.com/problems/valid-boomerang/:
A boomerang is a set of 3 points that are all distinct and not in a straight line.
Given a list of three points in the plane, return whether these points are a boomerang.
 
Example 1:
Input: [[1,1],[2,3],[3,2]]
Output: true

Example 2:
Input: [[1,1],[2,2],[3,3]]
Output: false

 
Note:

points.length == 3
points[i].length == 2
0 <= points[i][j] <= 100

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python code you requested.

class Solution:
    def isBoomerang(self, points: List[List[int]]) -> bool:
        x1, y1 = points[0]
        x2, y2 = points[1]
        x3, y3 = points[2]
        
        return (y2 - y1) * (x3 - x1) != (y3 - y1) * (x2 - x1)