C# solution beats 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nRecursive approach\n\n#
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nRecursive approach\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```csharp []\nusing System;\nusing System.Collections.Generic;\nusing System.Linq;\n\npublic class Solution {\n    public int MaximumGood(int[][] statements) {\n        \n        bool Check(List<int> good) {\n            foreach (int p in good) {\n                for (int j = 0; j < statements.Length; j++) {\n                    if (statements[p][j] == 0 && good.Contains(j)) return false;\n                    if (statements[p][j] == 1 && !good.Contains(j)) return false;\n                }\n            }\n            return true;\n        }\n\n        int GetLargestValidList(int i, List<int> good) {\n            if (i >= statements.Length) {\n                return Check(good) ? good.Count : 0;\n            }\n\n            good.Add(i);\n            int res = GetLargestValidList(i + 1, good);\n            good.RemoveAt(good.Count - 1);\n\n            return Math.Max(res, GetLargestValidList(i + 1, good));\n        }\n\n        return GetLargestValidList(0, new List<int>());\n    }\n}\n\n```
['C#']