#N1822. Sign of the Product of an Array
problem link

#solution

class Solution {
    public int arraySign(int[] nums) {
        long product=1;
        for(int n:nums){
            if(n<0) product = -product;
            if(n==0) return 0;
        }
        
        return signFunc(product);
    }
    
    int signFunc(long product){
        if(product > 0) return 1;
        else if(product < 0) return -1;
        else return 0;
    }
}

#medium

#N807. Max Increase to Keep City Skyline
problem link

#solution

class Solution {
    public int maxIncreaseKeepingSkyline(int[][] grid) {
        int len=grid.length, sum=0;
        int[] rowMax = new int[len];
        int[] colMax = new int[len];
        
        for(int i=0; i<len; i++)
            for(int j=0; j<len; j++)
                rowMax[i] = Math.max(rowMax[i], grid[i][j]);
        
        for(int i=0; i<len; i++)
            for(int j=0; j<len; j++)
                colMax[i] = Math.max(colMax[i], grid[j][i]);
        
        for(int i=0; i<len; i++)
            for(int j=0; j<len; j++)
                sum += Math.min(rowMax[i], colMax[j])-grid[i][j];
        
        return sum;
    }
}

#python
#N1822. Sign of the Product of an Array

#anotherSolution

class Solution:
    def arraySign(self, nums: List[int]) -> int:
        counter = 0
        for i in nums:
            if i == 0:
                return 0
            if i < 0:
                counter +=1
        return 1 if counter % 2 == 0 else -1

#N617. Merge Two Binary Trees
problem link

#solution

class Solution {
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if(root1 == null && root2 == null) return null;
        else if(root1 == null) return root2;
        else if(root2 == null) return root1;
        
        TreeNode res = new TreeNode(root1.val + root2.val);
        res.left = mergeTrees(root1.left, root2.left);
        res.right = mergeTrees(root1.right, root2.right);
        
        return res;
    }
}

#N2053. Kth Distinct String in an Array
problem link

#solution

class Solution {
    public String kthDistinct(String[] arr, int k) {
        Map<String, Integer> map = new HashMap<>();
        
        for(String s:arr){
            if(map.containsKey(s)) map.put(s, map.get(s)+1);
            else map.put(s, 1);
        }
        
        for(String s:arr){
            if(map.get(s)==1)
                if(k-- == 1)
                    return s;
        }
        
        return "";
    }
}

#recommendation
Advent of Code is a annually virtual event taking place in every December 1th-25th. Every day features new programming exercises, which can be solved in your programming language of choice.
It is full of interesting algorithmic problems, i recommend it)👍🏻

https://adventofcode.com/2021

#N1160. Find Words That Can Be Formed by Characters
problem link

#solution

class Solution {
    public int countCharacters(String[] words, String chars) {
        int sum=0;
        Map<Character, Integer> map = new HashMap<>();
        for(char ch:chars.toCharArray()){
            if(map.containsKey(ch))
                map.put(ch, map.get(ch)+1);
            else
                map.put(ch, 1);
        }
        for(String word:words){
            Map<Character, Integer> temp = new HashMap<>(map);
            boolean isGood = true;
            
            for(char ch:word.toCharArray()){
                temp.put(ch, temp.getOrDefault(ch, 0)-1);
                if(temp.get(ch)<0) {
                    isGood=false;
                    break;
                }
            }
            if(isGood) {
                sum+=word.length();
            }
        }
        
        return sum;
    }
}

#N1002. Find Common Characters
problem link

#solution

class Solution {
    public List<String> commonChars(String[] words) {
        int[][] arr = new int[words.length][26];
        int n=0;
        
        for(String word:words){
            for(char ch:word.toCharArray()){
                arr[n][ch-'a']++;
            }
            n++;
        }
        
        List<String> list = new ArrayList<>();
        
        for(int i=0; i<26; i++){
            int k=100;
            for(int j=0; j<arr.length; j++){
                k=Math.min(k, arr[j][i]);
            }
            
            while(k-- >0){
                list.add(Character.toString(i+'a'));
            }
        }
        
        return list;
    }
}

#N349. Intersection of Two Arrays
problem link

#solution

class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        int[][] arr = new int[2][1001];
        List<Integer> list = new ArrayList<>();
        
        for(int i:nums1)
            arr[0][i]++;
        
        for(int i:nums2)
            arr[1][i]++;
        
        for(int i=0; i<1001; i++){
            if(arr[0][i]*arr[1][i]>0) list.add(i);
        }
        
        int[] res = new int[list.size()];
        for(int i=0; i<list.size(); i++){
            res[i] = list.get(i);
        }
        return res;
    }
}

#N1200. Minimum Absolute Difference
problem link

#solution

class Solution {
    public List<List<Integer>> minimumAbsDifference(int[] arr) {
        Arrays.sort(arr);
        int diff = Integer.MAX_VALUE;
        
        for(int i=0; i<arr.length-1; i++)
            diff = Math.min(diff, arr[i+1] - arr[i]);
        
        List<List<Integer>> list = new ArrayList<>();
        
        for(int i=0; i<arr.length-1; i++){
            if(diff == arr[i+1] - arr[i]){
                List<Integer> sublist = new ArrayList<>();
                sublist.add(arr[i]);
                sublist.add(arr[i+1]);
                list.add(sublist);
            }
        }
        
        return list;
    }
}

#N1779. Find Nearest Point That Has the Same X or Y Coordinate
problem link

