//! - Discussions: <https://leetcode.com/problems/continuous-subarray-sum/discuss/?currentPage=1&orderBy=most_votes&query=> //! Given an integer array nums and an ...
🚀 Day 30 of My C++ & DSA Journey Problem Solved: 523. Continuous Subarray Sum (LeetCode) 📘 What I Learned: We are asked to check if there exists a subarray of length ≥ 2 whose sum is a multiple of k ...
Top10% Leetcode🏆|| Software Developer|| Contributor @Apertio2.0 @SSOC|| Knight @LeetCode(Max 1610)|| Pupil @Codeforces(Max 1328)|| 3⭐️ @CodeChef(Max 1710)|| 5 ...
Given an integer array nums, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order. Return the ...
現在ITエンジニアとして働いていますが、コーディング・アルゴリズム力をもっと鍛えたいと思い、LeetCodeで学んだ内容をメモ的にアウトプットしています。 今回解いてみた問題は「560. Subarray Sum Equals K」です。 0番目: current_sum = 1, current_sum - k = -8(辞書に ...