[REFACTOR] ambiguous namespace, changed.

Author: Gonzalo Diaz

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/FindMergeNode.cs

@@ -1,7 +1,7 @@
 // @link Problem definition [[docs/hackerrank/interview_preparation_kit/linked_lists/find-the-merge-point-of-two-joined-linked-lists.md]]
 
 namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list;
-using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.lib;
+using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.common;
 
 using System.Diagnostics.CodeAnalysis;
 

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/LinkedListCycle.cs

@@ -1,7 +1,7 @@
 // @link Problem definition [[docs/hackerrank/interview_preparation_kit/linked_lists/ctci_linked_list_cycle.md]]
 
 namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list;
-using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.lib;
+using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.common;
 
 using System.Diagnostics.CodeAnalysis;
 

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/lib/LinkedListPrinter.cs renamed to src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/common/LinkedListPrinter.cs

@@ -1,4 +1,4 @@
-namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.lib;
+namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.common;
 
 public static class LinkedListPrinter
 {

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/lib/Node.cs renamed to src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/common/Node.cs

@@ -1,4 +1,4 @@
-namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.lib;
+namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.common;
 
 public static class LinkedList<T>
 {

src/algorithm_exercises_csharp_test/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotation.Test.cs

@@ -5,19 +5,19 @@ namespace algorithm_exercises_csharp_test.hackerrank.interview_preparation_kit.a
 [TestClass]
 public class ArraysLeftRotationTest
 {
-  public class ArraysLeftRotationsTestCase(int[] input, int d, int[] expected)
+  public class ArraysLeftRotationsTestCase(List<int> input, int d_rotations, List<int> expected)
   {
-    private readonly List<int> input = [.. input];
-    private readonly int d = d;
-    private readonly List<int> expected = [.. expected];
+    private List<int> input = input;
+    private int d_rotations = d_rotations;
+    private List<int> expected = expected;
 
     public List<int> Input
     {
       get { return input; }
     }
-    public int D
+    public int D_rotations
     {
-      get { return d; }
+      get { return d_rotations; }
     }
     public List<int> Expected
     {
@@ -42,7 +42,7 @@ public void testRotLeft()
 
     foreach (ArraysLeftRotationsTestCase test in testCases)
     {
-      result = ArraysLeftRotation.rotLeft(test.Input, test.D);
+      result = ArraysLeftRotation.rotLeft(test.Input, test.D_rotations);
       CollectionAssert.AreEquivalent(test.Expected, result);
     }
   }

src/algorithm_exercises_csharp_test/hackerrank/interview_preparation_kit/linked_list/FindMergeNode.Test.cs

@@ -1,6 +1,6 @@
 namespace algorithm_exercises_csharp_test.hackerrank.interview_preparation_kit.linked_list;
 using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list;
-using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.lib;
+using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.common;
 
 [TestClass]
 public class FindMergeNodeTest

src/algorithm_exercises_csharp_test/hackerrank/interview_preparation_kit/linked_list/LinkedListCycle.Test.cs

@@ -1,6 +1,6 @@
 namespace algorithm_exercises_csharp_test.hackerrank.interview_preparation_kit.linked_list;
 using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list;
-using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.lib;
+using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.common;
 
 [TestClass]
 public class LinkedListCycleTest

src/algorithm_exercises_csharp_test/hackerrank/interview_preparation_kit/linked_list/lib/Node.Test.cs

@@ -1,5 +1,5 @@
 namespace algorithm_exercises_csharp_test.hackerrank.interview_preparation_kit.linked_list.lib;
-using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.lib;
+using algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.common;
 
 [TestClass]
 public class NodeTest