WIP

Author: Gonzalo Diaz

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

@@ -13,6 +13,8 @@ public static class ArraysLeftRotation
    */
   public static List<int> rotLeftOne(List<int> input)
   {
+    ArgumentNullException.ThrowIfNull(input);
+
     int first = input[FIRST_POSITION];
     input.RemoveAt(FIRST_POSITION);
     input.Add(first);
@@ -25,6 +27,8 @@ public static List<int> rotLeftOne(List<int> input)
    */
   public static List<int> rotLeft(List<int> input, int d)
   {
+    ArgumentNullException.ThrowIfNull(input);
+
     // Clone the list
     List<int> output = input.GetRange(FIRST_POSITION, input.Count);
 

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

@@ -11,6 +11,8 @@ public static class CrushBruteForce
 
   public static long arrayManipulation(int n, List<List<int>> queries)
   {
+    ArgumentNullException.ThrowIfNull(queries);
+
     // why adding 1?
     //   first slot to adjust 1-based index and
     int[] result = new int[n + 1];

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

@@ -12,6 +12,8 @@ public static class CrushOptimized
    */
   public static long arrayManipulation(int n, List<List<int>> queries)
   {
+    ArgumentNullException.ThrowIfNull(queries);
+
     // why adding 2?
     //   first slot to adjust 1-based index and
     //   last slot for storing accumSum result

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

@@ -2,17 +2,17 @@
 
 namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.arrays;
 
-using System.Diagnostics.CodeAnalysis;
-
 public static class NewYearChaos
 {
-  public const String TOO_CHAOTIC_ERROR = "Too chaotic";
+  public const string TOO_CHAOTIC_ERROR = "Too chaotic";
 
   /**
    * minimumBribesCalculate.
    */
   public static int minimumBribesCalculate(List<int> q)
   {
+    ArgumentNullException.ThrowIfNull(q);
+
     int bribes = 0;
     int i = 0;
 

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

@@ -28,6 +28,8 @@ private static List<int> getHourGlass(List<List<int>> arr, int positionX, int po
 
   public static int hourglassSum(List<List<int>> arr)
   {
+    ArgumentNullException.ThrowIfNull(arr);
+
     int matrixSize = arr.Count;
 
     int matrixStartIndex = 1;

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

@@ -4,13 +4,14 @@
 
 namespace algorithm_exercises_csharp.hackerrank.interview_preparation_kit.dictionaries_and_hashmaps;
 
-using System.Diagnostics.CodeAnalysis;
 using System.Collections.Generic;
 
 public static class CountTriplets
 {
   public static long countTriplets(List<long> arr, long r)
   {
+    ArgumentNullException.ThrowIfNull(arr);
+
     Dictionary<long, long> aCounter = [];
     Dictionary<long, long> bCounter = [];
     long triplets = 0L;

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

@@ -9,6 +9,8 @@ public static class CountTripletsBruteForce
 {
   public static long countTriplets(List<long> arr, long r)
   {
+    ArgumentNullException.ThrowIfNull(arr);
+
     long size = arr.Count;
     long counter = 0L;
 

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

@@ -116,6 +116,8 @@ void select(long value)
    */
   public static List<int> freqQuery(List<List<int>> queries)
   {
+    ArgumentNullException.ThrowIfNull(queries);
+
     FrequencyQueries fq = new();
 
     foreach (List<int> query in queries)

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

@@ -23,6 +23,8 @@ public static BigInteger factorial(int number)
 
   public static int sherlockAndAnagrams(string s)
   {
+    ArgumentException.ThrowIfNullOrEmpty(s);
+
     Dictionary<string, List<string>> candidates = [];
 
     int size = s.Length;

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

@@ -12,6 +12,9 @@ public static class TwoStrings
 
   public static bool twoStringsCompute(string s1, string s2)
   {
+    ArgumentException.ThrowIfNullOrEmpty(s1);
+    ArgumentException.ThrowIfNullOrEmpty(s2);
+
     char occurrence = s1.FirstOrDefault(c => s2.Contains(c), __EMPTY_CHAR__);
 
     if (occurrence != __EMPTY_CHAR__)