## Hamming Distance between two strings

You are given two strings of equal length, you have to find the Hamming Distance between these string. Where the Hamming distance between two strings… Read More »

- Convert an unbalanced bracket sequence to a balanced sequence
- Maximum String Partition
- Number of substrings that start with "geeks" and end with "for"
- Count number of substrings of a string consisting of same characters
- Program to duplicate Vowels in String
- Count all substrings having character K
- Lexicographically smallest string of length N and sum K
- Compare two strings considering only alphanumeric characters
- Minimum given operations required to convert a given binary string to all 1's
- Check duplicates in a stream of strings
- Queries for rotation and Kth character of the given string in constant time
- Minimum number of substrings the given string can be splitted into that satisfy the given conditions
- Check if string can be rearranged so that every Odd length Substring is Palindrome
- Print characters having even frequencies in order of occurrence
- How to Append a Character to a String in C
- Minimum cost to convert str1 to str2 with the given operations
- Reverse the given string in the range [L, R]
- Modulo of a large Binary String
- Check if expression contains redundant bracket or not | Set 2
- Reverse every word of the string except the first and the last character
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Largest substring of str2 which is a prefix of str1
- Find the character made by adding all the characters of the given string
- Find the occurrence of the given binary pattern in the binary representation of the array elements
- Print characters in decreasing order of frequency
- Longest substring such that no three consecutive characters are same
- Sort groups of numbers and characters separately in a String
- Expand the string according to the given conditions
- Find the number of strings formed using distinct characters of a given string
- Lexicographical ordering using Heap Sort

You are given two strings of equal length, you have to find the Hamming Distance between these string. Where the Hamming distance between two strings… Read More »

The Affine cipher is a type of monoalphabetic substitution cipher, wherein each letter in an alphabet is mapped to its numeric equivalent, encrypted using a… Read More »

Given two positive numbers calculate the minimum and maximum possible sums of two numbers. We are allowed to replace digit 5 with digit 6 and… Read More »

Given a dictionary, a method to do a lookup in the dictionary and a M x N board where every cell has one character. Find… Read More »

Given two strings, the task is to find if they are only less than or equal to k edit distance apart. It means that strings… Read More »

Given a string S, and two type of queries. Type 1: 1 L x, Indicates update Lth index of string S by x character. Type… Read More »

Given a number (as string) and two integers a and b, divide the string in two non-empty parts such that the first part is divisible… Read More »

Given a string S and Q queries, each query contains a string T. The task is print “Yes” if T is subsequence of S, else… Read More »

Given a string X. Form a string S by repeating string X multiple times i.e appending string X multiple times with itself. There are Q… Read More »

In C/C++, a string is a 1-D array of characters and an array of string in C is a 2D array of characters. This comes… Read More »

Given 3 strings of all having length < 100,the task is to find the longest common sub-sequence in all three given sequences. Examples: Input :… Read More »

Given a Binary Number as string, print its 2’s complements. 2’s complement of a binary number is 1 added to the 1’s complement of the… Read More »

in a given string in which we toggle all characters. Examples: Input : gfg Output : GFG Input : aBc12# Output : AbC12# Input :… Read More »

Given a integer K. Task is Print All binary string of size K (Given number). Examples: Input : K = 3 Output : 000 ,… Read More »

Given a string that (may) be appended with a number at last. You need to find whether the length of string excluding that number is… Read More »