Updated Mathproduct class and added test method for the Other Products code challenge.

quickm · quickm · commit 52d76cfea3b9 · 2021-02-22T19:30:59.000-08:00
diff --git a/Coderbyte_CSharp/1 Easy Challenges/EasyChallenges.txt b/Coderbyte_CSharp/1 Easy Challenges/EasyChallenges.txt
@@ -12,7 +12,7 @@ Letter Capitalize	02/22/2021		ChangeLetter
 Letter Changes		02/22/2021		ChangeLetter
 Longest Word
 Moving Median
-Other Products
+Other Products		02/22/2021		MathProduct
 Palindrome          02/10/2021      PalindromeChecker
 Power of 2			02/22/2021		ExponentTwo
 Product Digits		02/22/2021		MathProduct
diff --git a/Coderbyte_CSharp/1 Easy Challenges/MathProduct.cs b/Coderbyte_CSharp/1 Easy Challenges/MathProduct.cs
@@ -47,5 +47,55 @@ public int ProductDigits(int num)
             return result;
         }
 
+        // Have the function OtherProducts(arr) take the array of numbers stored in arr 
+        // and return a new list of the products of all the other numbers in the array 
+        // for each element. 
+
+        // For example: if arr is [1, 2, 3, 4, 5] then the new array, 
+        // where each location in the new array is the product of all other elements, 
+        // is [120, 60, 40, 30, 24]. The following calculations were performed to get 
+        // this answer: [(2*3*4*5), (1*3*4*5), (1*2*4*5), (1*2*3*5), (1*2*3*4)]. You 
+        // should generate this new array and then return the numbers as a string 
+        // joined by a hyphen: 120-60-40-30-24. The array will contain at most 10 
+        // elements and at least 1 element of only positive integers.
+        public string OtherProducts(int[] arr, int length)
+        {
+            string      result          = String.Empty;
+            List<int>   productValues   = new List<int>(length);
+            int         product = 1;
+
+            for (int index = 0; index < length; index++)
+            {
+                product = ComputeProduct(arr, index);
+                productValues.Add(product);
+            }
+
+            StringBuilder sb = new StringBuilder();
+
+            foreach (int item in productValues)
+            {
+                sb.Append(item);
+                sb.Append("-");
+            }
+
+            result = sb.ToString();
+            result = result.Remove(result.Length - 1);
+
+            return result;
+        }
+
+        protected int ComputeProduct(int[] arr, int index)
+        {
+            int result = 1;
+            int length = arr.Length;
+
+            for (int i = 0; i < length; i++)
+            {
+                if (i == index) { continue; }
+                result *= arr[i];
+            }
+
+            return result;
+        }
     }
 }
diff --git a/Coderbyte_CSharp/Program.cs b/Coderbyte_CSharp/Program.cs
@@ -29,6 +29,7 @@ static void Main(string[] args)
             tc.Test_LetterCapitalize();
             tc.Test_PowerOfTwo();
             tc.Test_ProductDigits();
+            tc.Test_OtherProducts();
 
             // Medium
             Console.WriteLine("Medium Code Challenges:");
diff --git a/Coderbyte_CSharp/TestChallenge.cs b/Coderbyte_CSharp/TestChallenge.cs
@@ -256,6 +256,18 @@ public void Test_ProductDigits()
             Console.WriteLine("Input: {0}", num);
             Console.WriteLine("Output:  {0}", prod.ProductDigits(num));
             Console.WriteLine();
+        }
+
+        public void Test_OtherProducts()
+        {
+            MathProduct prod = new MathProduct();
+            int[] arr = new int[] {1, 2, 3, 4, 5 };
+            
+
+            Console.WriteLine("Other Products:");
+            PrintArray(arr, arr.Length);
+            Console.WriteLine("Output: {0}", prod.OtherProducts(arr, arr.Length));
+            Console.WriteLine();
 
         }
 
