diff --git a/Submissions/Rakshita Khare/BestTimeToBuyAndSellStock/Screenshot.png b/Submissions/Rakshita Khare/BestTimeToBuyAndSellStock/Screenshot.png
new file mode 100644
index 0000000..335d7dc
Binary files /dev/null and b/Submissions/Rakshita Khare/BestTimeToBuyAndSellStock/Screenshot.png differ
diff --git a/Submissions/Rakshita Khare/BestTimeToBuyAndSellStock/solution.java b/Submissions/Rakshita Khare/BestTimeToBuyAndSellStock/solution.java
new file mode 100644
index 0000000..c9364dc
--- /dev/null
+++ b/Submissions/Rakshita Khare/BestTimeToBuyAndSellStock/solution.java	
@@ -0,0 +1,13 @@
+class Solution {
+    public int maxProfit(int[] prices) {
+        int maxProfit = 0;
+        int bestBuy = prices[0];
+        for(int i=1;i<prices.length;i++)
+        {
+            if(prices[i]>bestBuy)
+                maxProfit = Math.max(maxProfit,prices[i]-bestBuy);
+            bestBuy = Math.min(bestBuy,prices[i]);
+        }
+        return maxProfit;
+    }
+}
\ No newline at end of file
diff --git a/Submissions/Rakshita Khare/ProductOfTheArrayExceptSelf/Screenshot.png b/Submissions/Rakshita Khare/ProductOfTheArrayExceptSelf/Screenshot.png
new file mode 100644
index 0000000..9d3227a
Binary files /dev/null and b/Submissions/Rakshita Khare/ProductOfTheArrayExceptSelf/Screenshot.png differ
diff --git a/Submissions/Rakshita Khare/ProductOfTheArrayExceptSelf/solutions.java b/Submissions/Rakshita Khare/ProductOfTheArrayExceptSelf/solutions.java
new file mode 100644
index 0000000..e191b79
--- /dev/null
+++ b/Submissions/Rakshita Khare/ProductOfTheArrayExceptSelf/solutions.java	
@@ -0,0 +1,26 @@
+class Solution {
+    public int[] productExceptSelf(int[] nums) {
+        int prefix[] = new int[nums.length];
+        int suffix[] = new int[nums.length];
+        for(int i=0;i<nums.length;i++)
+        {
+            suffix[i] = 1;
+            prefix[i] = 1;
+        }
+        for(int i=1;i<nums.length;i++)
+        {
+            prefix[i] = prefix[i-1]*nums[i-1];
+        }
+        for(int i=nums.length-2;i>-1;i--)
+        {
+            suffix[i] = suffix[i+1]*nums[i+1];
+        }
+
+        int ans[] = new int[nums.length];
+        for(int i=0;i<nums.length;i++)
+        {
+            ans[i] = prefix[i]*suffix[i];
+        }
+        return ans;
+    }
+}
\ No newline at end of file