title: Bug with finding the largest number divisible by 3
body: <pre><code>def solution(l):
      for x in (range(len(l))):
          sum_l = sum(l)
          num = l[x]
          y = sum_l%3
          l.sort()
  
          if len(l) == 1 and l[0]%3 != 0:
  
              return 0
          elif ((num%3) == y and y != 0) :
              l.remove(num)
  
              l.sort(reverse=True)
              strings = [str(number) for number in l]
              l_string = ''.join(strings)
              l_int = int(l_string)
  
              return l_int
          elif y == 0:
              l.sort(reverse=True)
              strings = [str(number) for number in l]
              l_string = ''.join(strings)
              l_int = int(l_string)
  
              return l_int
      else:
  
        return 0
  </code></pre>
  
  <p>Here is the code. Basically, I am asked to find the largest number that can be made by the integers in the list divisible by 3. It passes all the test cases except one (blind case), and I have literally no idea what the issue is. I've tried every possible type of list, meaning, 1 digit, 2 digits, etc. The list can have numbers 0-9, with 1-9 numbers in it. Can I get some help as to what I might be missing?</p>