Water the plants complete solution with full logic in O(n), 28 days solution .(java)

Shivam Seth — Mon, 22 Feb 2021 19:22:23 +0000

Water the plants complete solution with full logic in O(n), 28 days solution of GFG.(java)

input = [2,3,4,-1,2,0,0,-1,0]
output [-1]
input = [-1,-1,2,2,0,0]

//code
import java.util.*;
class ONE {
int min_sp(int gal[], int n)
{
int arr[] = new int [n];
Arrays.fill(arr, -1);
for (int i=0;i<n;++i)
{
// System.out.println("its n "+n);
if (gal[i]==0)
{
// System.out.println("its arr[i] "+arr[i]);
arr[i]=Math.max(arr[i],i);
continue;
}
if (gal[i]!=-1)
{
int k=i+gal[i];
// System.out.println("its k "+k);
// int j=max (0,i-gal[i]);
int j=Math.max(0,i-gal[i]);
// System.out.println("its j "+j);

            for(int sp = j;sp<=Math.min(n,k);++sp)
                {if(sp==n)
            continue;
                arr[sp]=Math.max(k,arr[sp]);}
        }
    }
    int c =0,i=0;
    while(i<n)
    {
        // System.out.println("its i and n "+i+" "+n);
        // System.out.println("its i and n "+i+" "+arr[i]);

        if (i==-1||arr[i]==-1)
        return -1;
        ++c;
        i=arr[i]+1;
    }
    return c;

}

public static void main(String[] arr)
{
// Scanner in = new Scanner(System.in);
int gal[] ={2,3,4,-1,2,0,0,-1,0};
ONE s = new ONE();
int n=gal.length;
System.out.print(s.min_sp(gal,n));
}
}

Complete the sockMerchant function with python.

Shivam Seth — Sun, 10 Jan 2021 19:53:44 +0000

Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are.
Complete the sockMerchant function in the editor below. It must return an integer representing the number of matching pairs of socks that are available.

sockMerchant has the following parameter(s):

n: the number of socks in the pile
ar: the colors of each sock

Complete the sockMerchant function below.

def sockMerchant(n, ar):
pears = 0
color = set()
for i in range(len(ar)):
if ar[i] not in color:
color.add(ar[i])
else:
pears += 1
color.remove(ar[i])
return pears
if name == 'main':

n = int(input())

ar = list(map(int, input().rstrip().split()))
ar.sort()


result = sockMerchant(n, ar)
print(result)

DEV Community: Shivam Seth

Water the plants complete solution with full logic in O(n), 28 days solution .(java)

Complete the sockMerchant function with python.

Complete the sockMerchant function below.