Uncategorized

Divide a String Into Groups of Size k solution leetcode:- A string s can be partitioned into groups of size k using the following procedure: The first group consists of the first k characters of the string, the second group consists of the next k characters of the string, and so on. Each character can be a part of exactly one group. For the last group, if the string does not have k characters remaining, a character fill is used to complete the group.

Divide a String Into Groups of Size k solution leetcode For Solution Click Here! Divide a String Into Groups of Size k solution leetcode:– A string s can be partitioned into groups of size k using the following procedure: The first group consists of the first k characters of the string, the second group consists of the next k characters of the …

Divide a String Into Groups of Size k solution leetcode:- A string s can be partitioned into groups of size k using the following procedure: The first group consists of the first k characters of the string, the second group consists of the next k characters of the string, and so on. Each character can be a part of exactly one group. For the last group, if the string does not have k characters remaining, a character fill is used to complete the group. Read More »

Array Partition solution codechef – You are given an array A of N integers, and an integer X. For each K in the range [1,N], determine the number of ways to partition the array into exactly K non-empty subarrays such that the maxima of each of the subarrays are at least X.

Array Partition solution codechef For Solution Click Here! You are given an array AA of NN integers, and an integer XX. For each KK in the range [1,N][1,N], determine the number of ways to partition the array into exactly KK non-empty subarrays such that the maxima of each of the subarrays are at least XX. The number of ways can be large, so output it modulo 998244353998244353. Note: The …

Array Partition solution codechef – You are given an array A of N integers, and an integer X. For each K in the range [1,N], determine the number of ways to partition the array into exactly K non-empty subarrays such that the maxima of each of the subarrays are at least X. Read More »

Tree Master solution codechef- Given is a tree with N weighted vertices and N−1 weighted edges. The i-th vertex has a weight of Ai. The i-th edge has a weight of Wi and connects vertices ui and vi.

Tree Master solution codechef For Solution Click Here! Given is a tree with NN weighted vertices and N−1N−1 weighted edges. The ii-th vertex has a weight of AiAi. The ii-th edge has a weight of WiWi and connects vertices uiui and vivi. Let dist(x,y)dist⁡(x,y) be the sum of weights of the edges in the unique simple path connecting vertices xx and yy. Let V(x,y)V⁡(x,y) be the set of vertices appearing in the unique simple path …

Tree Master solution codechef- Given is a tree with N weighted vertices and N−1 weighted edges. The i-th vertex has a weight of Ai. The i-th edge has a weight of Wi and connects vertices ui and vi. Read More »

Sum and OR solution codechef – Chef has two integers XX and SS. He is interested in sequences of non-negative integers such that the sum of their elements is SS and the bitwise OR of their elements is XX. Chef would like to know the shortest possible length such a sequence can have.

Sum and OR solution codechef For Solution Click Here! Chef has two integers XX and SS. He is interested in sequences of non-negative integers such that the sum of their elements is SS and the bitwise OR of their elements is XX. Chef would like to know the shortest possible length such a sequence can have. Formally, find the smallest positive integer NN such that …

Sum and OR solution codechef – Chef has two integers XX and SS. He is interested in sequences of non-negative integers such that the sum of their elements is SS and the bitwise OR of their elements is XX. Chef would like to know the shortest possible length such a sequence can have. Read More »

Power Sum solution codechef- You are given a sequence A of N integers such that every element is a non-negative power of 2. A sequence is called good if its sum is a non-negative power of 2. You would like to turn A into a good sequence. To achieve this, you can perform the following operation on A

Power Sum solution codechef For Solution Click Here! You are given a sequence AA of NN integers such that every element is a non-negative power of 22. A sequence is called good if its sum is a non-negative power of 22. You would like to turn AA into a good sequence. To achieve this, you can perform the following operation on AA: Pick a non-empty subsequence of AA, pick …

Power Sum solution codechef- You are given a sequence A of N integers such that every element is a non-negative power of 2. A sequence is called good if its sum is a non-negative power of 2. You would like to turn A into a good sequence. To achieve this, you can perform the following operation on A Read More »

Crying Colours solution codechef- You have a total of 3N3N balls of colours RedRed, BlueBlue and GreenGreen. There are exactly NN balls of each colour. These 3N3N balls are now distributed to 33 boxes such that each box contains exactly NN balls. You are given the contents of each box. You would like the 1st1st box to contain all the red balls, the 2nd2nd box to contain all the green balls, and the 3rd3rd box to contain all the blue balls. Note that the given order of boxes is important here — it is not enough for each box to contain only balls of a single colour. To achieve this, you can perform the following operation several (possibly, zero) times

Crying Colours solution codechef   You have a total of 3N3N balls of colours RedRed, BlueBlue and GreenGreen. There are exactly NN balls of each colour. These 3N3N balls are now distributed to 33 boxes such that each box contains exactly NN balls. You are given the contents of each box. You would like the 1st1st box to contain all the red balls, the 2nd2nd box to contain all the green balls, and the 3rd3rd box to contain all …

