[Java] Straightforward Solution - Easy to Understand!
\nWe can build a checkIsArithmeticSubarrays(List nums)  to examine whether the given list is arithmetic.\nThen we can sort and check each subarrays one by one.\
\nWe can build a *checkIsArithmeticSubarrays(List<Integer> nums)*  to examine whether the given list is arithmetic.\nThen we can sort and check each subarrays one by one.\n\n```\n    public List<Boolean> checkArithmeticSubarrays(int[] nums, int[] l, int[] r) {\n        List<Boolean> res = new ArrayList<>();\n        for (int i=0; i<l.length; i++) {\n            int start = l[i];\n            int end = r[i];\n            List<Integer> temp = new ArrayList<>();\n            for (int j=start; j<end+1; j++) {\n                temp.add(nums[j]);\n            }\n            res.add(checkIsArithmeticSubarrays(temp));\n        }\n        return res;\n    }\n    \n    public boolean checkIsArithmeticSubarrays(List<Integer> nums) {\n        if (nums.size() < 2) return false;\n        Collections.sort(nums);\n        int delta = nums.get(1) - nums.get(0);\n        for (int i=0; i<nums.size() - 1; i++) {\n            if (nums.get(i + 1) - nums.get(i) != delta)\n                return false;\n        }\n        return true;\n    }\n```
[]