## Minimum bit changes in Binary Circular array to reach a index

Given a Binary Circular Array of size N elements and two positive integers x and y indicating the indices in the circular array. The task… Read More »

Given a Binary Circular Array of size N elements and two positive integers x and y indicating the indices in the circular array. The task… Read More »

Given two strings s1 and s2, check if s1 is a suffix of s2. Or in simple words we need to find whether string s2… Read More »

Given a string, write a recursive program to reverse it. Recommended: Please try your approach on {IDE} first, before moving on to the solution. Method… Read More »

Given a string s, print reverse of string and remove the characters from the reversed string where there are vowels in the original string. Examples:… Read More »

Given a binary string of length n and an integer k. Consider another string T which is formed by concatenating given binary string k times.… Read More »

Given an array arr containing elements from [1…to n]. Each element appears exactly once in the array arr. Given an string str of length n-1.… Read More »

Given a string as input, write a program to convert the characters of given string into hexadecimal equivalent of ASCII values. Examples : Input :… Read More »

Given Hexadecimal value string as input, the task is to convert the given hexadecimal value string into their corresponding ASCII format string. Examples: Input: 6765656b73… Read More »

Given a string S consisting of only characters ‘a’ and ‘b’, and an integer N. The string S is added N times to obtain string… Read More »

Given a string of lowercase alphabets, the task is to find indexes of a substring with given power. Assume power of a to be 1,… Read More »

Given an array of n numbers. The task is to find the number of pairs that can be taken from the given which on concatenation… Read More »

Given a string, the task is to check if the string can be made palindrome by swapping a character only once. [NOTE: only one swap… Read More »

Given a string, the task is to find all the palindromic sub-strings from the given string. In Set – 1, another approach has been already… Read More »

We are given an integer N. We need to count the total number of such binary strings of length N such that the number of… Read More »

Given a string of length n of capital letters. The task is to find the count of ‘GFG’ subsequence in the given string. Examples: Input… Read More »