#solution

class Solution {
    public int nearestValidPoint(int x, int y, int[][] points) {
        int min=Integer.MAX_VALUE, index=-1;;
        for(int i=points.length-1; i>=0; i--){
            if(points[i][0]==x||points[i][1]==y){
                if(min>=Math.abs(points[i][0]-x)+Math.abs(points[i][1]-y)){
                    min=Math.abs(points[i][0]-x)+Math.abs(points[i][1]-y);
                    index=i;
                }
            }
        }
        
        return index;
    }
}

#N999. Available Captures for Rook
problem link

#solution

class Solution {
    public int numRookCaptures(char[][] board) {
        int Rx=0, Ry=0, count=0;;
        for(int i=0; i<8; i++){
            for(int j=0; j<8; j++){
                if(board[i][j]=='R'){
                    Rx=i;
                    Ry=j;
                }
            }
        }
        
        int[][] helper = new int[][]{{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
        
        for(int[] h:helper){
            for(int i=Rx+h[0], j=Ry+h[1]; i>=0 && i<8 && j>=0 && j<8; i+=h[0], j+=h[1]){
                if(board[i][j]=='p') count++;
                if(board[i][j]!='.') break;
            }
        }
        
        return count;
    }
}

#N1491. Average Salary Excluding the Minimum and Maximum Salary
problem link

#solution

class Solution {
    public double average(int[] salary) {
        Arrays.sort(salary);
        
        int sum=0;
        for(int i=1; i<salary.length-1; i++)
            sum+=salary[i];
        
        return (double)sum/(salary.length-2);
    }
}

#N929. Unique Email Addresses
problem link

#solution

class Solution {
    public int numUniqueEmails(String[] emails) {
        String lname, dname;
        
        Map<String, Integer> map = new HashMap<>();
        for(String email:emails){
            StringBuilder s = new StringBuilder();
            lname=email.split("@")[0];
            dname=email.split("@")[1];
            
            lname=lname.replace(".", "");
            if(lname.contains("+")) lname=lname.substring(0, lname.indexOf("+"));
            
            s.append(lname).append('@').append(dname);
            map.put(s.toString(), map.getOrDefault(s.toString(), 0) +1);
        }
        return map.size();
    }
}

#N500. Keyboard Row
problem link

#solution

class Solution {
    public String[] findWords(String[] words) {
        String row1="QWERTYUIOPqwertyuiop";
        String row2="ASDFGHJKLasdfghjkl";
        String row3="ZXCVBNMzxcvbnm";
        List<String> list = new ArrayList<>();
        for(String word:words){
            int[][] counter = new int[1][3];
            for(int i=0; i<word.length(); i++){
                if(row1.contains(word.valueOf(word.charAt(i))))
                    counter[0][0]++;
                if(row2.contains(word.valueOf(word.charAt(i))))
                    counter[0][1]++;
                if(row3.contains(word.valueOf(word.charAt(i))))
                    counter[0][2]++;
            }
            if(counter[0][0]==word.length()||counter[0][1]==word.length()||counter[0][2]==word.length()) list.add(word);
        }
        return list.toArray(new String[0]);
    }
}

#N766. Toeplitz Matrix
problem link

#solution

class Solution {
    public boolean isToeplitzMatrix(int[][] matrix) {
        for(int i=0; i<matrix.length-1; i++){
            for(int j=0; j<matrix[i].length-1; j++){
                if(matrix[i][j]!=matrix[i+1][j+1]) return false;
            }
        }
        
        return true;
    }
}

#N908. Smallest Range I
problem link

#solution

class Solution {
    public int smallestRangeI(int[] nums, int k) {
        int max=nums[0], min=nums[0];
        for(int n:nums){
            max = Math.max(max, n);
            min = Math.min(min, n);
        }
        return Math.max(max-min-2*k, 0); 
    }
}

#N1385. Find the Distance Value Between Two Arrays
problem link

#solution

class Solution {
    public int findTheDistanceValue(int[] arr1, int[] arr2, int d) {
        int res=0, l=arr2.length;
        
        Arrays.sort(arr1); Arrays.sort(arr2);
        for(int n:arr1){
            int count=0, start=0, end=l-1;
            while(start<=end){
                int mid=(start+end)/2;
                if(Math.abs(arr2[mid]-n)<=d) {
                    count++;
                    break;
                }
                if(arr2[mid]>n+d) end=mid-1;
                if(arr2[mid]<n-d) start=mid+1;
                
            }
            if(count==0) res++;
        }
        
        return res;
    }
}

#N575. Distribute Candies
problem link

#solution

class Solution {
    public int distributeCandies(int[] candyType) {
        Set<Integer> set = new HashSet<>();
        
        for(int candy:candyType)
            set.add(candy);
        
        return Math.min(set.size(), candyType.length/2);
    }
}

#N1800. Maximum Ascending Subarray Sum
problem link

#solution

class Solution {
    public int maxAscendingSum(int[] nums) {
        List<Integer> sumlist = new ArrayList<>();
        int sum=0, i=0;
        
        for(; i<nums.length-1; i++){
            if(nums[i]<nums[i+1]){
                sum+=nums[i];
            }else{
                sum+=nums[i];
                sumlist.add(sum);
                sum=0;
            }
        }
        sum+=nums[i];
        sumlist.add(sum);
        
        int max=sumlist.get(0);
        for(int n:sumlist)
            max=Math.max(max, n);
        
        return max;
    }
}