C# Solution Using Concatenation
Intuition\n\n\n# Approach\nassume we have found [0..biggest], in order for the consecutive, the next coin value have to be <=biggest+1, if that satisfies, we ca
# Intuition\n\n\n# Approach\nassume we have found [0..biggest], in order for the consecutive, the next coin value have to be <=biggest+1, if that satisfies, we can concatenate the smallest we found and the biggest would be this coin value plus "biggest" we found before.\n\n# Complexity\n- Time complexity:\nO(nlogn)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\npublic class Solution {\n    public int GetMaximumConsecutive(int[] coins) {\n        int lastSml = 0, lastBig = 0;\n        int largest = 1;\n\n        Array.Sort(coins);\n\n        for(int i=0; i<coins.Length; ++i){\n            int val = coins[i];\n            int sml, big;\n            if(val > lastBig+1){\n                sml = val;\n                break;\n            }\n            else{\n                sml = lastSml;\n            }\n\n            lastSml = sml;\n            lastBig = val + lastBig;\n            largest = Math.Max(largest, lastBig-lastSml+1);\n        }\n\n        return largest;\n    }\n}\n```
['C#']