https://dmytros.blog/tags/easy/ Recent content in Easy on Dmytro's Blog https://dmytros.blog/images/papermod-cover.png https://dmytros.blog/images/papermod-cover.png Hugo -- 0.147.1 en Sat, 22 Aug 2026 19:10:53 +0300 https://dmytros.blog/posts/leetcode-longest-common-prefix/ Sat, 22 Aug 2026 19:10:53 +0300 https://dmytros.blog/posts/leetcode-longest-common-prefix/ <h3 id="the-problem">The problem</h3> <p>Write a function to find the longest common prefix string amongst an array of strings.</p> <p>If there is no common prefix, return an empty string <code>&quot;&quot;</code>.</p> <p><strong>Example 1:</strong></p> <pre tabindex="0"><code>Input: strs = [&#34;flower&#34;,&#34;flow&#34;,&#34;flight&#34;] Output: &#34;fl&#34; </code></pre><p><strong>Example 2:</strong></p> <pre tabindex="0"><code>Input: strs = [&#34;dog&#34;,&#34;racecar&#34;,&#34;car&#34;] Output: &#34;&#34; Explanation: There is no common prefix among the input strings. </code></pre><p><strong>Constraints:</strong></p> <ul> <li><code>1 &lt;= strs.length &lt;= 200</code></li> <li><code>0 &lt;= strs[i].length &lt;= 200</code></li> <li><code>strs[i]</code> consists of only lowercase English letters if it is non-empty.</li> </ul> <h4 id="explanation">Explanation</h4> <blockquote> <p>I&rsquo;m trying to add a little bit of life to my posts, so I decided to lay down some thought process behind the solution. Please go easy on me.</p>