Problem of the Day: Remove Duplicate Characters and Digits with Different Rules You are given a string s consisting of lowercase English letters and digits (0–9). You must transform the string in two steps: Characters (a–z): Traverse from left to right. Keep only the first occurrence of each character. Remove all later duplicates. Digits (0–9): Traverse from right to left. Keep only the first digit you encounter (the rightmost occurrence in the original string). Remove earlier duplicates. Return the final transformed string. 1.Input: programming123321 After Step1: progamin123321 Final: progamin321 (keeps the rightmost 1,2,3 — final digits appear as the left-to-right order of their last occurrences) 2. Input: abc11223344 After Step1: abc11223344 Final: abc1234 3. Input: a1b2c1d2e3 After Step1: a1b2c1d2e3 Final: abc1d2e3
class Prob1
ReplyDelete{
public static void main(String[]args)
{
String s = "Zohocorporations"; int k = 25;
String str = "";
for(int i = 0;i0 && i%k == 0)
{
System.out.print(str);
str = "";
}
str = s.charAt(i) + str;
}
if(str.length()>0)
{
System.out.println(str);
}
}
}