<h1 id="heading-today-i-solved">Today I solved..</h1>
<hr />
<h2 id="heading-leetcode-75-level-1">LeetCode 75 - Level 1</h2>
<h3 id="heading-day-3-linked-list">Day 3. Linked List</h3>
<ul>
<li>21 Merge Two Sorted Lists (Easy)</li>
<li>206 Reverse Linked List (Easy)</li>
</ul>
<hr />
<h2 id="heading-algorithm-algorithm-i">Algorithm - Algorithm I</h2>
<h3 id="heading-day-3-two-pointers">Day 3. Two Pointers</h3>
<ul>
<li>283 Move Zeroes (Easy)</li>
<li><p>167 Two Sum II - Input Array Is Sorted (Medium)</p>
<pre><code class="lang-python"><span class="hljs-class"><span class="hljs-keyword">class</span> <span class="hljs-title">Solution</span>:</span>
  <span class="hljs-function"><span class="hljs-keyword">def</span> <span class="hljs-title">twoSum</span>(<span class="hljs-params">self, numbers: List[int], target: int</span>) -&gt; List[int]:</span>
      need = set()
      lo, hi = <span class="hljs-number">0</span>, len(numbers) - <span class="hljs-number">1</span>

      <span class="hljs-keyword">while</span> lo &lt; hi:

          sum = numbers[lo] + numbers[hi]

          <span class="hljs-keyword">if</span> sum == target:
              <span class="hljs-keyword">return</span> [lo + <span class="hljs-number">1</span>, hi + <span class="hljs-number">1</span>]
          <span class="hljs-keyword">elif</span> sum &lt; target:
              lo += <span class="hljs-number">1</span>
          <span class="hljs-keyword">else</span>:
              hi -= <span class="hljs-number">1</span>

      <span class="hljs-keyword">return</span> []
</code></pre>
</li>
</ul>


# Today I solved..
---
## LeetCode 75 - Level 1
### Day 3. Linked List
- 21 Merge Two Sorted Lists (Easy)
- 206 Reverse Linked List (Easy)
---
## Algorithm - Algorithm I
### Day 3. Two Pointers
- 283 Move Zeroes (Easy)
- 167 Two Sum II - Input Array Is Sorted (Medium)
```python
class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        need = set()
        lo, hi = 0, len(numbers) - 1

        while lo < hi:
            
            sum = numbers[lo] + numbers[hi]
            
            if sum == target:
                return [lo + 1, hi + 1]
            elif sum < target:
                lo += 1
            else:
                hi -= 1
        
        return []
```

3 Easy, 1 Medium

LeetCode: 21, 206, 283, 167

Today I solved..