diff --git a/contains-duplicate/wisdom08.py b/contains-duplicate/wisdom08.py
new file mode 100644
index 000000000..101a4be52
--- /dev/null
+++ b/contains-duplicate/wisdom08.py
@@ -0,0 +1,7 @@
+class Solution(object):
+    def containsDuplicate(self, nums):
+        set_nums = set(nums)
+        if len(nums) == len(set_nums):
+            return False
+        else:
+            return True
diff --git a/longest-consecutive-sequence/wisdom08.py b/longest-consecutive-sequence/wisdom08.py
new file mode 100644
index 000000000..9b927eaab
--- /dev/null
+++ b/longest-consecutive-sequence/wisdom08.py
@@ -0,0 +1,10 @@
+def longestConsecutive(nums):
+    longest = 0
+
+    for num in nums:
+        length = 1
+        while num + length in nums:
+            length += 1
+        longest = max(longest, length)
+
+    return longest
diff --git a/top-k-frequent-elements/wisdom08.py b/top-k-frequent-elements/wisdom08.py
new file mode 100644
index 000000000..c941799d3
--- /dev/null
+++ b/top-k-frequent-elements/wisdom08.py
@@ -0,0 +1,10 @@
+def topKFrequent(nums, k):
+    frequency = {}
+    for num in nums:
+        frequency[num] = frequency.get(num, 0) + 1
+
+    sorted_frequency = sorted(frequency, key=lambda num: frequency[num])
+    return sorted_frequency[-k:]
+
+
+print(topKFrequent([1, 1, 1, 2, 2, 3], 2))
diff --git a/two-sum/wisdom08.py b/two-sum/wisdom08.py
new file mode 100644
index 000000000..5afd21f57
--- /dev/null
+++ b/two-sum/wisdom08.py
@@ -0,0 +1,9 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        dict = {}
+        for i, v in enumerate(nums):
+            diff = target - v
+            if diff in dict:
+                return [i, dict[diff]]
+            else:
+                dict[v] = i