[REFACTOR] ambiguous namespace, changed.

Gonzalo Diaz · Gonzalo Diaz · commit e46079d2fe1a · 2025-05-14T19:53:12.000-04:00
diff --git a/src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/FindMergeNode.cs b/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;
 
diff --git a/src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/LinkedListCycle.cs b/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;
 
diff --git a/src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/common/LinkedListPrinter.cs b/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
 {
diff --git a/src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/common/Node.cs b/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>
 {
diff --git a/src/algorithm_exercises_csharp_test/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotation.Test.cs b/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);
     }
   }
diff --git a/src/algorithm_exercises_csharp_test/hackerrank/interview_preparation_kit/linked_list/FindMergeNode.Test.cs b/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
diff --git a/src/algorithm_exercises_csharp_test/hackerrank/interview_preparation_kit/linked_list/LinkedListCycle.Test.cs b/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
diff --git a/src/algorithm_exercises_csharp_test/hackerrank/interview_preparation_kit/linked_list/lib/Node.Test.cs b/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

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.lib;`
	`1`	`+namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.common;`
`2`	`2`
`3`	`3`	`public static class LinkedListPrinter`
`4`	`4`	`{`
Original file line number	Diff line number	Diff line change
`@@ -5,19 +5,19 @@ namespace algorithm_exercises_csharp_test.hackerrank.interview_preparation_kit.a`
`5`	`5`	`[TestClass]`
`6`	`6`	`public class ArraysLeftRotationTest`
`7`	`7`	`{`
`8`		`- public class ArraysLeftRotationsTestCase(int[] input, int d, int[] expected)`
	`8`	`+ public class ArraysLeftRotationsTestCase(List<int> input, int d_rotations, List<int> expected)`
`9`	`9`	`{`
`10`		`- private readonly List<int> input = [.. input];`
`11`		`- private readonly int d = d;`
`12`		`- private readonly List<int> expected = [.. expected];`
	`10`	`+ private List<int> input = input;`
	`11`	`+ private int d_rotations = d_rotations;`
	`12`	`+ private List<int> expected = expected;`
`13`	`13`
`14`	`14`	`public List<int> Input`
`15`	`15`	`{`
`16`	`16`	`get { return input; }`
`17`	`17`	`}`
`18`		`- public int D`
	`18`	`+ public int D_rotations`
`19`	`19`	`{`
`20`		`- get { return d; }`
	`20`	`+ get { return d_rotations; }`
`21`	`21`	`}`
`22`	`22`	`public List<int> Expected`
`23`	`23`	`{`
`@@ -42,7 +42,7 @@ public void testRotLeft()`
`42`	`42`
`43`	`43`	`foreach (ArraysLeftRotationsTestCase test in testCases)`
`44`	`44`	`{`
`45`		`- result = ArraysLeftRotation.rotLeft(test.Input, test.D);`
	`45`	`+ result = ArraysLeftRotation.rotLeft(test.Input, test.D_rotations);`
`46`	`46`	`CollectionAssert.AreEquivalent(test.Expected, result);`
`47`	`47`	`}`
`48`	`48`	`}`