Skip to content

Category Archives: Competitive Programming

Given a graph G, the task is to check if it represents a Ring Topology.A Ring Topology is the one shown in the image below:  … Read More
Given integers k, d1, d2 and an integer array arr[]. Starting from number k you are allowed to make jumps of size d1 and d2… Read More
Given a range represented by two positive integers L and R and a positive integer K. Find the count of numbers in the range where… Read More
Given a tree, where each vertex V has a value A[V] stored in it. The task is to find the minimum number of operations required… Read More
Given a graph G, check if it represents a Bus Topology.A Bus Topology is the one shown in the image below:   Examples:   Input: Output: YES… Read More
Given two positive integers L and R which represents a range and two more positive integers d and K. The task is to find the… Read More
Given a string str, the task is to split the string into minimum parts such that each part is of same length and each part… Read More
Given a string str which contains only the characters x and y, the task is to count all the sub-strings that start and end with… Read More
Given an array of size and a number . The task is to modify the given array such that: The difference between the sum of… Read More
Given an array of integers. Find an integer X which is the divisor of all except for exactly one element in the given array. Note:… Read More
Given a binary string S. Find the minimum number of operations required to be performed on the number zero to convert it to the number… Read More
A string is called a N-copy string when it is formed by N copies of letter ‘G’. ie “GGGG” is a 4-copy string since it… Read More
Given an array of N integers where array elements form a strictly decreasing and increasing sequence. The task is to find the smallest number in… Read More