changes for build

src/Coding Questions/Leetcode/AddtwoNumbers.java

@@ -8,6 +8,9 @@
 Memory Usage: 48.3 MB, less than 21.62% of Java online submissions for Add Two Numbers.
  * 
  */
+
+import DS.ListNode;
+
 public class AddtwoNumbers {
 
     public static void main(String[] args) {

src/Coding Questions/Leetcode/DS/ListNode.java

@@ -0,0 +1,14 @@
+package DS;
+
+/**
+ * Definition for singly-linked list.
+ * 
+ */
+     public class ListNode {
+      public int val;
+      public ListNode next;
+      public ListNode() {}
+      public ListNode(int val) { this.val = val; }
+      public ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+  }
+

src/Coding Questions/Leetcode/DeletetheMiddleNodeofaLinkedList.java

@@ -1,3 +1,5 @@
+import DS.ListNode;
+
 /**
 2095. Delete the Middle Node of a Linked List
 Solved

src/Coding Questions/Leetcode/KthLargestSuminaBinaryTree.java

@@ -17,6 +17,8 @@ Return the kth largest level sum in the tree (not necessarily distinct). If ther
 import java.util.Arrays;
 import java.util.Collections;
 
+import DS.TreeNode;
+
 /**
  * Definition for a binary tree node.
  * public class TreeNode {

src/Coding Questions/Leetcode/LeafSimilarTrees.java

@@ -11,6 +11,8 @@
 import java.util.ArrayList;
 import java.util.List;
 
+import DS.TreeNode;
+
 /**
  * Definition for a binary tree node.
  * public class TreeNode {
@@ -26,7 +28,7 @@
  *     }
  * }
  */
-class Solution {
+public class LeafSimilarTrees {
 
     public boolean leafSimilar(TreeNode root1, TreeNode root2) {
 

src/Coding Questions/Leetcode/LongestHappyString.java

@@ -19,7 +19,7 @@
 
   **/
 
-class Solution {
+public class LongestHappyString {
     public String longestDiverseString(int a, int b, int c) {
         StringBuilder sb = new StringBuilder();
 

src/Coding Questions/Leetcode/LongestSquareStreakinanArray.java

@@ -44,7 +44,7 @@ The map mp may store up to O(n) entries (for each unique number in nums), giving
 Square Check and Update: For each number, we check if it’s a perfect square and if its square root has a streak in the map, extending that streak if both conditions are met. Otherwise, we initialize a new streak.
 Result Calculation: The maximum streak length is updated continuously, so at the end, res contains the length of the longest square streak.
   **/
-class Solution {
+public class LongestSquareStreakinanArray {
     public int longestSquareStreak(int[] nums) {
         Map<Integer, Integer> mp = new HashMap<>();
         Arrays.sort(nums);

src/Coding Questions/Leetcode/LongestValidParentheses.java

@@ -11,7 +11,7 @@
 .
 
  */
-class Solution {
+public class LongestValidParentheses {
     public int longestValidParentheses(String s) {
         Stack<Integer> stack = new Stack<>();
         stack.push(-1);

src/Coding Questions/Leetcode/LongestZigZagPathinaBinaryTree.java

@@ -19,6 +19,8 @@ Choose any node in the binary tree and a direction (right or left).
 
  **/
 
+import DS.TreeNode;
+
 /**
  * Definition for a binary tree node.
  * public class TreeNode {
@@ -34,7 +36,7 @@ Choose any node in the binary tree and a direction (right or left).
  *     }
  * }
  */
-class Solution {
+public class LongestZigZagPathinaBinaryTree {
     int count=0;
     public int longestZigZag(TreeNode root) {
 

src/Coding Questions/Leetcode/MajorityElementFast.java

@@ -12,7 +12,7 @@
 The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.
 
 **/
-class Solution {
+public class MajorityElementFast {
     public int majorityElement(int[] nums) {
 
         Map<Integer,Integer> a = new HashMap<>();

src/Coding Questions/Leetcode/MakeSumDivisible.java

@@ -15,7 +15,7 @@ Given an array of positive integers nums, remove the smallest subarray (possibly
 
 import java.util.HashMap;
 
-class MakeSumDivisible {
+public class MakeSumDivisible {
     public int minSubarray(int[] nums, int p) {
         long totalSum = 0;
         for (int num : nums) {

src/Coding Questions/Leetcode/MaxAverageArray.java

@@ -19,7 +19,7 @@
 **/
 
 
-class MaxAverageArray {
+public class MaxAverageArray {
     public double findMaxAverage(int[] nums, int k) {
 
       double sum = Integer.MIN_VALUE;

src/Coding Questions/Leetcode/MaxCandies.java

@@ -33,7 +33,7 @@
 
 **/
 
-class MaxCandies {
+public class MaxCandies {
     public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
        ArrayList<Boolean> ans=new ArrayList<>();
        int max=0;

src/Coding Questions/Leetcode/MaxConsecutive.java

@@ -26,7 +26,7 @@
 
 **/
 
-class MaxConsecutive {
+public class MaxConsecutive {
     public int longestOnes(int[] nums, int k) {
 
         int left = 0, right = 0, max = 0, kc = k;

src/Coding Questions/Leetcode/MaxKPairs.java

@@ -35,7 +35,7 @@
 
 **/
 
-class MaxKPairs {
+public class MaxKPairs {
     public int maxOperations(int[] nums, int k) {
         int res=0;
         int l=0;

src/Coding Questions/Leetcode/MaWidthramp.java → src/Coding Questions/Leetcode/MaxWidthramp.java

@@ -17,7 +17,7 @@
 Dishes can be prepared in any order and the chef can discard some dishes to get this maximum value.
  */
 
- class Solution {
+ public class MaxWidthramp {
     public int maxWidthRamp(int[] nums) {
         int n = nums.length;
         Stack<Integer> stack = new Stack<>();

src/Coding Questions/Leetcode/MaximalScoreAfterApplyingKOperations.java

@@ -20,7 +20,7 @@ replace nums[i] with ceil(nums[i] / 3).
 The ceiling function ceil(val) is the least integer greater than or equal to val.
 
   **/
-class Solution {
+public class MaximalScoreAfterApplyingKOperations {
     public long maxKelements(int[] nums, int k) {
     PriorityQueue<Integer>pq = new PriorityQueue<>((a, b)->b-a);
     for(int x : nums)

src/Coding Questions/Leetcode/MaximumDepthofBinaryTree.java

@@ -10,6 +10,9 @@
 A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
 
  **/
+
+import DS.TreeNode;
+
 /**
  * Definition for a binary tree node.
  * public class TreeNode {
@@ -25,7 +28,7 @@
  *     }
  * }
  */
-class Solution {
+public class MaximumDepthofBinaryTree {
 
     public int maxDepth(TreeNode root) {
        if(root==null){

src/Coding Questions/Leetcode/MaximumLevelSumofaBinaryTree.java

@@ -15,6 +15,8 @@
 import java.util.HashMap;
 import java.util.Map;
 
+import DS.TreeNode;
+
 /**
  * Definition for a binary tree node.
  * public class TreeNode {
@@ -30,7 +32,7 @@
  *     }
  * }
  */
-class Solution {
+public class MaximumLevelSumofaBinaryTree {
     int maxSum;
     int levels;
     int[] arrSum = new int[10001];

src/Coding Questions/Leetcode/MaximumNumberofMovesinaGrid.java

@@ -13,7 +13,7 @@ From a cell (row, col), you can move to any of the cells: (row - 1, col + 1), (r
 Return the maximum number of moves that you can perform.
 
  **/
-class Solution {
+public class MaximumNumberofMovesinaGrid {
     public int maxMoves(int[][] grid) {
         // Get dimensions of the grid
         int m = grid.length;    // number of rows

src/Coding Questions/Leetcode/MaximumSwap.java

@@ -13,7 +13,7 @@
 
 
   **/
-class Solution {
+public class MaximumSwap {
     public int maximumSwap(int num) {
         List<Integer>arr = new ArrayList<>();
         int x = num;

src/Coding Questions/Leetcode/MaximumTwinSumofaLinkedList.java

@@ -26,13 +26,7 @@ In a linked list of size n, where n is even, the ith node (0-indexed) of the lin
 
 import java.util.*;
 
- class ListNode {
-         int val;
-         ListNode next;
-         ListNode() {}
-         ListNode(int val) { this.val = val; }
-         ListNode(int val, ListNode next) { this.val = val; this.next = next; }
-     }
+import DS.ListNode;
 
 /** My Solution **/
 public class MaximumTwinSumofaLinkedList {
@@ -54,7 +48,7 @@ public int pairSum(ListNode head) {
 }
 
 /** best solution **/
-class Solution1 {
+class MaximumTwinSumofaLinkedList1 {
     private static int [] a = new int[100000];
     public int pairSum(ListNode head) {
 

src/Coding Questions/Leetcode/MergeAlternatively.java

@@ -31,7 +31,7 @@
 merged: a p b q c   d
 **/
 
-class MergeAlternatively {
+public class MergeAlternatively {
     public String mergeAlternately(String word1, String word2) {
         StringBuilder result = new StringBuilder();
         int x = word1.length();

src/Coding Questions/Leetcode/MergeTwoSortedList.java

@@ -1,4 +1,4 @@
-
+import DS.ListNode;
 
 /**
  * You are given the heads of two sorted linked lists list1 and list2.

src/Coding Questions/Leetcode/MinimizedMaximumofProductsDistributedtoAnyStore.java

@@ -43,7 +43,7 @@ Feasibility Check (solve function):
     O(1)
  **/
 
-class Solution {
+public class MinimizedMaximumofProductsDistributedtoAnyStore {
     private boolean solve(int n, int[] quantities, int item) {
         if (item == 0) return false;
         int store = 0;

src/Coding Questions/Leetcode/MinimumInsertionstoBalanceaParenthesesString.java

@@ -20,7 +20,7 @@
   **/
 //without stack
 
-class Solution {
+public class MinimumInsertionstoBalanceaParenthesesString {
     public int minInsertions(String s) {
         int count=0;
         int open=0;
@@ -46,7 +46,7 @@ public int minInsertions(String s) {
 
 //with stack
 
-class Solution1 {
+class MinimumInsertionstoBalanceaParenthesesString1 {
     public int minInsertions(String s) {
         Stack<Character> stack=new Stack<>();
         int count=0;

src/Coding Questions/Leetcode/MinimumNumberofChangestoMakeBinaryStringBeautiful.java

@@ -15,7 +15,7 @@
 
 Return the minimum number of changes required to make the string s beautiful.
   **/
-class Solution {
+public class MinimumNumberofChangestoMakeBinaryStringBeautiful {
     public int minChanges(String s) {
         int count = 0;
         for (int i = 0; i < s.length() - 1; i += 2) {

src/Coding Questions/Leetcode/MinimumNumberofRemovalstoMakeMountainArray.java

@@ -15,7 +15,7 @@ There exists some index i (0-indexed) with 0 < i < arr.length - 1 such that:
 arr[i] > arr[i + 1] > ... > arr[arr.length - 1]
 Given an integer array nums​​​, return the minimum number of elements to remove to make nums​​​ a mountain array.
   **/
-class Solution {
+public class MinimumNumberofRemovalstoMakeMountainArray {
     public int minimumMountainRemovals(int[] nums) {
         int n = nums.length;
         int[] LIS = new int[n], LDS = new int[n];