Feat: add Python solution

Author: remy727

README.md

@@ -30,13 +30,14 @@
 | 344 | Reverse String | [Ruby](./algorithms/ruby/0344-reverse-string.rb) | Easy |
 | 387 | First Unique Character in a String | [Ruby](./algorithms/ruby/0387-first-unique-character-in-a-string.rb) | Easy |
 | 438 | Find All Anagrams in a String | [Ruby](./algorithms/ruby/0438-find-all-anagrams-in-a-string.rb) | Medium |
+| 502 | IPO | [Ruby](./algorithms/ruby/0502-ipo.rb) [Python3](./algorithms/python3/0502-ipo.py) | Hard |
 | 509 | Fibonacci Number | [Ruby](./algorithms/ruby/0509-fibonacci-number.rb) | Easy |
 | 540 | Single Element in a Sorted Array | [Ruby](./algorithms/ruby/0540-single-element-in-a-sorted-array.rb) | Medium |
 | 557 | Reverse Words in a String III | [Ruby](./algorithms/ruby/0557-reverse-words-in-a-string-iii.rb) | Easy |
 | 567 | Permutation in String | [Ruby](./algorithms/ruby/0567-permutation-in-string.rb) | Medium |
 | 622 | Design Circular Queue | [Ruby](./algorithms/ruby/0622-design-circular-queue.rb) | Medium |
 | 733 | Flood Fill | [Ruby](./algorithms/ruby/0733-flood-fill.rb) | Easy |
-| 783 | Minimum Distance Between BST Nodes | [Ruby](./algorithms/ruby/0783-minimum-distance-between-bst-nodes.rb) [Python3](0783-minimum-distance-between-bst-nodes.py) | Easy |
+| 783 | Minimum Distance Between BST Nodes | [Ruby](./algorithms/ruby/0783-minimum-distance-between-bst-nodes.rb) [Python3](./algorithms/python3/0783-minimum-distance-between-bst-nodes.py) | Easy |
 | 904 | Fruit Into Baskets | [Ruby](./algorithms/ruby/0904-fruit-into-baskets:description.rb) | Medium |
 | 953 | Verifying an Alien Dictionary | [Ruby](./algorithms/ruby/0953-verifying-an-alien-dictionary.rb) | Easy |
 | 989 | Add to Array-Form of Integer | [Ruby](./algorithms/ruby/0989-add-to-array-form-of-integer.rb) | Easy |

algorithms/python3/0502-ipo.py

@@ -0,0 +1,35 @@
+# Problem: 502. IPO
+# URL: https://leetcode.com/problems/ipo
+
+import heapq
+
+class Solution:
+  def findMaximizedCapital(self, k: int, w: int, profits: list[int], capital: list[int]) -> int:
+    n = len(profits)
+    projects = list(zip(capital, profits))
+    projects.sort()
+
+    q = []
+    ptr = 0
+    for i in range(k):
+      while ptr < n and projects[ptr][0] <= w:
+        heapq.heappush(q, -projects[ptr][1])
+        ptr += 1
+      if not q:
+        break
+      w += -heapq.heappop(q)
+    return w
+
+# ********************#
+#       TEST         #
+# ********************#
+
+import unittest
+
+class TestStringMethods(unittest.TestCase):
+  def test_addBinary(self):
+    self.assertEqual(Solution.findMaximizedCapital(self, 2, 0, [1, 2, 3], [0, 1, 1]), 4)
+    self.assertEqual(Solution.findMaximizedCapital(self, 3, 0, [1, 2, 3], [0, 1, 2]), 6)
+
+if __name__ == '__main__':
+  unittest.main()

algorithms/ruby/0502-ipo.rb

@@ -0,0 +1,24 @@
+# frozen_string_literal: true
+
+# Problem: 502. IPO
+# URL: https://leetcode.com/problems/ipo
+
+# @param {Integer} k
+# @param {Integer} w
+# @param {Integer[]} profits
+# @param {Integer[]} capital
+# @return {Integer}
+def find_maximized_capital(k, w, profits, capital)
+end
+
+# ********************#
+#       TEST         #
+# ********************#
+
+require "test/unit"
+class Test_find_maximized_capital < Test::Unit::TestCase
+  def test_
+    assert_equal 4, find_maximized_capital(2, 0, [1, 2, 3], [0, 1, 1])
+    assert_equal 6, find_maximized_capital(3, 0, [1, 2, 3], [0, 1, 2])
+  end
+end