String comparision without loopig

Help Activities
, , , ,
1

Hi,

I have two strings

L1-abcdefg
L2-fhjiofd
expected output is -ffd

Kindly help me on the same

2

Hi @joe2 ,

We might need more explanation on why the Output is to be formed in that way.

Could you provide what are you doing to get the output in that manner ?

3

it is based on comparing the strings as letter “f” is repeated more than once in the string it comes twice

4

@joe2 ,

But it is repeated 3 times, and in the output it is only twice, also the same for the letter “d”.

5

Compare it string 1 to string 2- in string 2 “f” it is repeated twice and “d” is repeated once

6

Still we do have some doubts as the requirement description does have some unspecified parts.

We assume that L1-, L2- is not part of check
We also cannot derive rules when String1 has more common chars as String 2 - relevant for the output position

However have a look here:
Common chars but ignoring the occurences:
grafik

And
grafik

2 Likes
7

thank you the string joined worked

8

This topic was automatically closed 3 days after the last reply. New replies are no longer allowed.