From 7ccfc0afe77aa982fff3325c9a8dd3fa51594441 Mon Sep 17 00:00:00 2001
From: Shivangitrivedi121
 <122510775+Shivangitrivedi121@users.noreply.github.com>
Date: Tue, 22 Oct 2024 13:19:33 +0530
Subject: [PATCH] Add files via upload

---
 Day1.java |  91 ++++++++++++++++++++++++++++++++++++++++++++++++
 Day2.java | 102 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 193 insertions(+)
 create mode 100644 Day1.java
 create mode 100644 Day2.java

diff --git a/Day1.java b/Day1.java
new file mode 100644
index 00000000..46212d37
--- /dev/null
+++ b/Day1.java
@@ -0,0 +1,91 @@
+                                                          //Separate White And Black balls
+/**class Solution {
+    public long minimumSteps(String s) {
+        long swap = 0;
+        int black = 0; 
+        for (int i = 0; i < s.length(); i++) {
+            if (s.charAt(i) == '0') 
+                swap += (long) black; 
+            else
+                black++; 
+        }
+        return swap;
+    }
+}*/
+
+                                                           // Valid Anagram
+/*class Solution {
+    public boolean isAnagram(String s, String t) {
+        int s1= s.length();
+        int t1 = t.length();
+        if(s1 != t1){
+            return false;
+        }
+        int[] arr = new int [26];
+        for(int i =0; i<s.length();i++){
+            arr[s.charAt(i) - 'a']++;
+
+        }
+          for(int i =0; i<t.length();i++){
+            arr[t.charAt(i) - 'a']--;
+            if(arr[t.charAt(i) - 'a'] < 0){
+                return false;
+            }
+       
+    }
+
+return true; 
+}
+}*/
+
+
+                                                 //Remove Dublicates from sorted list 
+
+/*class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if(head==null)
+        return head;
+        ListNode prev = head,curr = head.next;
+        while(curr!=null){
+            if(prev.val==curr.val){
+                prev.next = curr.next;
+                curr = curr.next;
+            }
+            else{
+                prev = curr;
+                curr = curr.next;
+            }
+        }
+        
+        return head;
+        
+    }
+}*/
+
+                                                    //Maximum Swap
+/*class Solution {
+
+    public int maximumSwap(int num) {
+        String numStr = Integer.toString(num); 
+        int n = numStr.length();
+        int maxNum = num; 
+
+       
+        for (int i = 0; i < n; ++i) {
+            for (int j = i + 1; j < n; ++j) {
+                char[] numeral = numStr.toCharArray(); 
+
+                
+                char temp = numeral[i];
+                numeral[i] = numeral[j];
+                numeral[j] = temp;
+
+                int tempNum = Integer.parseInt(new String(numeral)); 
+                maxNum = Math.max(maxNum, tempNum);
+        }
+        }
+
+        return maxNum; 
+    }
+}
+/* */
\ No newline at end of file
diff --git a/Day2.java b/Day2.java
new file mode 100644
index 00000000..ba6d919e
--- /dev/null
+++ b/Day2.java
@@ -0,0 +1,102 @@
+                                                     //Array Partition
+/*class Solution {
+    public int arrayPairSum(int[] nums) {
+        int a =0;
+        Arrays.sort(nums);
+        for(int i=0; i<nums.length;i+=2){
+            a += nums[i];
+        }
+
+       return a;
+        
+    }
+}*/
+
+
+                                                    //Find the difference
+
+/*class Solution {
+    public char findTheDifference(String s, String t) {
+        char ans = 0;
+        for(char ch : s.toCharArray()){
+            ans ^= ch;
+
+        }
+         for(char ch : t.toCharArray()) {
+            ans ^= ch;
+        }
+        return ans;
+
+
+        
+    }
+}*/
+
+                                              //Intersection of two Arrays
+
+/*class Solution {
+    public int[] intersection(int[] nums1, int[] nums2) {
+        HashSet<Integer> set = new HashSet<>();
+        for(int n2 : nums2){
+            set.add(n2);
+        }
+        ArrayList<Integer> list = new ArrayList<>();
+        for (int n1:nums1){
+            if(set.contains(n1)){
+                list.add(n1);
+                set.remove(n1);
+            }
+        }
+        int res[] = new int [list.size()];
+        for(int i = 0; i<list.size();i++){
+            res[i] = list.get(i);
+        }
+        return res;
+    }
+}*/
+
+                                                    // Assign Cookies
+/*class Solution {
+    public int findContentChildren(int[] g, int[] s) {
+        Arrays.sort(g);
+        Arrays.sort(s);
+
+        int m = g.length;
+        int n = s.length;
+
+        int i = 0 , j= 0;
+        while( i< m && j<n){
+            if(g[i] <= s[j]){
+                i++;
+            }
+            j++;
+
+        }
+        return i;
+        
+    }
+}*/
+
+
+//Buy two chocolets
+/*class Solution {
+    public int buyChoco(int[] prices, int money) {
+        int first = 999;
+        int second = 999;
+        for(int price:prices)
+       {
+        if(price<=first){
+            second = first;
+            first = price;
+        }
+        else if(price < second )
+        second = price;
+       }
+       int total = first + second ;
+       if(total <=money)
+       return money-total;
+       else
+       return money;
+    }   
+    }*/
+