Changed Solution to solution

Author: RYMNDK

Java/src/CodeRunner/LinkedListsRunner.java

@@ -51,7 +51,7 @@ private static boolean testFlattenMultiLevelList() {
         node7.next = node8;
 
         System.out.println(multiLevelListNodeToString(node1));
-        MultiLevelListNode flattened = FlattenMultiLevelList.Solution(node1);
+        MultiLevelListNode flattened = FlattenMultiLevelList.solution(node1);
 
         // 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> null
         int counter = 1;
@@ -87,7 +87,7 @@ private static boolean testLinkedListIntersection() {
         System.out.println(listNodeToString(headA1));
         System.out.println(listNodeToString(headB1));
 
-        ListNode intersection1 = LinkedListIntersection.Solution(headA1, headB1);
+        ListNode intersection1 = LinkedListIntersection.solution(headA1, headB1);
 
         if (intersection1 == null || intersection1.val != 3) {
             return false;
@@ -106,7 +106,7 @@ private static boolean testLinkedListReversal() {
         System.out.println("Printing lists");
         System.out.println(listNodeToString(headA));
 
-        ListNode reversed = LinkedListReversal.Solution(headA);
+        ListNode reversed = LinkedListReversal.solution(headA);
 
         if (!verifyLinkedList(reversed, valsAR)) {
             return false;
@@ -126,7 +126,7 @@ private static boolean testLinkedListReversalRecursive() {
         System.out.println("Printing lists");
         System.out.println(listNodeToString(headA));
 
-        ListNode reversed = LinkedListReversalRecursive.Solution(headA);
+        ListNode reversed = LinkedListReversalRecursive.solution(headA);
 
         if (!verifyLinkedList(reversed, valsAR)) {
             return false;
@@ -150,7 +150,7 @@ private static boolean testPalindromicLinkedList() {
         System.out.println("Printing list B");
         System.out.println(listNodeToString(headB));
 
-        if (!(PalindromicLinkedList.Solution(headA) && PalindromicLinkedList.Solution(headB))) {
+        if (!(PalindromicLinkedList.solution(headA) && PalindromicLinkedList.solution(headB))) {
             return false;
         }
 
@@ -165,7 +165,7 @@ private static boolean testRemoveKthLastNode() {
         System.out.println("Printing list A before");
         System.out.println(listNodeToString(headA));
 
-        headA = RemoveKthLastNode.Solution(headA, k);
+        headA = RemoveKthLastNode.solution(headA, k);
 
         if (!verifyLinkedList(headA, new int[] {1, 2, 4, 5})) {
             return false;

Java/src/LinkedLists/FlattenMultiLevelList.java

@@ -19,7 +19,7 @@ public MultiLevelListNode(int val, MultiLevelListNode next, MultiLevelListNode c
 
 
 public class FlattenMultiLevelList {
-    public static MultiLevelListNode Solution(MultiLevelListNode head) {
+    public static MultiLevelListNode solution(MultiLevelListNode head) {
         if (head == null) {
             return null;
         }

Java/src/LinkedLists/LinkedListIntersection.java

@@ -17,7 +17,7 @@ public ListNode(int val, ListNode next) {
 
 
 public class LinkedListIntersection {
-    public static ListNode Solution(ListNode headA, ListNode headB) {
+    public static ListNode solution(ListNode headA, ListNode headB) {
         ListNode ptrA = headA;
         ListNode ptrB = headB;
         // Traverse through list A with 'ptrA' and list B with 'ptrB'

Java/src/LinkedLists/LinkedListReversal.java

@@ -17,7 +17,7 @@ public ListNode(int val, ListNode next) {
 
 
 public class LinkedListReversal {
-    public static ListNode Solution(ListNode head) {
+    public static ListNode solution(ListNode head) {
         ListNode currNode = head;
         ListNode prevNode = null;
         // Reverse the direction of each node's pointer until 'currNode'

Java/src/LinkedLists/LinkedListReversalRecursive.java

@@ -17,7 +17,7 @@ public ListNode(int val, ListNode next) {
 
 
 public class LinkedListReversalRecursive {
-    public static ListNode Solution(ListNode head) {
+    public static ListNode solution(ListNode head) {
         // Base cases.
         if (head == null || head.next == null) return head;
         else {

Java/src/LinkedLists/PalindromicLinkedList.java

@@ -17,7 +17,7 @@ public ListNode(int val, ListNode next) {
 
 
 public class PalindromicLinkedList {
-    public static boolean Solution(ListNode head) {
+    public static boolean solution(ListNode head) {
         // Find the middle of the linked list and then reverse the second half of the
         // linked list starting at this midpoint.
         ListNode mid = findMiddle(head);

Java/src/LinkedLists/RemoveKthLastNode.java

@@ -17,7 +17,7 @@ public ListNode(int val, ListNode next) {
 
 
 public class RemoveKthLastNode {
-    public static ListNode Solution(ListNode head, int k) {
+    public static ListNode solution(ListNode head, int k) {
         // A dummy node to ensure there's a node before 'head' in case we
         // need to remove the head node.
         ListNode dummy = new ListNode(-1);