resolved codacy issues

Author: mohit-gogitter

Algorithms.Tests/Stack/NextGreaterElementTests.cs

@@ -66,7 +66,7 @@ public void FindNextGreaterElement_AllElementsHaveNoGreaterElement_ReturnsAllNeg
             var result = FindNextGreaterElement(input);
 
             // Assert
-            Assert.That(result, Is.EqualTo(result));
+            Assert.That(result, Is.EqualTo(expected));
         }
 
         [Test]

Algorithms.Tests/Stack/ReverseStackTests.cs

@@ -58,7 +58,7 @@ public void Reverse_MultipleElementStack_ReturnsCorrectOrder()
             Assert.That(stack.Count, Is.EqualTo(3));
             Assert.That(stack.Pop(), Is.EqualTo(1)); // Should return 1
             Assert.That(stack.Pop(), Is.EqualTo(2)); // Should return 2
-            Assert.That(stack.Pop(), Is.EqualTo(3)); ; // Should return 3
+            Assert.That(stack.Pop(), Is.EqualTo(3)); // Should return 3
         }
 
         [Test]

Algorithms/Stack/BalancedParenthesesChecker.cs

@@ -41,34 +41,47 @@ public bool IsBalanced(string expression)
             Stack<char> stack = new Stack<char>();
             foreach (char c in expression)
             {
-                if (c == '(' || c == '{' || c == '[')
+                if (IsOpeningParenthesis(c))
                 {
                     stack.Push(c);
                 }
-                else if (c == ')' || c == '}' || c == ']')
+                else if (IsClosingParenthesis(c))
                 {
-                    if (stack.Count == 0)
-                    {
-                        return false;
-                    }
-
-                    char open = stack.Pop();
-
-                    if (!IsMatchingPair(open, c))
+                    if (!IsBalancedClosing(stack, c))
                     {
                         return false;
                     }
                 }
                 else
                 {
-                    // Throw an exception if an invalid character is found
                     throw new ArgumentException($"Invalid character '{c}' found in the expression.");
                 }
             }
 
             return stack.Count == 0;
         }
 
+        private static bool IsOpeningParenthesis(char c)
+        {
+            return c == '(' || c == '{' || c == '[';
+        }
+
+        private static bool IsClosingParenthesis(char c)
+        {
+            return c == ')' || c == '}' || c == ']';
+        }
+
+        private static bool IsBalancedClosing(Stack<char> stack, char close)
+        {
+            if (stack.Count == 0)
+            {
+                return false;
+            }
+
+            char open = stack.Pop();
+            return IsMatchingPair(open, close);
+        }
+
         private static bool IsMatchingPair(char open, char close)
         {
             return ParenthesesMap.ContainsKey(open) && ParenthesesMap[open] == close;