[Hacker Rank] Interview Preparation Kit: Linked Lists: Base code for Linked lists added.

Author: Gonzalo Diaz

algorithm-exercises-csharp-test/src/hackerrank/interview_preparation_kit/linked_list/Node.Test.cs

@@ -0,0 +1,64 @@
+namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit;
+
+[TestClass]
+public class NodeTest
+{
+  class NodeTestCase
+  {
+    public string title = "";
+    public LinkedList.Node? llist;
+    public string separator = "";
+    public string expected = "";
+  }
+
+  private static NodeTestCase[] tests = [];
+
+  [TestInitialize]
+  public void testInitialize()
+  {
+    // Linked list sample data:
+    LinkedList.Node ll1_1 = new(1);
+    LinkedList.Node ll1_2 = new(2);
+    LinkedList.Node ll1_3 = new(3);
+    LinkedList.Node ll1_4 = new(4);
+    LinkedList.Node ll1_5 = new(5);
+
+    ll1_1.next = ll1_2;
+    ll1_2.next = ll1_3;
+    ll1_3.next = ll1_4;
+    ll1_4.next = ll1_5;
+
+    tests = [
+      new()
+      {
+        title = "Sample Test case X",
+        llist = ll1_1,
+        separator = ", ",
+        expected = "1, 2, 3, 4, 5"
+      }
+    ];
+  }
+
+  [TestMethod]
+  public void testPrintLinkedList()
+  {
+    foreach (NodeTestCase test in tests)
+    {
+      StringWriter sw = new();
+
+      LinkedList.printSinglyLinkedList(test.llist, test.separator, sw);
+
+      string result = sw.ToString();
+      Assert.AreEqual(
+        test.expected,
+        result,
+        String.Format(
+          "{0} testPrintLinkedList(<Node>, {1}, <Textwriter>) => must be: {2}",
+          test.title,
+          test.separator,
+          test.expected
+        )
+      );
+    }
+  }
+}

algorithm-exercises-csharp/src/hackerrank/interview_preparation_kit/linked_list/lib/Node.cs

@@ -0,0 +1,27 @@
+namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit;
+
+public class LinkedList
+{
+  public class Node(int nodeData)
+  {
+    public int data { get; set; } = nodeData;
+    public Node? next { get; set; } = null;
+  }
+
+  public static void printSinglyLinkedList(Node? node, string sep, TextWriter textWriter)
+  {
+    Node? pointTo = node;
+
+    while (pointTo != null)
+    {
+      textWriter.Write(pointTo.data);
+
+      pointTo = pointTo.next;
+
+      if (pointTo != null)
+      {
+        textWriter.Write(sep);
+      }
+    }
+  }
+}