Given an N-ary Tree containing N nodes, values associated with each node and Q queries, where each query contains a single node. The task is… Read More

# Category Archives: Competitive Programming

Given two integer arrays a[] and b[], the task is to find the maximum possible product of the same indexed elements of two equal length… Read More

Algorithms are the methodical sequence of steps which are defined to solve complex problems. In this article, we will see the difference between two such… Read More

Given a binary tree where node contains characters, the task is to count the number of paths from root vertex to leaf such that at… Read More

Given an N x M matrix of integers, the task is to count the number of palindromic pluses in the array. Palindromic plus is formed… Read More

Content has been removed on Author’s request. My Personal Notes arrow_drop_up Save

Given two numbers X and Y, the task is to find the probability that an arbitrary positive divisor of 10X is an integral multiple of… Read More

Given string str containing only lowercase English alphabets and an integer K, the task is to find a K length substring which contains the maximum… Read More

Content has been removed on Author’s request. My Personal Notes arrow_drop_up Save

Given a N-ary tree with some colour associated with every node and Q queries. Each query contains two integers A and X. The task is… Read More

Given S stacks of length M, the task is to maximize the sum of elements at the top of each stack by popping at most… Read More

Given two integers N and K, the task is to generate the final outcome of performing K operations which involves adding the smallest divisor, other… Read More

Given a string str and an integer K, the task is to find the K-th most frequent character in the string. If there are multiple… Read More

Given an integer N, the task is to count the number of ways to arrange triplets (a, b, c) within [1, N] in such a… Read More

Given an undirected graph G, the task is to find the shortest path of even-length, given 1 as Source Node and N as Destination Node.… Read More