Given a string of length n and a non-negative integer k. Find k distant string of given string. Distance between two letters is the difference between their positions in the alphabet. for example:
- dist(c, e) = dist(e, c) = 2.
- dist(a, z) = dist(z, a) = 25.
By using this concept, the distance between two strings is the sum of distances of corresponding letters. For example :
- dist(af, hf) = dist(a, h) + dist(f, f) = 7 + 0 = 7.
Given a string and a distance k. Task is to find a string such that distance of the result string is k from given string. If k distant string is not possible, then print "No".
Note: There may exist multiple solutions. We need to find one of them.
Examples :
Input : bear
k = 26
Output : zcar
Here, dist(bear, zcar) =
dist(b, z) + dist(e, c) +
+ dist(a, a) + dist(r, r)
= 24 + 2 + 0 + 0
= 26
Input : af
k = 7
Output : hf
Here, dist(af, hf) = dist(a, h) + dist(f, f)
= 7 + 0
= 7
Input : hey
k = 1000
Output : No
Explanation :
No such string exists.
There is no solution if the given required distance is too big. Think what is the maximum possible distance for the given string. Or the more useful thing — how to construct the lost string to maximize the distance? Treat each letter separately and replace it with the most distant letter.
For example, we should replace 'c' with 'z', and we should replace 'y' with 'a'. To be more precise, for the first 13 letters of the alphabet the most distant letter is 'z', and for other letters, it is 'a'. The approach is simple, iterate over letters of the given string and greedily change them. The word "greedily" means when changing a letter, don't care about the next letters. Generally, there must be distant letters, because there may not be a solution otherwise. For each letter of the given string change it into the most distant letter, unless the total distance would be too big. As letters are changed, decrease the remaining required distance. So, for each letter of the given string consider only letters not exceeding the remaining distance, and among them choose the most distant one. CPP and JAVA Implementation:
Implementation:
CPP
// CPP program to find the k distant string
#include <bits/stdc++.h>
using namespace std;
// function to find the
// lost string
string findKDistantString(string str, int k)
{
int n = str.length();
for (int i = 0; i < n; ++i) {
char best_letter = str[i];
int best_distance = 0;
for (char maybe = 'a';
maybe <= 'z'; ++maybe)
{
int distance = abs(maybe - str[i]);
// check if "distance <= k",
// so that, the total distance
// will not exceed among
// letters with "distance <= k"
if (distance <= k && distance >
best_distance)
{
best_distance = distance;
best_letter = maybe;
}
}
// decrease the remaining
// distance
k -= best_distance;
str[i] = best_letter;
}
assert(k >= 0);
// we found a correct
// string only if "k == 0"
if (k > 0)
return "No";
else
return str;
}
// driver function
int main()
{
string str = "bear";
int k = 26;
cout << findKDistantString(str, k) << endl;
str = "af";
k = 7;
cout << findKDistantString(str, k) << endl;
return 0;
}
// Java program to find k distant string
import java.util.*;
import java.lang.*;
public class GfG {
// function to find
// the lost string
public static String findKDistantString
(String str1, int k)
{
int n = str1.length();
char[] str = str1.toCharArray();
for (int i = 0; i < n; ++i) {
char best_letter = str[i];
int best_distance = 0;
for (char maybe = 'a';
maybe <= 'z'; ++maybe)
{
int distance =
Math.abs(maybe - str[i]);
// Check if "distance <= k"
// so that it should not
// exceed the total distance
// among letters with "distance
// <= k" we choose the most
// distant one
if (distance <= k && distance
> best_distance)
{
best_distance = distance;
best_letter = maybe;
}
}
// we decrease the remaining
// distance
k -= best_distance;
str[i] = best_letter;
}
assert(k >= 0);
// Correct string only
// if "k == 0"
if (k > 0)
return "No";
else
return (new String(str));
}
public static void main(String argc[])
{
String str = "bear";
int k = 26;
System.out.println(findKDistantString(str, k));
str = "af";
k = 7;
System.out.println(findKDistantString(str, k));
}
}
# Python implementation to check if
# both halves of the string have
# at least one different character
MAX = 26
# Function which break string into two halves
# Counts frequency of characters in each half
# Compares the two counter array and returns
# true if these counter arrays differ
def function(st):
global MAX
l = len(st)
# Declaration and initialization
# of counter array
counter1, counter2 = [0]*MAX, [0]*MAX
for i in range(l//2):
counter1[ord(st[i]) - ord('a')] += 1
for i in range(l//2, l):
counter2[ord(st[i]) - ord('a')] += 1
for i in range(MAX):
if (counter2[i] != counter1[i]):
return True
return False
# Driver function
st = "abcasdsabcae"
if function(st): print("Yes, both halves differ by at least one character")
else: print("No, both halves do not differ at all")
# This code is contributed by Ansu Kumari
// C# program to find k distant string
using System;
class GfG {
// function to find the lost string
public static String findKDistantString
(string str1, int k)
{
int n = str1.Length;
char []str = str1.ToCharArray();
for (int i = 0; i < n; ++i) {
char best_letter = str[i];
int best_distance = 0;
for (char maybe = 'a';
maybe <= 'z'; ++maybe)
{
int distance =
Math.Abs(maybe - str[i]);
// Check if "distance <= k"
// so that it should not
// exceed the total distance
// among letters with "distance
// <= k" we choose the most
// distant one
if (distance <= k && distance
> best_distance)
{
best_distance = distance;
best_letter = maybe;
}
}
// we decrease the remaining
// distance
k -= best_distance;
str[i] = best_letter;
}
//(k >= 0);
// Correct string only
// if "k == 0"
if (k > 0)
return "No";
else
return (new string(str));
}
// Driver code
public static void Main()
{
string str = "bear";
int k = 26;
Console.WriteLine(
findKDistantString(str, k));
str = "af";
k = 7;
Console.Write(
findKDistantString(str, k));
}
}
// This code is contributed by Nitin millal.
<script>
// JavaScript program to find the k distant string
// function to find the
// lost string
function findKDistantString(str,k)
{
let n = str.length;
for (let i = 0; i < n; ++i) {
let best_letter = str[i];
let best_distance = 0;
for (let maybe = 97; maybe <= 122; ++maybe)
{
let distance = Math.abs(maybe - str.charCodeAt(i));
// check if "distance <= k",
// so that, the total distance
// will not exceed among
// letters with "distance <= k"
if (distance <= k && distance >
best_distance)
{
best_distance = distance;
best_letter = String.fromCharCode(maybe);
}
}
// decrease the remaining
// distance
k -= best_distance;
str = str.replace(str[i],best_letter);
}
// we found a correct
// string only if "k == 0"
if (k == 0)
return str;
else
return "No";
}
// driver function
let str = "bear";
let k = 26;
document.write(findKDistantString(str, k),"</br>");
str = "af";
k = 7;
document.write(findKDistantString(str, k),"</br>");
// This code is contributed by shinjanpatra
</script>
Time Complexity: O(n), where n is the size of the given string.
Auxiliary Space: O(1), no extra space is required, so it is a constant.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem