feat: Set up Week 1 problems

Adds the initial boilerplate files for the week 1 problems, including:
- Contains Duplicate (Easy)
- Two Sum (Easy)
- Top K Frequent Elements (Medium)
- Longest Consecutive Sequence (Medium)
- House Robber (Medium)

Author: renovizee

contains-duplicate/renovizee.java

@@ -0,0 +1,9 @@
+
+// https://github.com/DaleStudy/leetcode-study/issues/217
+// https://leetcode.com/problems/contains-duplicate/
+class Solution {
+    public boolean containsDuplicate(int[] nums) {
+
+        return true;
+    }
+}

house-robber/renovizee.java

@@ -0,0 +1,9 @@
+
+// https://github.com/DaleStudy/leetcode-study/issues/264
+// https://leetcode.com/problems/house-robber/
+class Solution {
+    public int rob(int[] nums) {
+
+        return 1;
+    }
+}

longest-consecutive-sequence/renovizee.java

@@ -0,0 +1,10 @@
+
+// https://github.com/DaleStudy/leetcode-study/issues/240
+// https://leetcode.com/problems/longest-consecutive-sequence/
+class Solution {
+    public int longestConsecutive(int[] nums) {
+
+        return 1;
+
+    }
+}

top-k-frequent-elements/renovizee.java

@@ -0,0 +1,10 @@
+
+// https://github.com/DaleStudy/leetcode-study/issues/237
+// https://leetcode.com/problems/top-k-frequent-elements/
+class Solution {
+    public int[] topKFrequent(int[] nums, int k) {
+        int[] result = {1, 2, 3};
+
+        return result;
+    }
+}

two-sum/renovizee.java

@@ -0,0 +1,11 @@
+
+// https://github.com/DaleStudy/leetcode-study/issues/219
+// https://leetcode.com/problems/two-sum/description/
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        int[] result = {11, 2};
+
+        return result;
+
+    }
+}