diff --git a/SHREYA_MISHRA/container_with_water.java b/SHREYA_MISHRA/container_with_water.java
new file mode 100644
index 0000000..45c012c
--- /dev/null
+++ b/SHREYA_MISHRA/container_with_water.java
@@ -0,0 +1,17 @@
+class Solution {
+public int maxArea(int[] height) {
+int i=0;
+int j = height.length-1;
+int ans = 0;
+while(i<j){
+ans = Math.max(ans,(j-i)*(Math.min(height[i],height[j])));
+if(height[i]<=height[j]){
+i++;
+}
+else if(height[j]<height[i]){
+j--;
+}
+}
+return ans;
+}
+}
diff --git a/SHREYA_MISHRA/job_sequence.java b/SHREYA_MISHRA/job_sequence.java
new file mode 100644
index 0000000..c80a3a0
--- /dev/null
+++ b/SHREYA_MISHRA/job_sequence.java
@@ -0,0 +1,42 @@
+class Solution
+{
+    //Function to find the maximum profit and the number of jobs done.
+    int[] JobScheduling(Job arr[], int n)
+    {
+        int res[]=new int[2];
+        res[0]=0;
+        res[1]=0;
+        Set<Integer> slot=new HashSet<>();
+        List<Job> list=new ArrayList<>();
+        for(Job item:arr)
+            list.add(item);
+        Collections.sort(list,(n1,n2)->{
+            return n2.profit - n1.profit; 
+        });
+        for(Job job:list)
+        {
+            int dead=job.deadline;
+            if(!slot.contains(dead))
+            {
+                slot.add(dead);
+                res[0]+=1;
+                res[1]+=job.profit;
+            }
+            else
+            {
+                while(dead-->1)
+                {
+                     if(!slot.contains(dead))
+                        {
+                            slot.add(dead);
+                            res[0]+=1;
+                            res[1]+=job.profit;
+                            break;
+                        }
+                }
+            }
+        }
+        return res;
+    }
+}
+