Given two integers A and B, the task is to print the integer among the two, which will be converted to an odd integer by… Read More

# Category Archives: Pattern Searching

Given a point (x, y), the task is to check if it is possible to reach from origin to (x, y) in exactly Z steps.… Read More

Given a number N which denotes the number of sides of the polygon where the centroid of the polygon is connected with all the vertices,… Read More

Given four integers A, N, L and R, the task is to find the N th number in a sequence of consecutive integers from L… Read More

Given a matrix mat[][] of size M*N, the task is to sort only the border elements of the matrix in the clockwise direction and print… Read More

Given three integers R, C, N, and an array arr[] of size N. The task is to color all cells of a grid of R… Read More

Given a string str, the task is to check if that string is a Reverse Bitonic string or not. If the string str is reverse… Read More

Given a number N, the task is to check first whether the given number is binary or not and its value should be greater than… Read More

Given a string str, the task is to write a Java program to check whether a string contains only digits or not. If so, then… Read More

Given a URL as a character string str of size N.The task is to check if the given URL is valid or not.Examples : Input… Read More

Given a string str, the task is to check if it can be split into substrings such that each substring starts with a numeric value… Read More

Given three integers X, Y and N, the task is to find the largest number possible of length N consisting only of X and Y… Read More

Given a positive integer N, the task is to find the sum of divisors of all the numbers from 1 to N.Examples: Input: N =… Read More

Given two numbers K and N. The task is to represent the given number K as a sum of several N-bonacci numbers. Examples: Input: K… Read More

Given a string S of length N, consisting of only opening ‘(‘ and closing ‘)‘ parenthesis. The task is to find all indices ‘K‘ such… Read More