diff --git a/submissions/Noman/Two_sum/Screenshot.png b/submissions/Noman/Two_sum/Screenshot.png new file mode 100644 index 0000000..b5a6c85 Binary files /dev/null and b/submissions/Noman/Two_sum/Screenshot.png differ diff --git a/submissions/Noman/Two_sum/Solution.java b/submissions/Noman/Two_sum/Solution.java new file mode 100644 index 0000000..1a8b46d --- /dev/null +++ b/submissions/Noman/Two_sum/Solution.java @@ -0,0 +1,14 @@ +class Solution { + public int[] twoSum(int[] nums, int target) { + Map map = new HashMap<>(); + for (int i = 0; i < nums.length; i++) { + int complement = target - nums[i]; + if (map.containsKey(complement)) { + return new int[] { map.get(complement), i }; + } + map.put(nums[i], i); + } + // Return an empty array if no solution is found + return new int[] {}; + } +} diff --git a/submissions/Noman/fibonacci-number/Screenshot.png b/submissions/Noman/fibonacci-number/Screenshot.png new file mode 100644 index 0000000..257b349 Binary files /dev/null and b/submissions/Noman/fibonacci-number/Screenshot.png differ diff --git a/submissions/Noman/fibonacci-number/Solution.java b/submissions/Noman/fibonacci-number/Solution.java new file mode 100644 index 0000000..50716a8 --- /dev/null +++ b/submissions/Noman/fibonacci-number/Solution.java @@ -0,0 +1,7 @@ +class Solution { + public int fib(int n) { + double sqrt5 = Math.sqrt(5); + double fibN = Math.pow((1 + sqrt5) / 2, n) - Math.pow((1 - sqrt5) / 2, n); + return (int) Math.round(fibN / sqrt5); + } +} \ No newline at end of file