@Ruchir

/* Given an integer array A of size N, find the first repeating element in it. We need to find the element that occurs more than once and whose index of the first occurrence is the smallest. If there is no repeating element, return -1. */ import

import java.util.*; class Main { public static boolean SubarraywithsumZero(int[] arr) { int psum[] = new int[arr.length]; psum[0] = arr[0]; HashSet<Integer> set = new HashSet<>(); set.add(psum[0]);

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static boolean SubarraywithsumZero(int[] arr) { int n = arr.length; for (int s = 0; s < n; s+

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static boolean SubarraywithsumZero(int [] arr){ int [] psum = prefixSum(arr); for(int s=0; s<

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static boolean SubarraywithsumZero(int [] arr){ int n = arr.length; for(int s=0; s < n ; s++)

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static boolean checkDistinct(int arr[]){ int n = arr.length; //Creating a HashSet

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static boolean checkDistinct(int arr[]){ int n = arr.length; // Make a frequency map

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int[] findFreq(int[] arr, int[] query) { // step 1 : make a frequcency map

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int[] findFreq(int [] arr , int [] query ){ int n = arr.length; int q = query.length;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void hashsetPractise(){ //Create HashSet<Integer> set = new HashSet<>();

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void hashmapPractise(){ // Creating a Hashmap of Countries with their Population where countries are K

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static long[] zeroQ(int N, int s[], int v[]) { long arr[] = new long[N]; int q = s.length;

/* Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead. Example 1: Input: target = 7, num

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { // spiral printing public static void printSpiral(int[][] mat) { int n = mat.length;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { // Print Boundary public static void printBoundary(int [][] mat){ int n = mat.length;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int minswap(int [] arr , int B){ int n = arr.length; int countofGood = 0;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static long maxSumforlenk(int [] arr , int k ){ int n = arr.length;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int[] prefixSum(int [] arr){ int n = arr.length; int psum[] = new int[n];

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int maxSumforlenk(int [] arr , int k ){ int n = arr.length;

/* Problem Description You are given an integer array arr of length N. You have to find the sum of all subarray sums of A. More formally, a subarray is defined as a contiguous part of an array which we can obtain by deleting zero or more elements fr