Crying Colours solution codechef- You have a total of 3N3N balls of colours RedRed, BlueBlue and GreenGreen. There are exactly NN balls of each colour. These 3N3N balls are now distributed to 33 boxes such that each box contains exactly NN balls. You are given the contents of each box. You would like the 1st1st box to contain all the red balls, the 2nd2nd box to contain all the green balls, and the 3rd3rd box to contain all the blue balls. Note that the given order of boxes is important here — it is not enough for each box to contain only balls of a single colour. To achieve this, you can perform the following operation several (possibly, zero) times Read More »

Chef and Fixed Deposits solution codechef- Chef wants to make a purchase. For this, he needs X gold coins, but he has none at the moment. Chef has N fixed deposits, the ith of which is worth Ai coins. He wants to open the minimum number of these deposits so that he has at least X coins. You have to tell Chef the minimum number of fixed deposits he must open in order to have X coins, or say that this is impossible.

Chef and Fixed Deposits solution codechef For Solution Click Here! Chef wants to make a purchase. For this, he needs XX gold coins, but he has none at the moment. Chef has NN fixed deposits, the ithith of which is worth AiAi coins. He wants to open the minimum number of these deposits so that he has at least XX coins. You have to tell …

Chef and Fixed Deposits solution codechef- Chef wants to make a purchase. For this, he needs X gold coins, but he has none at the moment. Chef has N fixed deposits, the ith of which is worth Ai coins. He wants to open the minimum number of these deposits so that he has at least X coins. You have to tell Chef the minimum number of fixed deposits he must open in order to have X coins, or say that this is impossible. Read More »

TCS Examination solution codechef – Two friends, Dragon and Sloth, are writing a computer science examination series. There are three subjects in this series: DSADSA, TOCTOC, and DMDM. Each subject carries 100100 marks.

TCS Examination solution codechef For Solution Click Here! Two friends, Dragon and Sloth, are writing a computer science examination series. There are three subjects in this series: DSADSA, TOCTOC, and DMDM. Each subject carries 100100 marks. You know the individual scores of both Dragon and Sloth in all 33 subjects. You have to determine who got a better rank. The rank is …

TCS Examination solution codechef – Two friends, Dragon and Sloth, are writing a computer science examination series. There are three subjects in this series: DSADSA, TOCTOC, and DMDM. Each subject carries 100100 marks. Read More »

Sarthak and his Set of Primes solution codechef- Sarthak has a set SS of NN distinct prime numbers. He grew very fond of that set, and now he only likes a positive integer XX if all of its prime factors belong to SS. Given the set and a positive integer MM, can you find out how many integers he likes which are not more than MM? Note: Sarthak always like the number 11.

Sarthak and his Set of Primes solution codechef For Solution Click Here! Sarthak has a set SS of NN distinct prime numbers. He grew very fond of that set, and now he only likes a positive integer XX if all of its prime factors belong to SS. Given the set and a positive integer MM, can you find out how many integers he …

Sarthak and his Set of Primes solution codechef- Sarthak has a set SS of NN distinct prime numbers. He grew very fond of that set, and now he only likes a positive integer XX if all of its prime factors belong to SS. Given the set and a positive integer MM, can you find out how many integers he likes which are not more than MM? Note: Sarthak always like the number 11. Read More »

Harshikaa and the Rain solution codechef- There is a tree with NN nodes numbered from 11 to NN outside Harshikaa’s house. The tree is rooted at node 11. Initially the tree was dry, there were no raindrops on any node of the tree. Suddenly it started raining, and every second a drop falls on all the leaf nodes of the tree. Also, every second any drop which wasn’t already on the root node moves one node closer to the root. Sometimes, strong winds shake the tree and all drops which were not on the root fall off. It is known that the wind will shake the tree MM times at A1,A2,…AMA1,A2,…AM seconds after it started raining. If multiple events happen at the same second, they are in this order:

Harshikaa and the Rain solution codechef For Solution Click Here! There is a tree with NN nodes numbered from 11 to NN outside Harshikaa’s house. The tree is rooted at node 11. Initially the tree was dry, there were no raindrops on any node of the tree. Suddenly it started raining, and every second a drop falls on all the leaf nodes of the …

Harshikaa and the Rain solution codechef- There is a tree with NN nodes numbered from 11 to NN outside Harshikaa’s house. The tree is rooted at node 11. Initially the tree was dry, there were no raindrops on any node of the tree. Suddenly it started raining, and every second a drop falls on all the leaf nodes of the tree. Also, every second any drop which wasn’t already on the root node moves one node closer to the root. Sometimes, strong winds shake the tree and all drops which were not on the root fall off. It is known that the wind will shake the tree MM times at A1,A2,…AMA1,A2,…AM seconds after it started raining. If multiple events happen at the same second, they are in this order: Read More »