title: Solve almostIncreasingSequence (Codefights)
body: <p>Given a sequence of integers as an array, determine whether it is possible to obtain a strictly increasing sequence by removing no more than one element from the array.</p>
  
  <p>Example</p>
  
  <p>For sequence <code>[1, 3, 2, 1]</code>, the output should be:</p>
  
  <pre><code>almostIncreasingSequence(sequence) = false;
  </code></pre>
  
  <p>There is no one element in this array that can be removed in order to get a strictly increasing sequence.</p>
  
  <p>For sequence <code>[1, 3, 2]</code>, the output should be:</p>
  
  <pre><code>almostIncreasingSequence(sequence) = true.
  </code></pre>
  
  <p>You can remove 3 from the array to get the strictly increasing sequence [1, 2]. Alternately, you can remove 2 to get the strictly increasing sequence [1, 3].</p>
  
  <p>My code:</p>
  
  <pre><code>def almostIncreasingSequence(sequence):
      c= 0
      for i in range(len(sequence)-1):
          if sequence[i]&gt;=sequence[i+1]:
              c +=1
      return c&lt;1
  </code></pre>
  
  <p>But it can't pass all tests.</p>
  
  <pre><code>input: [1, 3, 2]
  Output:false
  Expected Output:true
  
  Input: [10, 1, 2, 3, 4, 5]
  Output: false
  Expected Output: true
  
  Input: [0, -2, 5, 6]
  Output: false
  Expected Output: true
  
  input:  [1, 1]
  Output: false
  Expected Output: true
  
  Input: [1, 2, 3, 4, 3, 6]
  Output: false
  Expected Output: true
  
  Input: [1, 2, 3, 4, 99, 5, 6]
  Output: false
  Expected Output: true
  </code></pre>