diff --git a/contains-duplicate/jun-brro.py b/contains-duplicate/jun-brro.py
new file mode 100644
index 000000000..c71a13f44
--- /dev/null
+++ b/contains-duplicate/jun-brro.py
@@ -0,0 +1,3 @@
+class Solution(object):
+    def containsDuplicate(self, nums):
+        return len(set(nums))!=len(nums)
diff --git a/top-k-frequent-elements/jun-brro.py b/top-k-frequent-elements/jun-brro.py
new file mode 100644
index 000000000..170255a76
--- /dev/null
+++ b/top-k-frequent-elements/jun-brro.py
@@ -0,0 +1,21 @@
+class Solution(object):
+    def topKFrequent(self, nums, k):
+        """
+        :type nums: List[int]
+        :type k: int
+        :rtype: List[int]
+        """
+        freq = {}
+        for n in nums:
+            freq[n] = freq.get(n, 0) + 1
+
+        buckets = [[] for _ in range(len(nums) + 1)]
+        for num, count in freq.items():
+            buckets[count].append(num)
+
+        result = []
+        for count in range(len(nums), 0, -1):
+            for num in buckets[count]:
+                result.append(num)
+                if len(result) == k:
+                    return result
diff --git a/two-sum/jun-brro.py b/two-sum/jun-brro.py
new file mode 100644
index 000000000..cb66a3f7b
--- /dev/null
+++ b/two-sum/jun-brro.py
@@ -0,0 +1,6 @@
+class Solution(object):
+    def twoSum(self, nums, target):
+        for i in range(len(nums)):
+            for j in range(i + 1, len(nums)):
+                if nums[i] + nums[j] == target:
+                    return [i, j]