Add comprehensive LeetCode solutions index documentation

src/exercises/121.best-time-to-buy-and-sell-stock.py

@@ -0,0 +1,50 @@
+from string import *
+from re import *
+from datetime import *
+from collections import *
+from heapq import *
+from bisect import *
+from copy import *
+from math import *
+from random import *
+from statistics import *
+from itertools import *
+from functools import *
+from operator import *
+from io import *
+from sys import *
+from json import *
+from builtins import *
+import string
+import re
+import datetime
+import collections
+import heapq
+import bisect
+import copy
+import math
+import random
+import statistics
+import itertools
+import functools
+import operator
+import io
+import sys
+import json
+from typing import *
+
+
+# @leet start
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        max_profit = 0
+        min_price = float(inf)
+        for price in prices:
+            min_price = price if price < min_price else min_price
+            profit = price - min_price
+            max_profit = profit if max_profit < profit else max_profit
+        return max_profit
+
+
+# @leet end
+