https://syarif-software-engineer.pages.dev/tags/leetcode/ Recent content in Leetcode on Syarif Software Engineer Hugo id Mon, 08 Jun 2026 23:41:41 +0700 https://syarif-software-engineer.pages.dev/posts/twosum/ Mon, 08 Jun 2026 23:41:41 +0700 https://syarif-software-engineer.pages.dev/posts/twosum/ <p>Soal: Diberikan array integer nums dan integer target, kembalikan indices dari dua angka yang jika dijumlahkan hasilnya sama dengan target.</p> <div class="highlight"><pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;"><code class="language-kotlin" data-lang="kotlin"><span style="display:flex;"><span><span style="color:#66d9ef">class</span> <span style="color:#a6e22e">Solution</span> { </span></span><span style="display:flex;"><span> <span style="color:#66d9ef">fun</span> <span style="color:#a6e22e">twoSum</span>(nums: IntArray, target: Int): IntArray { </span></span><span style="display:flex;"><span> <span style="color:#66d9ef">for</span>(i <span style="color:#66d9ef">in</span> nums.indices){ </span></span><span style="display:flex;"><span> <span style="color:#66d9ef">for</span>(j <span style="color:#66d9ef">in</span> i+<span style="color:#ae81ff">1</span> until nums.size){ </span></span><span style="display:flex;"><span> <span style="color:#66d9ef">if</span>(nums[i]+nums[j] <span style="color:#f92672">==</span> target){ </span></span><span style="display:flex;"><span> <span style="color:#66d9ef">return</span> intArrayOf(i,j) </span></span><span style="display:flex;"><span> } </span></span><span style="display:flex;"><span> } </span></span><span style="display:flex;"><span> } </span></span><span style="display:flex;"><span> <span style="color:#66d9ef">throw</span> IllegalArgumentException(<span style="color:#e6db74">&#34;No solution found&#34;</span>) </span></span><span style="display:flex;"><span> } </span></span><span style="display:flex;"><span>} </span></span></code></pre></div>