Hey, is there a way to replace a single characters by 2 characters in a string ????
This was asked to me at 1 of the interviews.
I answered linked list, I mean, take each node as a character, so u can easily insert 2 nodes, if u want to replace 2 characters.
Is there a better algo ???
is there a way to replace a single characters by 2 characters in a string ????
Yes, of course.
I answered linked list, I mean, take each node as a character, so u can easily insert 2 nodes, if u want to replace 2 characters.
That's a very inefficient representation of a string, and your idea wouldn't work for array based strings.
It is of course heavy operation, but I think that would basically mean producing new string with two letters added instead of one letter for replacement. In this case, for my opinion, clearest is to use copy anyway. You could copy whole string segment in one memcopy type operation by doing copy only when next occurance is found or end of string is reached. Maybe worthwhile to consider the case that letter to replace was not found, in which case you can just return the original.
Yes, of course.
That's a very inefficient representation of a string, and your idea wouldn't work for array based strings.
Ma'am, can i know the algorithm or pseudo code.
If the replacement string is larger than the search string:
# Replace 3 with 99
[1][2][3][4][5] # Original
[1][2][3][4][5][] # Step 1
[1][2][3][4][4][5] # Step 2
[1][2][9][9][4][5] # Step 3If the replacement string is shorter than the search string:
# Replace 23 with 9
[1][2][3][4][5] # Original
[1][2][4][5][5] # Step 1
[1][9][4][5][5] # Step 2
[1][9][4][5] # Step 3If the replacement string is equal in length to the search string:
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.