Problem 1: Remove Trailing Zeros From a String

link to the problem

class Solution {
    public String removeTrailingZeros(String num) {
        while(num.length()>1){
            if(num.charAt(num.length()-1)=='0')
                num = num.substring(0, num.length()-1);
            else
                return num;
        }
        return num;
    }
}

---

Problem 2: Self Dividing Numbers

link to the problem

class Solution {
    public List<Integer> selfDividingNumbers(int left, int right) {
        List<Integer> ans = new ArrayList<>();
        for(int i=left; i<=right; i++){
            String str = Integer.toString(i);
            boolean bool = true;
            String[] substrings = str.split("");
            for(String j : substrings){
                if(j.equals("0"))
                    bool = false;
                else{
                    int num = Integer.parseInt(j);
                    if(i%num!=0)
                        bool = false;
                }
            }
            if(bool==true)
                ans.add(i);
        }
        return ans;
    }
}

---

Problem 3: Pascal's Triangle II

link to the problem

public class Solution {
    public List<Integer> getRow(int rowIndex) {
        List<Integer> res = new ArrayList<>();
        res.add(1);
        long prev = 1;
        for (int k = 1; k <= rowIndex; k++) {
            long next_val = prev * (rowIndex - k + 1) / k;
            res.add((int) next_val);
            prev = next_val;
        }
        return res;
    }
}

---

Problem 4: Is Subsequence

link to the problem

class Solution {
    public boolean isSubsequence(String s, String t) {
        for(int i=0; i<s.length(); i++){
            char ch1 = s.charAt(i);
            boolean bool = false;
            for(int j=0; j<t.length(); j++){
                char ch2 = t.charAt(j);
                if(ch1==ch2){
                    bool = true;
                    t = t.substring(j+1);
                    break;
                }
            }
            if(!bool)
                return false;
        }
        return true;
    }
}

---

Problem 5: Construct the Longest New String

link to the problem

class Solution {
    public int longestString(int x, int y, int z) {

        if(x==y)
            return ((x*2)+z)*2;

        int num = (x<y)?x:y;
        return (num+num+1+z)*2;

    }
}