# LeetCode Challenge
{%hackmd RN5D4nggQRO8wzNqxuvlNw %}

<div id="main">
篩選：
<input type="checkbox" checked class="filter easy" />
<input type="checkbox" checked class="filter medium" />
<input type="checkbox" checked class="filter hard" />
<table>
<thead>
<tr>
<th>Id</th>
<th>題目</th>
<th>難度</th>
<th>連結</th>
</tr>
</thead>
<tbody>
<tr class="easy">
<th>1</th>
<td>Two Sum</td>
<th><span class='tag' data-diff='easy'></span></td>
<td><a href="/l3t3KiGQR7qlR7f-G99H4g" target="_blank">🔗</a></td>
</tr>
<tr class="medium">
<th>2</th>
<td>Add Two Numbers</td>
<td><span class='tag' data-diff='medium'></span></td>
<td><a href="/QvJ2x2xyR5eAFcwekBMkaw" target="_blank">🔗</a></td>
</tr>
<tr class="medium">
<th>3</th>
<td>Longest Substring Without Repeating Characters</td>
<td><span class='tag' data-diff='medium'></span></td>
<td><a href="/VHI3NfRlRVG-9JB4yhEKhg" target="_blank">🔗</a></td>
</tr>
<tr class="hard">
<th>4</th>
<td>Median of Two Sorted Arrays</td>
<td><span class='tag' data-diff='hard'></span></td>
<td><a href="/KrFYdxhbQTGw-o-EaXCTsQ" target="_blank">🔗</a></td>
</tr>
<tr class="medium">
<th>5</th>
<td>Longest Palindromic Substring</td>
<td><span class='tag' data-diff='medium'></span></td>
<td><a href="/7Td7q7k7QnO4bRcU_zt_sw" target="_blank">🔗</a></td>
</tr>
<tr class="medium">
<th>6</th>
<td>ZigZag Conversion</td>
<td><span class='tag' data-diff='medium'></span></td>
<td><a href="/pk7fdr72ReOyhTxJP5y7FQ" target="_blank">🔗</a></td>
</tr>
<tr class="easy">
<th>7</th>
<td>Reverse Integer</td>
<td><span class='tag' data-diff='easy'></span></td>
<td><a href="/axzXNKUURFS7UAesmJSZOQ" target="_blank">🔗</a></td>
</tr>
<tr class="easy">
<th>9</th>
<td>Palindrome Number</td>
<td><span class='tag' data-diff='easy'></span></td>
<td><a href="/CYcsapivSyumLFJSGI4fDQ" target="_blank">🔗</a></td>
</tr>
<tr class="hard">
<th>10</th>
<td>Regular Expression Matching</td>
<td><span class='tag' data-diff='hard'></span></td>
<td><a href="/ZfM7wUz1QOO_vjQ-tzUWQQ" target="_blank">🔗</a></td>
</tr>
<tr class="medium">
<th>11</th>
<td>Container With Most Water</td>
<td><span class='tag' data-diff='medium'></span></td>
<td><a href="/yOjIlZ_dRf2rjaWYJTDcFQ" target="_blank">🔗</a></td>
</tr>
<tr class="medium">
<th>12</th>
<td>Integer to Roman</td>
<td><span class='tag' data-diff='medium'></span></td>
<td><a href="/LkR2Gjm4QkGdHafGKZbK7g" target="_blank">🔗</a></td>
</tr>
<tr class="easy">
<th>13</th>
<td>Roman to Integer</td>
<td><span class='tag' data-diff='easy'></span></td>
<td><a href="/FdhZDWyfT_SKcZADpSdutw" target="_blank">🔗</a></td>
</tr>
<tr class="easy">
<th>14</th>
<td>Longest Common Prefix </td>
<td><span class='tag' data-diff='easy'></span></td>
<td><a href="/t5OyYw3LQ0Ov0ZD7J7-QOg" target="_blank">🔗</a></td>
</tr>
<tr class="medium">
<th>15</th>
<td>3Sum </td>
<td><span class='tag' data-diff='medium'></span></td>
<td><a href="/hSi6GbJsRZaO2M55kZP9Fw" target="_blank">🔗</a></td>
</tr>
<tr class="easy">
<th>121</th>
<td>Best Time to Buy and Sell Stock</td>
<td><span class='tag' data-diff='easy'></span></td>
<td><a href="/T8yyAFmISxmwBRn6n2-Cyg" target="_blank">🔗</a></td>
</tr>
<tr class="medium">
<th>2316</th>
<td>Count Unreachable Pairs of Nodes in an Undirected Graph</td>
<td><span class='tag' data-diff='medium'></span></td>
<td><a href="/NETBUm0XSH2XU9L-B3PLJg" target="_blank">🔗</a></td>
</tr>
<tr class="medium">
<th>2353</th>
<td>Design a Food Rating System</td>
<td><span class='tag' data-diff='medium'></span></td>
<td><a href="/Kn3bfZwmTrKS4-3cDyvB5Q" target="_blank">🔗</a></td>
</tr>
</tbody>
</table>
</div>