Add solution for 0523.Continuous Subarray Sum

Author: emafazillah

solution/0523.Continuous Subarray Sum/README_EN.md

@@ -0,0 +1,24 @@
+# Continuous Subarray Sum
+
+Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to a multiple of k, that is, sums up to n*k where n is also an integer.
+
+## Example 1:
+```
+ Input: [23, 2, 4, 6, 7],  k=6
+ Output: True
+ Explanation: Because [2, 4] is a continuous subarray of size 2 and sums up to 6.
+```
+
+## Example 2:
+```
+ Input: [23, 2, 6, 4, 7],  k=6
+ Output: True
+ Explanation: Because [23, 2, 6, 4, 7] is an continuous subarray of size 5 and sums up  to 42.
+```
+
+
+
+## Note:
+
+ 1. The length of the array won't exceed 10,000.
+ 2. You may assume the sum of all the numbers is in the range of a signed 32-bit integer.

solution/0523.Continuous Subarray Sum/Solution.java

@@ -0,0 +1,23 @@
+class Solution {
+    public boolean checkSubarraySum(int[] nums, int k) {
+		for (int start = 0; start < nums.length; start++) {
+        	int check = 0;
+        	for (int i = start; i < nums.length; i++) {
+        		check += nums[i];
+                if (i > start) {
+                	if (k != 0) {
+            			if (check % k == 0) {
+                    		return true;
+                    	}
+            		} else {
+            			if (check == k) {
+            				return true;
+            			}
+            		}
+        		}
+        	}
+        }
+        
+        return false;
+    }
+}