Set up template for second solution

Author: KwonNayeon

top-k-frequent-elements/KwonNayeon.py

@@ -1,21 +1,17 @@
 """
-Title: 237. Top K Frequent Elements
-Link: https://leetcode.com/problems/top-k-frequent-elements/
-
-Question:
-    - Given an integer array `nums` and an integer `k`, return the `k` most frequent elements.
-    - You may return the answer in any order.
+Problem: 237. Top K Frequent Elements
 
 Constraints:
-    - 1 <= nums.length <= 10^5
-    - -10^4 <= nums[i] <= 10^4
-    - k is in the range [1, the number of unique elements in the array].
-    - The answer is guaranteed to be unique.
+- 1 <= nums.length <= 10^5
+- -10^4 <= nums[i] <= 10^4
+- k is in the range [1, the number of unique elements in the array].
+- The answer is guaranteed to be unique.
+
+Time Complexity: O(n log n)
+- 
 
-Time Complexity:
-    - O(n log n)
-Space Complexity:
-    - O(n)
+Space Complexity: O(n)
+- 
 """
 
 # Original Solution

validate-binary-search-tree/KwonNayeon.py

@@ -3,6 +3,7 @@
 - The number of nodes in the tree is in the range [1, 10^4].
 - -2^31 <= Node.val <= 2^31 - 1
 
+<Solution 1: 재귀>
 Time Complexity: O(n)
 - 트리의 모든 노드를 한 번씩 방문함
 
@@ -40,3 +41,11 @@ def validate(node, min_val, max_val):
 
         return validate(root, float("-inf"), float("inf"))
 
+"""
+<Solution 2: 반복문>
+Time Complexity: 
+- 
+
+Space Complexity: 
+- 
+"""