Merge pull request #1749 from Lyla-Dev/main

[LylaDev] WEEK 02 solutions

Author: Lyla-Dev

climbing-stairs/Lyla-Dev.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int climbStairs(int n) {
+        if (n == 1) {
+            return 1;
+        }
+        int[] dp = new int[n + 1];
+
+        dp[1] = 1;
+        dp[2] = 2;
+
+        for (int i = 3; i <= n; i++) {
+            dp[i] = dp[i - 1] + dp[i - 2];
+        }
+
+        return dp[n];
+    }
+}

product-of-array-except-self/Lyla-Dev.java

@@ -0,0 +1,26 @@
+class Solution {
+    public int[] productExceptSelf(int[] nums) {
+        int[] answer = new int[nums.length];
+        int[] front = new int[nums.length];
+        int[] back = new int[nums.length];
+
+        for (int i = 0; i < nums.length; i++) {
+            front[i] = 1;
+            back[i] = 1;
+        }
+
+        for (int i = 0; i < nums.length - 1; i++) {
+            front[i + 1] = front[i] * nums[i];
+        }
+
+        for (int i = nums.length - 1; i > 0; i--) {
+            back[i - 1] = nums[i] * back[i];
+        }
+
+        for (int i = 0; i < nums.length; i++) {
+            answer[i] = front[i] * back[i];
+        }
+
+        return answer;
+    }
+}