greeting();
    }
    static void greeting() {
        System.out.println("Hello World");
    }
}

            

Reported by PMD.

              package com.kunal;

public class Greeting {
    public static void main(String[] args) {
        greeting();
    }
    static void greeting() {
        System.out.println("Hello World");
    }

            

Reported by PMD.

                  }

    static void greet(String naam) {
        System.out.println(naam);
    }
}

            

Reported by PMD.

              package com.kunal;

public class PassingExample {
    public static void main(String[] args) {
        String chacha = "Iron Man";
        greet(chacha);
    }

    static void greet(String naam) {

            

Reported by PMD.

              
        // for loop
        for(int count = 1; count != 5; count++) {
            System.out.println(count);
        }
    }
}

            

Reported by PMD.

              package com.kunal;

public class Basics {
    public static void main(String[] args) {
//        int a = 10;
//        if (a == 10) {
//            System.out.println("Hello World");
//        }
//        int count = 1;

            

Reported by PMD.

                      int[] arr = {2, 3, 5, 9, 14, 16, 18};
        int target = 1;
        int ans = floor(arr, target);
        System.out.println(ans);
    }

    // return the index: greatest number <= target
    static int floor(int[] arr, int target) {
        int start = 0;

            

Reported by PMD.

              package com.kunal;

public class Floor {

    public static void main(String[] args) {
        int[] arr = {2, 3, 5, 9, 14, 16, 18};
        int target = 1;
        int ans = floor(arr, target);
        System.out.println(ans);

            

Reported by PMD.

                      int[] arr = {2, 3, 5, 9, 14, 16, 18};
        int target = 15;
        int ans = ceiling(arr, target);
        System.out.println(ans);
    }

    // return the index of smallest no >= target
    static int ceiling(int[] arr, int target) {


            

Reported by PMD.

              package com.kunal;

public class Ceiling {

    public static void main(String[] args) {
        int[] arr = {2, 3, 5, 9, 14, 16, 18};
        int target = 15;
        int ans = ceiling(arr, target);
        System.out.println(ans);

            

Reported by PMD.

              	    int[] nums = {23, 45, 1, 2, 8, 19, -3, 16, -11, 28};
	    int target = 19;
	    int ans = linearSearch(nums, target);
        System.out.println(ans);
    }

    // search the target and return true or false
    static boolean linearSearch3(int[] arr, int target) {
        if (arr.length == 0) {

            

Reported by PMD.

              package com.kunal;

public class Main {

    public static void main(String[] args) {
	    int[] nums = {23, 45, 1, 2, 8, 19, -3, 16, -11, 28};
	    int target = 19;
	    int ans = linearSearch(nums, target);
        System.out.println(ans);

            

Reported by PMD.

              public class Demo {
    public static void main(String[] args) {
        System.out.println(args[1]);
    }
}
            

Reported by PMD.

              public class Demo {
    public static void main(String[] args) {
        System.out.println(args[1]);
    }
}
            

Reported by PMD.

                  }
    // https://leetcode.com/problems/peak-index-in-a-mountain-array/
    // https://leetcode.com/problems/find-peak-element/
    public int peakIndexInMountainArray(int[] arr) {
        int start = 0;
        int end = arr.length - 1;

        while (start < end) {
            int mid = start + (end - start) / 2;

            

Reported by PMD.

                  public static void main(String[] args) {

    }
    public int maximumWealth(int[][] accounts) {
        // person = rol
        // account = col
        int ans = Integer.MIN_VALUE;
        for (int[] ints : accounts) {
            // when you start a new col, take a new sum for that row

            

Reported by PMD.