DEV Community: Yesh Rajawat

Recursion | Count the number of Zeros in a number

Yesh Rajawat — Mon, 21 Feb 2022 12:38:38 +0000

public class CountZeros {


    public static int countZeros(int n) {
        if(n==0) {
            return 1;
        }
        else {
            return countZero(n);
        }
    }

    public static int countZero(int n) {

        if(n<10) {

            if(n==0)
            {
            return 1;}
            else {
                 return 0;
            }
        }
        else {
            int temp = n%10;
            n = n /10;
            if(temp==0) {
                return 1 + countZeros(n);
            }
            return countZeros(n);
        }


    }

    public static void main(String ... args) {

        System.out.println(countZeros(110110));

    }

}

Check whether a number is in an array or not using recursion

Yesh Rajawat — Mon, 14 Feb 2022 05:55:32 +0000

public class Check_Number {


    public static boolean checkNumber(int i , int find, int []arr) {

        if(i==arr.length) {
            return false;
        }
        else {
            if( arr[i] == find ) {

                return true;

            }
            else {

                return checkNumber(i+1,find,arr); 

            }
        }

    }

    public static void main(String ... args) {

        int [] arr = {1,2,3,4,5,6,7};
        System.out.println(checkNumber(0,10,arr));

    }
}

3 Basic Questions on Recursion

Yesh Rajawat — Sun, 13 Feb 2022 18:15:59 +0000

Print you Name N times

public class N_times {

    public static void printNTimes(int n, String name) {
        if(n==0) {
            return ;
        }
        else {
            System.out.println(name);
            printNTimes(n-1,name);
        }

    }

    public static void main(String ...args) {

        printNTimes(10,"yesh");

    }
}

Print 1 TO N in recursion

package recursion;

public class Print_N {


    public static void print_1_to_N(int n) {

        if(n==0) {
            return ;
        }
        else {

            print_1_to_N(n-1);
            System.out.println(n);
        }
    }



    public static void main(String ... args)
{

        print_1_to_N(10);
}
}

Sum of an Array


public class Sum_Of_Array {
 public static int sum_Array(int n, int[]arr){

     if(n==-1) {
         return 0;
     }
     else {

         int sum = sum_Array(n-1,arr);
         System.out.println(arr[n]+ sum);
         return arr[n] + sum;
     }

}


    public static void main(String[] args) {
        // TODO Auto-generated method stub

        int arr[] = {1,2,3,4,5,-7};
        System.out.println(sum_Array(5,arr));
    }

}

Starting With Recursion(Again)......

Yesh Rajawat — Sun, 13 Feb 2022 18:01:19 +0000

I am going to start the topic of recursion again, as placements are approaching I will be posting each and every question I solve, even if it is an beginner's question, I will make sure I write an article on it so that I will have a count of questions that I have solved and I would remember how I approached the question to solve it.

Journey begins | Jinxx

Yesh Rajawat — Sun, 06 Feb 2022 08:51:19 +0000

Day 0
I have decided to write tech related post from today, things that I will be learning, things which i get to know, interesting projects and many more. I will give my 100 percent to make sure that my blog/article comes up daily from now. I am doing this for me so that i can add an habit of writing some thing and it will also help me remember the things which I have learned, and yes it will increase my tying speed as well.