Hi folks,

Am I missing something or is the below nested loop solution not a simpler alternative to this problem?

I understand the benefit of sliding window when you are trying to get the count, but when you have to return the sub-arrays this just seems more straight-forward?

import .*;

class Solution {

  public static List<List<Integer>> findSubarrays(int[] arr, int target) {
    List<List<Integer>> result = new ArrayList<>();
    for (int i = 0; i < ; i++) {
      int product = 1;
      List<Integer> temp = new ArrayList<>();
      for (int j = i; j < ; j++) {
        temp.add(arr[j]);
        product = product * arr[j];
        if (product < target) {
          (new ArrayList<Integer>(temp));
        } else {
          break;
        }
      }
    }
    return result;
  }
}