Minimum moves required to type a word in QWERTY based keyboard
Given a string S consisting of only lowercase English letters. The task is to find the minimum number of times of finger moves to type… Read More »
Given a string S consisting of only lowercase English letters. The task is to find the minimum number of times of finger moves to type… Read More »
Given a string str, consisting of lowercase English alphabets, the task is to calculate the sum of indices(1-based indexing) of the characters removed to obtain… Read More »
Given an array string[] consisting of N numeric strings of length M, the task is to find the number of distinct strings that can be… Read More »
Prerequisite: Trie | (Insert and Search) Given an array of strings words[] and a partial string str, the task is to find the strings of… Read More »
Given a string S of Size N. Initially, the value of count is 0. The task is to find the value of count after N… Read More »
Given an array arr[] of N strings and a string order which represents the new alphabetical order of the string. The task is to find… Read More »
Given a numeric string str, the task is to calculate the number of substrings with the sum of digits equal to their length. Examples: Input:… Read More »
Given a string str, a character ch and an integer K, the task is to find the minimum number of operations required to convert all… Read More »
Given a string S of length N which only contains lowercase alphabets. Find the length of the longest substring of S such that the characters… Read More »
Given a numeric string str, the task is to find the minimum number of digits to be removed from the string such that it satisfies… Read More »
Given a string S and an integer K, the task is to find the number of substrings which consists of at least K pairwise distinct… Read More »
Given a binary string S, the task is to find the minimum number of swaps required to be performed to maximize the value represented by… Read More »
Given string str, the task is to print the middle character of a string. If the length of the string is even, then there would… Read More »
Given a string S of length N and integer K, find the smallest length string which contains the string S as a sub string exactly… Read More »
Given an integer N, the task is to find the minimum number of bits required to be flipped to convert the binary representation of N… Read More »