This algorithm focuses on removing number instances.

RemoveNumberInstances.cs

public static int RemoveNumberInstances(int[] nums, int val)
        {
            if (nums == null)
            {
                return 0;
            }
            else
            {
                nums = nums.Where(arrayElement => arrayElement != val).ToArray();

                return nums.Length;
            }
        }

Hello @Ezeji, thank you for participating in Week 2 of Algorithm Fridays.

Really decent and robust solution you got here - your solution correctly handles the edge case where the input value for the nums array is null. Neat!

That said, the logic for your solution uses a Where filter function that only returns the elements in nums whose values are not equal to val. What do you think are the trade-offs with using the Where function? Is it really memory-optimal to use this approach?

I've posted my solution here. I am curious to know what you think.