| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|1508|[Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1508.java)||Medium|Array, Sort|

|1507|[Reformat Date](https://leetcode.com/problems/reformat-date/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1507.java)||Easy|String|

|1502|[Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1502.java)||Easy|Array, Sort|

|1496|[Path Crossing](https://leetcode.com/problems/path-crossing/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1496.java)||Easy|String|

packagecom.fishercoder.solutions;

importjava.util.ArrayList;

importjava.util.Collections;

importjava.util.List;

publicclass_1508 {

publicstaticclassSolution1 {

publicintrangeSum(int[]nums,intn,intleft,intright) {

List<Long>list =newArrayList<>();

for (inti =0;i <nums.length;i++) {

longsum =nums[i];

list.add(sum);

for (intj =i +1;j <nums.length;j++) {

sum +=nums[j];

list.add(sum);

}

}

Collections.sort(list);

longresult =0;

for (inti =left -1;i <right;i++) {

result +=list.get(i);

}

return (int)result %1000000007;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1508;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.TestCase.assertEquals;

publicclass_1508Test {

privatestatic_1508.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1508.Solution1();

}

publicvoidtest1() {

assertEquals(13,solution1.rangeSum(newint[]{1,2,3,4},4,1,5));

}

}