Update README.md with new LeetCode problems and reorder table by problem number

src/exercises/104.maximum-depth-of-binary-tree.py

@@ -0,0 +1,62 @@
+# @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
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def maxDepth(self, root: Optional[TreeNode]) -> int:
+        if root == None:
+            return 0
+        
+        def deep(r, l, c):
+            cl = c
+            cr = c
+            if r:
+                cr = deep(r.right, r.left, c + 1)
+            if l:
+                cl = deep(l.right, l.left, c + 1)
+                
+            return max(cl, cr)
+        return deep(root.right, root.left, 0) + 1
+
+        
+# @leet end

src/exercises/274.h-index.py

@@ -0,0 +1,51 @@
+# @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 hIndex(self, citations: List[int]) -> int:
+        citations.sort()
+        citation = len(citations)
+        for i in range(len(citations)):
+            if citations[i] >= citation - i:
+                return citation - i
+        return 0
+
+
+# @leet end