Merge branch 'master' of https://github.com/Sunchit/Coding-Decoded

Author: Sunchit

Leetcode2023/April2023/C++/1046.LastStoneWeight.cpp

@@ -0,0 +1,17 @@
+class Solution {
+public:
+    int lastStoneWeight(vector<int>& stones) {
+        
+        int n = stones.size();
+        priority_queue<int>pq(stones.begin(),stones.end());
+        
+        while(pq.size()>1)
+        {
+            int a = pq.top(); pq.pop();
+            int b = pq.top(); pq.pop();
+            int c = a-b;
+            pq.push(c);
+        }
+        return pq.top();
+    }
+};

Leetcode2023/April2023/Java/AddDigits.java

@@ -0,0 +1,17 @@
+// Author: Mahesh Reddy B N
+
+// Problem Link: https://leetcode.com/problems/add-digits/description/
+
+class Solution {
+    public int addDigits(int num) {
+        while(num>=10){
+            int x = 0;
+            while(num>0){
+                x+= num%10;
+                num = num/10;
+            }
+            num = x;
+        }
+        return num;
+    }
+}   

Leetcode2023/April2023/Java/BulbSwitcher.java

@@ -0,0 +1,9 @@
+// Author: Mahesh Reddy B N
+
+// Problem Link: https://leetcode.com/problems/bulb-switcher/
+
+class Solution {
+    public int bulbSwitch(int n) {
+        return (int)Math.sqrt(n);
+    }
+}

Leetcode2023/April2023/Java/LastStoneWeight.java

@@ -0,0 +1,20 @@
+Author: Mahesh Reddy BN
+
+Problem Link: https://leetcode.com/problems/last-stone-weight/description/
+class Solution {
+    public int lastStoneWeight(int[] stones) {
+        PriorityQueue<Integer> pq = new PriorityQueue<>((a,b) -> b - a);
+        for(int i:stones){
+            pq.add(i);
+        }
+        while(pq.size()>1){
+            int a = pq.remove();
+            int b = pq.remove();
+            if(a!=b){
+                pq.add(a-b);
+            }
+        }
+        if(pq.size()==0) return 0;
+        return pq.remove();
+    }
+}

Leetcode2023/April2023/Java/SmallestNumberinInfiniteSet.java

@@ -0,0 +1,20 @@
+Author: Mahesh Reddy BN
+
+Problem Link: https://leetcode.com/problems/smallest-number-in-infinite-set/description/
+
+class SmallestInfiniteSet {
+    TreeSet<Integer> ts;
+    public SmallestInfiniteSet() {
+        ts = new TreeSet<>();
+        for(int i=1;i<=1000;i++){
+            ts.add(i);
+        }
+    }
+    public int popSmallest() {
+        return ts.pollFirst();
+    }
+    
+    public void addBack(int num) {
+        ts.add(num);
+    }
+}

Leetcode2023/May2023/Java/MatrixDiagonalSum.java

@@ -0,0 +1,20 @@
+// Author: Mahesh Reddy B N
+// Problem Link: https://leetcode.com/problems/matrix-diagonal-sum/description/
+
+class Solution {
+    public int diagonalSum(int[][] mat) {
+        int ans = 0;
+        int j =0;
+        int k = mat.length-1;
+        for(int i=0;i<mat.length;i++){
+            ans+= mat[i][j];
+            ans+=mat[k][i];
+            if(i==k){
+                ans-=mat[k][i];
+            }
+            k--;
+            j++;
+        }
+        return ans;
+    }
+}