Python hungry

1.Array Subset of another array Given two arrays: a1[0..n-1] of size n and a2[0..m-1] of size m. Task is to check whet…

1.Array Subset of another array Given two arrays: a1[0..n-1] of size n and a2[0..m-1] of size m. Task is to check whet…

1.Stock span problem The stock span problem is a financial problem where we have a series of n daily price quotes fo…

1.Maximum Product Subarray  Given an array  Arr[]  that contains  N  integers (may be  positive ,  negative  or  zer…

1.Subarrays with equal 1s and 0s Given an array containing 0s and 1s. Find the number of subarrays having equal number…