solves number of boomerangs in python

Author: anishLearnsToCode

README.md

@@ -118,7 +118,7 @@
 | 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberOfSegmentsInString.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/number_of_segments_in_a_string.py) |
 | 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ArrangingCoins.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/arranging_coins.py) |
 | 443 | [String Compression](https://leetcode.com/problems/string-compression) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/StringCompression.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/string_compression.py) |
-| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberOfBoomerangs.java) |
+| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberOfBoomerangs.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/number_of_boomerangs.py) |
 | 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/FindAllNumbersDisappearedInAnArray.java) |
 | 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MinimumMovesToEqualArrayElements.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/minimum_moves_to_equal_array_element.py) |
 | 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/AssignCookies.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/assign_cookies.py)|

python/number_of_boomerangs.py

@@ -0,0 +1,20 @@
+from typing import List
+
+
+class Solution:
+    def get_distance(self, p1: List[int], p2: List[int]) -> int:
+        x1, y1 = p1
+        x2, y2 = p2
+        dx, dy = x2 - x1, y2 - y1
+        return dx ** 2 + dy ** 2
+
+    def numberOfBoomerangs(self, points: List[List[int]]) -> int:
+        result = 0
+        for p1 in points:
+            distance_frequency = {}
+            for p2 in points:
+                distance = self.get_distance(p1, p2)
+                distance_frequency[distance] = distance_frequency.get(distance, 0) + 1
+            for frequency in distance_frequency.values():
+                result += frequency * (frequency - 1)
+        return result