Problem Description You are presented with an undirected tree consisting of N nodes, each assigned a specific value. Your task is to partition these nodes into the smallest number of groups possible, ensuring that no two adjacent nodes are included in the same group. For any group G, consider a

Problem Description You are given N toys in a shop, each with a price represented in an array A. You have a budget of C to spend on toys, and there are K broken toys that you want to avoid purchasing. For each of the Q queries, your task is

Problem Description You are provided with a string S made up entirely of 0's and 1's. Your task is to count the number of substrings in which the number of 1's exceeds the number of 0's. Note: A substring of a string

Problem Description You are presented with a matrix M that contains n rows and m columns, filled exclusively with 0's and 1's. A right-angled isosceles triangle is defined by the following criteria: * The hypotenuse must be parallel to the x-axis. * The length of the hypotenuse must

Problem Description You are given an array of S containing N elements. Your goal is to determine the count of distinct arrays A of N elements that satisfy the following conditions: * A[i] < A[i+1] for all 1 ≤ i < N. * The sum of the digits of A[

Problem Description A hybrid sequence is a sequence that can be divided into two disjoint subsequences. Every subsequence is an array. Given two arrays, A and B, of sizes N and M, respectively. You are also given a hybrid sequence S. The expression Σ (i=1 to N+M) max(

Problem Description You are given the following: Two integers N and K and an array A of size N. Let sequence B(B_1, B_2, ..., B_2K) of size 2K is a subsequence of array A. Let's define F(B)= (B_1 |B_2|...|B_K) ⊕ (B_

Problem Description You have an infinitely long array initialized with zeros. You are given two integers, N and K, and for the next N lines, you will receive three integers L, R, and X. This indicates that you need to add X to every element in the array from index

Problem Description You are given the following: * A tree with N nodes. * An array A that represents the value of each node. * A non-negative integer K. You are allowed to perform the following operation at most once: 1. Select a node r and make it the new root of the

Problem Description You are given an array A of N integer elements. You are also given Q queries, where each query is one of the following types: 1. 1 i val. Update the value of the element at the i-th index to val i.e. A[i]=val. 2. 2

Problem Description You are given N integers that represent the locations of homes along a straight street (on the x-axis). The i-th home is located at A[i]. Your goal is to find the optimal integer location X for building a dark store such that the sum of the squared

Problem Description You are given N integers representing the locations of homes on a straight street (x-axis). The ith home is located at A[i], You need to determine the optimal integer location X to build a dark store such that the sum of the absolute distances from the dark

Problem Description You are given a string S1 of length N. You have a machine that will generate a string Q of length M using a string S2 of length M. However, the machine will not generate the string Q at once. Initially. you're given a string Q

Problem Description You are given an array of integers. Your task is to determine the maximum number of partitions you can make. A partition divides the array into two parts such that the sum of the elements in each part is equal. Additionally, you are allowed to perform one operation

Problem Description You are given a string of lowercase English alphabets. Your task is to find the number of palindromic triplets in the string. A palindromic triplet consists of three non-overlapping substrings S1, S2, and S3 such that each substring is a palindrome and all substrings are non-overlapping. Test Case