Udaariyaan 7 December written update today

Udaariyaan 7th december written update today– Udaariyaan is a serial by colors tv which is a very good show and is watched by many people all over the India. The Udaariyan show lovers wants to read the written updates , then they have come to the right place where we all provide udaariyaan written updates everyday as … Read more

Increasing String solution codechef

Increasing String solution codechef For Solution Click Here! You are given a string SS, consisting of lowercase English letters. You can do the following operation at most once : Choose a subsequence of the string SS, then remove it from SS and concatenate the subsequence at the end of the remaining string. Find the lexicographically minimum string that can be obtained by performing … Read more

Pyramid Traversal solution codechef

Pyramid Traversal solution codechef For Solution Click Here! You are given a pyramid of the following form with an infinite number of rows: 11 2 32 3 4 5 64 5 6 7 8 9 107 8 9 10 ………..……….. From a cell, you can move to either the bottom-left cell or the bottom-right cell directly in contact with the current one (For example, you can make … Read more

Rock Paper Scissors solution codechef

Rock Paper Scissors solution codechef For Solution Click Here! There are NN players standing in a line, indexed 11 to NN from left to right. They all play a game of Rock, Paper, Scissors. Each player has already decided which move they want to play. You are given this information as a string SS of length NN, i.e, SiSi is equal to RR if player ii will play Rock. … Read more

Squares Counting solution codechef

Squares Counting solution codechef For Solution Click Here! You are given a binary square matrix AA of size N×NN×N. Let the value at cell (i,j)(i,j) be denoted by A(i,j)A(i,j). Your task is to count the number of square frames present in the grid. A square frame is defined to be a square submatrix of AA whose border elements are all ‘1’. Formally, A square submatrix of AA of size kk with … Read more

Valleys and Hills solution codechef

Valleys and Hills solution codechef For Solution Click Here! Chef built a binary string SS that has exactly NN hills and MM valleys. A hill is any index 1<i<|S|1<i<|S| such that both its neighbors are strictly smaller than it, i.e, Si−1<SiSi−1<Si and Si+1<SiSi+1<Si. A valley is any index 1<i<|S|1<i<|S| such that both its neighbors are strictly larger than it, i.e, Si−1>SiSi−1>Si and Si+1>SiSi+1>Si. Chef thinks that his string SS is the shortest among all binary strings with NN hills … Read more

List of Lists solution codechef

List of Lists solution codechef For Solution Click Here! You are given a positive integer NN and an array AA of size NN. There are NN lists L1,L2…LNL1,L2…LN. Initially, Li=[Ai]Li=[Ai]. You can perform the following operation any number of times as long as there are at least 22 lists: Select 22 (non-empty) lists LiLi and LjLj (i≠ji≠j) Append LjLj to LiLi and remove the list LjLj. Note that this means LjLj cannot be chosen in any future operation. Find … Read more

Check Mate solution codechef

Check Mate solution codechef For Solution Click Here! You are given a standard 8×88×8 chessboard which has exactly 33 pieces placed on it – 22 black rooks and 11 white king. The rows are numbered 11 to 88 from bottom to top, and the columns are numbered 11 to 88 from left to right. The cell at the intersection of the ii-th column and jj-th row is denoted (i,j)(i,j) (like the coordinate system on the xyxy-plane). … Read more

Utkarsh and Placement tests solution codechef

Utkarsh and Placement tests solution codechef For Solution Click Here! Utkarsh is currently sitting for placements. He has applied to three companies named A,BA,B, and CC. You know Utkarsh’s order of preference among these 33 companies, given to you as characters first, second, and third respectively (where first is the company he prefers most). You also know that Utkarsh has received offers from exactly two … Read more

Tree Coloring solution codeforces

Tree Coloring solution codeforces For Solution Click Here! You are given a rooted tree consisting of nn vertices numbered from 11 to nn. The root of the tree is the vertex 11. You have to color all vertices of the tree into nn colors (also numbered from 11 to nn) so that there is exactly one vertex for each color. Let cici be the color of vertex ii, and pipi be … Read more