@Ruchir

/* 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

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

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int maxProfit(int [] A){ int n = A.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 maxProfit(int [] A){ int n = A.length; int max = 0 ;

/* Given an array ar[N] , you have to find a number of leaders in the arry . Leader : An elemet ar[i] is said to be a leader if it is greater than the maximum of all elements present on the left of it i.e. [0,i-1] Note : ar[0] is already considere

/* Given an array ar[N] , you have to find a number of leaders in the arry . Leader : An elemet ar[i] is said to be a leader if it is greater than the maximum of all elements present on the left of it i.e. [0,i-1] Note : ar[0] is already considere

/* Given an array arr[] of n elements and q queries . For each query given indices l and r calculate and print the no. of even no in the given range (l and r both inclusive) Constraints :- 1 <= n <= 10^5 1 <= arr[i] <= 10^9

/* Given an array arr[] of n elements and q queries . For each query given indices l and r calculate and print the no. of even no in the given range (l and r both inclusive) Constraints :- 1 <= n <= 10^5 1 <= arr[i] <= 10^9

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static long[] prefixsum(int [] arr){ int n = arr.length; long psum[] = new long[n]; 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 int countofEquilibrum(int [] arr){ int n = arr.length; int count = 0 ;

/* Node class represents a node in a singly linked list Function to get the node at the nth position in the linked list Function to add a new node with data at the beginning of the linked list Function to add a new node with data at a specific index

/* Problem Description You are given A which is the head of a linked list. Also given is the value B and position C. Complete the function that should insert a new node with the said value at the given position. Notes: In case the position is more

/* Problem Description You are given A which is the head of a linked list. Print the linked list in space separated manner. Note : The last node value must also be succeeded by a space and after printing the entire list you should print a new line