Fixed Idea warnings

Author: javadev

build.gradle

@@ -33,15 +33,7 @@ java {
     withJavadocJar()
 }
 
-publishing {
-    publications {
-        maven(MavenPublication) {
-            from(components.java)
-        }
-    }
-}
-
-tasks.withType(JavaCompile) {
+tasks.withType(JavaCompile).configureEach {
     options.encoding = 'UTF-8'
 }
 

src/main/java/g0001_0100/s0002_add_two_numbers/readme.md

@@ -122,7 +122,7 @@ public class Solution {
         solution.printList(result2);
 
         ListNode l5 = new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9)))))));
-        ListNode l6 = new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9)))));
+        ListNode l6 = new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9))));
         ListNode result3 = solution.addTwoNumbers(l5, l6);
         System.out.print("Example 3 Output: ");
         solution.printList(result3);

src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/readme.md

@@ -63,7 +63,7 @@ class Solution {
     }
 
     // Recursive helper method to construct binary tree
-    private TreeNode build(int[] preorder, int[] inorder, int preStart, preEnd, int inStart, int inEnd) {
+    private TreeNode build(int[] preorder, int[] inorder, int preStart, int preEnd, int inStart, int inEnd) {
         if (preStart > preEnd || inStart > inEnd) return null; // Base case
 
         int rootValue = preorder[preStart]; // Root node value