main

Author: nanawarevishal

.vscode/settings.json

@@ -9,6 +9,7 @@
         "5.ControlStatement\\ifElse\\Assignments",
         "5.ControlStatement\\ifElse\\ClassCodes",
         "6.String",
-        "7.InputOutput"
+        "7.InputOutput",
+        "8,Method"
     ]
 }

3.Array/LeetCode/program65.java

@@ -0,0 +1,61 @@
+
+
+/*
+
+        35. Search Insert Position
+        Easy
+        13.3K
+        580
+        Companies
+        Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
+
+        You must write an algorithm with O(log n) runtime complexity.
+
+        Example 1:
+        Input: nums = [1,3,5,6], target = 5
+        Output: 2
+
+        Example 2:
+        Input: nums = [1,3,5,6], target = 2
+        Output: 1
+
+        Example 3:
+        Input: nums = [1,3,5,6], target = 7
+        Output: 4
+
+ */
+
+
+
+package LeetCode;
+public class program65 {
+
+    static int searchInsert(int[] nums, int target) {
+        
+        for(int i=0;i<nums.length;i++){
+
+            if(nums[i]==target){
+                return i;
+            }
+
+            if(nums[i]>target){
+                return i;
+            }
+
+            if(i==nums.length-1){
+                return i+1;
+            }
+        }
+
+        return -1;
+    }
+
+    public static void main(String[] args) {
+        
+        int nums[] = {1,3,5,6};
+        int target = 5;
+
+        System.out.println(searchInsert(nums, target));
+
+    }
+}

3.Array/LeetCode/program66.java

@@ -0,0 +1,42 @@
+
+/*
+ 51. N-Queens
+        Hard
+        10.1K
+        223
+        Companies
+        The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.
+
+        Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order.
+
+        Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.
+
+        Example 1:
+        Input: n = 4
+        Output: [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]
+        Explanation: There exist two distinct solutions to the 4-queens puzzle as shown above
+
+
+        Example 2:
+        Input: n = 1
+        Output: [["Q"]]
+
+ */
+
+
+
+
+package LeetCode;
+
+
+public class program66 {
+    public List<List<String>> solveNQueens(int n) {
+        
+        List<List<String>>ls = new List<>();
+
+       List<String>obj = new List<>();
+
+
+        return ls;
+    }
+}

7.InputOutput/ClassCodes/program15.java

@@ -0,0 +1,21 @@
+package ClassCodes;
+
+import java.util.Scanner;
+import java.util.StringTokenizer;
+
+public class program15 {
+    public static void main(String[] args) {
+        
+        Scanner sc = new Scanner(System.in);
+
+        System.out.println("Enter the player: ");
+        String str = sc.nextLine();
+
+       StringTokenizer st = new StringTokenizer(str, " ");
+
+       while(st.hasMoreElements()){
+
+            System.out.println(st.nextElement());
+       }
+    }
+}

8,Method/ClassCodes/program1.java

@@ -0,0 +1,34 @@
+
+package ClassCodes;
+
+public class program1 {
+
+    int x =10;
+    static void fun(){
+        System.out.println("Inside Fun method...!");
+    }
+
+    void gun(){
+        System.out.println("Inside gun method..!");
+        fun();
+    }
+
+    public static void main(String[] args) {
+        
+        program1 obj = new program1();
+
+        gun();
+    }
+}
+
+
+
+/*
+
+        program1.java:20: error: non-static method gun() cannot be referenced from a static context
+                gun();
+                ^
+        1 error
+        error: compilation failed
+        
+ */