Given string str, the task is to convert all the vowels present in the given string to uppercase characters in the given string. Examples: Input:… Read More

# Category Archives: Searching

Given a Binary Tree, the task is to check if it consists of node values arranged in strictly increasing order at even levels and strictly… Read More

Given two arrays arr[] and min[] consisting of N integers and an integer K. For each index i, arr[i] can be reduced to at most… Read More

Given an array a[] of size N, which contains only non-negative elements, the task is to find any integer K for which there are exactly… Read More

Given a Binary Tree, the task is to check if the binary tree is an Even-Odd binary tree or not. A Binary Tree is called… Read More

Given two strings A and B, the task is to find the smallest substring of A having B as a subsequence. Examples: Input: A =… Read More

Given an array A[] of size N, the task for each array element is to count the array elements on their right that are smaller… Read More

Given two strings str1 and str2 of length N and M respectively, the task is to check if the string str1 can be formed by… Read More

Given string str of length N, the task is to find the minimum length to which the given string can be reduced to by replacing… Read More

Given an integer, P denoting the number of chocolates and an array a[] where ai denotes the type of ith chocolate. There are N people… Read More

Given two integers X and Y, the task is to find the length of the smallest sequence consisting of positive integers having sum X and… Read More

Given a Binary Tree, the task is to find the sum of all the specially balanced nodes in the given Binary Tree. A specially balanced… Read More