1. Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product.
2. Unbounded Knapsack Problem Statement Given ‘N’ items, each with a specific profit and weight, and a knapsack with a weight capacity ‘W’. The objective is to fill the knapsack such that the total profit is maximized. The same item can be taken multiple times. Input: The first line contains a single integer ‘T’ denoting the number of test cases. The first line of each test contains two integers ‘N’ (number of items) and ‘W’ (capacity of the knapsack). The second line contains profiti for each item, representing the profit of the i-th item. The third line contains weighti for each item, representing the weight of the i-th item. Output: For each test case, return an integer representing the maximum profit obtainable by filling the knapsack. Example: Example with 'N' = 3 items and knapsack capacity 'W' = 10:'PROFIT' = { 5, 11, 13 }'WEIGHT' = { 2, 4, 6 }Possible knapsack fillings:1 item of weight 6 and 1 item of weight 4, or1 item of weight 6 and 2 items of weight 2, or2 items of weight 4 and 1 item of weight 2, or5 items of weight 2.The maximum profit is 27 from the third case. Constraints: 1 <= T <= 50 1 <= N <= 10^3 1 <= W <= 10^3 1 <= PROFIT[i], WEIGHT[i] <= 10^8 Time Limit: 1 second Note: You do not need to print anything; focus on implementing the function.
3. How do you find a loop in a Linked List and how do you remove it?
4. Given a knapsack with a maximum weight capacity W and a set of items, each with a weight wi and a value vi, determine the maximum total value of items that can be placed in the knapsack. You can take multiple instances of the same item.
5. Describe your process for debugging a bug.