🥰🔥Solution using Normal Approach Full Detail Explanation🔥|🔥Daily Challenges🔥
Complexity\n- Time complexity:O(n * (2k))\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:O(K)\n Add your space complexity here, e.g. O(n) \n\
# Complexity\n- Time complexity:$$O(n * (2k))$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:$$O(K)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    private boolean isAirthmatic(int []nums, int l, int r){\n        int []arr = new int[r-l+1];\n        int idx=0;\n        for(int i=l; i<=r; i++){\n            arr[idx++] = nums[i];\n        }\n\n        Arrays.sort(arr);\n        int diff = arr[1]-arr[0];\n        for(int i=1; i<arr.length-1; i++){\n            if((arr[i+1]-arr[i]) != diff) return false;\n        }\n        return true;\n    }\n\n    public List<Boolean> checkArithmeticSubarrays(int[] nums, int[] l, int[] r) {\n        ArrayList<Boolean> list = new ArrayList<>();\n        for(int i=0; i<l.length; i++){\n            list.add(isAirthmatic(nums, l[i], r[i]));\n        }\n        return list;\n    }\n}\n```
['Array', 'Sorting', 'Java']