WIP

Author: Gonzalo Diaz

src/algorithm_exercises_csharp/Hello.cs

@@ -4,12 +4,9 @@ namespace algorithm_exercises_csharp;
 
 public class HelloWorld
 {
-  const string __message = "Hello World!";
+  private readonly string __message = "Hello World!";
 
-  [ExcludeFromCodeCoverage]
-  protected HelloWorld() { }
-
-  public static string hello()
+  public string hello()
   {
     return __message;
   }

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotation.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.arrays
 
 using System.Diagnostics.CodeAnalysis;
 
-public class ArraysLeftRotation
+public static class ArraysLeftRotation
 {
-  [ExcludeFromCodeCoverage]
-  protected ArraysLeftRotation() { }
-
   public const int FIRST_POSITION = 0;
 
   /**

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/arrays/CrushBruteForce.cs

@@ -5,11 +5,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.arrays
 
 using System.Diagnostics.CodeAnalysis;
 
-public class CrushBruteForce
+public static class CrushBruteForce
 {
-  [ExcludeFromCodeCoverage]
-  protected CrushBruteForce() { }
-
   private const int INITIALIZER = 0;
 
   public static long arrayManipulation(int n, List<List<int>> queries)

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/arrays/CrushOptimized.cs

@@ -5,10 +5,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.arrays
 
 using System.Diagnostics.CodeAnalysis;
 
-public class CrushOptimized
+public static class CrushOptimized
 {
-  [ExcludeFromCodeCoverage]
-  private CrushOptimized() { }
 
   /**
   // arrayManipulation.

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/arrays/NewYearChaos.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.arrays
 
 using System.Diagnostics.CodeAnalysis;
 
-public class NewYearChaos
+public static class NewYearChaos
 {
-  [ExcludeFromCodeCoverage]
-  protected NewYearChaos() { }
-
   public const String TOO_CHAOTIC_ERROR = "Too chaotic";
 
   /**

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/arrays/TwoDArray.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.arrays
 
 using System.Diagnostics.CodeAnalysis;
 
-public class TwoDArray
+public static class TwoDArray
 {
-  [ExcludeFromCodeCoverage]
-  protected TwoDArray() { }
-
   private static List<int> getHourGlass(List<List<int>> arr, int positionX, int positionY)
   {
     List<int> result = [];

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTriplets.cs

@@ -7,11 +7,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.dictio
 using System.Diagnostics.CodeAnalysis;
 using System.Collections.Generic;
 
-public class CountTriplets
+public static class CountTriplets
 {
-  [ExcludeFromCodeCoverage]
-  protected CountTriplets() { }
-
   public static long countTriplets(List<long> arr, long r)
   {
     Dictionary<long, long> aCounter = [];

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsBruteForce.cs

@@ -5,11 +5,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.dictio
 using System.Diagnostics.CodeAnalysis;
 using System.Collections.Generic;
 
-public class CountTripletsBruteForce
+public static class CountTripletsBruteForce
 {
-  [ExcludeFromCodeCoverage]
-  protected CountTripletsBruteForce() { }
-
   public static long countTriplets(List<long> arr, long r)
   {
     long size = arr.Count;

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/FrequencyQueries.cs

@@ -13,14 +13,14 @@ private FrequencyQueries()
     reset();
   }
 
-  private static readonly long __INITIAL__ = 1L;
+  private const long __INITIAL__ = 1L;
 
   private const int __INSERT__ = 1;
   private const int __DELETE__ = 2;
   private const int __SELECT__ = 3;
 
-  private static readonly int __NOT_FOUND__ = 0;
-  private static readonly int __FOUND__ = 1;
+  private const int __NOT_FOUND__ = 0;
+  private const int __FOUND__ = 1;
 
   readonly Dictionary<long, long> valueFreqs = [];
   readonly Dictionary<long, List<long>> freqDictionary = [];

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/RansomNote.cs

@@ -5,22 +5,23 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.dictio
 using System.Diagnostics.CodeAnalysis;
 using System.Collections.Generic;
 
-public class RansomNote
+public static class RansomNote
 {
-  [ExcludeFromCodeCoverage]
-  protected RansomNote() { }
-
   public class InvalidValueException : Exception
   {
     // constructor for the InvalidAgeException class
     public InvalidValueException(string msg)
     {
       Console.WriteLine(msg);
     }
+
+    public InvalidValueException()
+    {
+    }
   }
 
-  private static readonly string __YES__ = "Yes";
-  private static readonly string __NO__ = "No";
+  private const string __YES__ = "Yes";
+  private const string __NO__ = "No";
 
   public static bool checkMagazineCompute(List<string> magazine, List<string> note)
   {

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/SherlockAndAnagrams.cs

@@ -5,10 +5,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.dictio
 using System.Diagnostics.CodeAnalysis;
 using System.Numerics;
 
-public class SherlockAndAnagrams
+public static class SherlockAndAnagrams
 {
-  [ExcludeFromCodeCoverage]
-  protected SherlockAndAnagrams() { }
 
   /**
    * factorial().

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/TwoStrings.cs

@@ -4,14 +4,11 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.dictio
 
 using System.Diagnostics.CodeAnalysis;
 
-public class TwoStrings
+public static class TwoStrings
 {
-  [ExcludeFromCodeCoverage]
-  protected TwoStrings() { }
-
-  private static readonly string __YES__ = "Yes";
-  private static readonly string __NO__ = "No";
-  private static readonly char __EMPTY_CHAR__ = '\0';
+  private const string __YES__ = "Yes";
+  private const string __NO__ = "No";
+  private const char __EMPTY_CHAR__ = '\0';
 
   public static bool twoStringsCompute(string s1, string s2)
   {

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/greedy_algorithms/LuckBalance.cs

@@ -4,17 +4,14 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.greedy
 
 using System.Diagnostics.CodeAnalysis;
 
-public class LuckBalance
+public static class LuckBalance
 {
   public class Competition(int _luck, int _important)
   {
     public int luck => _luck;
     public int important => _important;
   }
 
-  [ExcludeFromCodeCoverage]
-  protected LuckBalance() { }
-
   public static int luckBalance(int k, List<List<int>> contests)
   {
     List<Competition> important_competitions = [];

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/greedy_algorithms/MinimumAbsoluteDifferenceInAnArray.cs

@@ -4,12 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.greedy
 
 using System.Diagnostics.CodeAnalysis;
 
-public class MinimumAbsoluteDifferenceInAnArray
+public static class MinimumAbsoluteDifferenceInAnArray
 {
-  [ExcludeFromCodeCoverage]
-  private MinimumAbsoluteDifferenceInAnArray()
-  {
-  }
 
   /**
    * minimumAbsoluteDifference.

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

@@ -5,11 +5,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked
 
 using System.Diagnostics.CodeAnalysis;
 
-public class FindMergeNode
+public static class FindMergeNode
 {
-  [ExcludeFromCodeCoverage]
-  protected FindMergeNode() { }
-
   public static int? findMergeNode(LinkedList<int>.Node head1, LinkedList<int>.Node head2)
   {
     List<LinkedList<int>.Node> llindex = [];

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

@@ -5,11 +5,8 @@ namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked
 
 using System.Diagnostics.CodeAnalysis;
 
-public class LinkedListCycle
+public static class LinkedListCycle
 {
-  [ExcludeFromCodeCoverage]
-  protected LinkedListCycle() { }
-
   public static bool hasCycle<T>(LinkedList<T>.Node? head)
   {
     List<LinkedList<T>.Node> llindex = [];

src/algorithm_exercises_csharp/hackerrank/interview_preparation_kit/linked_list/lib/Node.cs

@@ -1,6 +1,6 @@
 namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.linked_list.lib;
 
-public class LinkedList<T>
+public static class LinkedList<T>
 {
   public class Node(T nodeData)
   {

src/algorithm_exercises_csharp/hackerrank/projecteuler/Euler001.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.projecteuler;
 
 using System.Diagnostics.CodeAnalysis;
 
-public class Euler001
+public static class Euler001
 {
-  [ExcludeFromCodeCoverage]
-  protected Euler001() { }
-
   public static int sumOfArithmeticProgression(int n, int d)
   {
     int new_n = n / d;

src/algorithm_exercises_csharp/hackerrank/projecteuler/Euler002.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.projecteuler;
 
 using System.Diagnostics.CodeAnalysis;
 
-public class Euler002
+public static class Euler002
 {
-  [ExcludeFromCodeCoverage]
-  protected Euler002() { }
-
   public static int fiboEvenSum(int n)
   {
     Log.info("fiboEvenSum({n})", n);

src/algorithm_exercises_csharp/hackerrank/projecteuler/Euler003.cs

@@ -6,11 +6,8 @@ namespace algorithm_exercises_csharp.hackerrank.projecteuler;
 
 using System.Diagnostics.CodeAnalysis;
 
-public class Euler003
+public static class Euler003
 {
-  [ExcludeFromCodeCoverage]
-  protected Euler003() { }
-
   public static int? primeFactor(int n)
   {
     if (n < 2)

src/algorithm_exercises_csharp/hackerrank/warmup/BirthdayCakeCandles.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.warmup;
 
 using System.Diagnostics.CodeAnalysis;
 
-public class BirthdayCakeCandles
+public static class BirthdayCakeCandles
 {
-  [ExcludeFromCodeCoverage]
-  protected BirthdayCakeCandles() { }
-
   public static int birthdayCakeCandles(List<int> _arr)
   {
     if (_arr.Count == 0)

src/algorithm_exercises_csharp/hackerrank/warmup/CompareTriplets.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.warmup;
 
 using System.Diagnostics.CodeAnalysis;
 
-public class CompareTriplets
+public static class CompareTriplets
 {
-  [ExcludeFromCodeCoverage]
-  protected CompareTriplets() { }
-
   public static List<int> compareTriplets(List<int> _a, List<int> _b)
   {
     List<int> awards = [0, 0];

src/algorithm_exercises_csharp/hackerrank/warmup/DiagonalDifference.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.warmup;
 
 using System.Diagnostics.CodeAnalysis;
 
-public class DiagonalDifference
+public static class DiagonalDifference
 {
-  [ExcludeFromCodeCoverage]
-  protected DiagonalDifference() { }
-
   public static int diagonalDifference(List<List<int>> _arr)
   {
     int diag1 = 0;

src/algorithm_exercises_csharp/hackerrank/warmup/MiniMaxSum.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.warmup;
 
 using System.Diagnostics.CodeAnalysis;
 
-public class MiniMaxSum
+public static class MiniMaxSum
 {
-  [ExcludeFromCodeCoverage]
-  protected MiniMaxSum() { }
-
   public static string miniMaxSum(List<int> arr)
   {
     if (arr.Count == 0)

src/algorithm_exercises_csharp/hackerrank/warmup/PlusMinus.cs

@@ -5,11 +5,8 @@ namespace algorithm_exercises_csharp.hackerrank.warmup;
 using System.Globalization;
 using System.Diagnostics.CodeAnalysis;
 
-public class PlusMinus
+public static class PlusMinus
 {
-  [ExcludeFromCodeCoverage]
-  protected PlusMinus() { }
-
   public static string plusMinus(List<int> arr)
   {
     int positives = 0;

src/algorithm_exercises_csharp/hackerrank/warmup/SimpleArraySum.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.warmup;
 
 using System.Diagnostics.CodeAnalysis;
 
-public class SimpleArraySum
+public static class SimpleArraySum
 {
-  [ExcludeFromCodeCoverage]
-  protected SimpleArraySum() { }
-
   public static int simpleArraySum(int[] inputs)
   {
     var total = 0;

src/algorithm_exercises_csharp/hackerrank/warmup/SolveMeFirst.cs

@@ -4,11 +4,8 @@ namespace algorithm_exercises_csharp.hackerrank.warmup;
 
 using System.Diagnostics.CodeAnalysis;
 
-public class SolveMeFirst
+public static class SolveMeFirst
 {
-  [ExcludeFromCodeCoverage]
-  protected SolveMeFirst() { }
-
   public static int solveMeFirst(int _a, int _b)
   {
     return _a + _b;

src/algorithm_exercises_csharp/hackerrank/warmup/Staircase.cs

@@ -5,11 +5,8 @@ namespace algorithm_exercises_csharp.hackerrank.warmup;
 using System.Text;
 using System.Diagnostics.CodeAnalysis;
 
-public class Staircase
+public static class Staircase
 {
-  [ExcludeFromCodeCoverage]
-  protected Staircase() { }
-
   public static string staircase(int _n)
   {
     List<string> result = [];