# Question 1: solution **Topics Involved :** Mathematics , DSU ## Solution for k=1: If only one p-switch is given, we can think of some …

**Question 1** Let *dp[i][x]* = the number of ways to pick coins with sum *x*, using the first *i* coins. Initially, we say we have *dp[0…

If it is possible to select P pairs with max instability k then it is definitely possible to select P pairs with instability greater than k…

# Question 4 : Solution Topics involved: Basic Mathematics, Sorting ### Representative plot  ### App…

has someone done Q1

NIT Raipur

**Q2** ***` Solution:`*** - Order {`i,j,k`} doesn't matter, so sort arrays `A, B, C` - Initially, find the number of elements in `C` great…

**Q1** ***`Solution`*** - As written by Sahil Just consider the elements x, where `x=a[i]=b[i]` And find the minimum missing positive ele…

For all indices i such that A[i]=B[i] , put A[i] in an array and then find the first missing positive in the new array. You can use [this][…

Please provide a solution to 1st question

which campus??

## Question 3 ## **Overview** - Given an integer array **A** of length **N** and the sum of the elements of this array is **X**. - You …

Thanks for posting the solution of Question 1 !! Could you please post solutions for Questions 2 and 3 as well @Manas-2756

**Question 1** * Solution : We are given an array of starting and ending positions of the jumps. For all jumps one gold coin is added to a…

CHALO-mobility