## 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 »

- First non-repeating character using one traversal of string | Set 2
- string find in C++
- Remove all occurrences of a character in a string
- Check if two strings are permutation of each other
- Find time taken for signal to reach all positions in a string
- Count numbers in range such that digits in it and it's product with q are unequal
- Average of ASCII values of characters of a given string
- Remove duplicates from a string in O(1) extra space
- Check if the given string of words can be formed from words present in the dictionary
- Find the player who rearranges the characters to get a palindrome string first
- Count Occurences of Anagrams
- Check if a string contains only alphabets in Java using Lambda expression
- Count changes in Led Lights to display digits one by one
- Check if any permutation of a large number is divisible by 8
- Reverse middle words of a string
- Sum of similarities of string with all of its suffixes
- Check if a string contains only alphabets in Java using ASCII values
- Maximum power of jump required to reach the end of string
- Longest Common Subsequence | DP using Memoization
- Alternatively Merge two Strings in Java
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
- Count common subsequence in two strings
- Minimum number of Parentheses to be added to make it valid
- Edit distance and LCS (Longest Common Subsequence)
- Find the missing value from the given equation a + b = c
- Count number of substrings with numeric value greater than X
- Solve the Logical Expression given by string
- Rearrange the string to maximize the number of palindromic substrings
- Length of longest common subsequence containing vowels
- Longest substring with count of 1s more than 0s

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 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 »

The Latin Alphabet Cipher Encryption Technique is one of the earliest and simplest techniques of encrypting data. It’s simply a type of substitution cipher technique,… Read More »