Add comprehensive LeetCode solutions index documentation

src/exercises/35.search-insert-position.py

@@ -0,0 +1,55 @@
+# @leet imports start
+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 imports end
+
+# @leet start
+class Solution:
+    def searchInsert(self, nums: List[int], target: int) -> int:
+        if nums[-1] < target:
+            return len(nums)
+        mn = 0 
+        mx = len(nums) - 1
+
+        while mn < mx:
+            mid = (mx + mn) // 2
+            if target > nums[mid]:
+                mn = mid + 1
+            else:
+                mx = mid
+            
+        return mn
+        
+# @leet end