Problem
"You have a reason to leave this place, but I don't."
In the fourth game, Sang-Woo and Ali are competing against each other. Sang-Woo is the more intelligent one between them, and he plans to win the game by cheating. Ali is your childhood friend and you want to help him win this game. The game goes as follows.
Both of them are given strings — and — of equal length (say ). The task is to find the minimum number of operations required to convert the string into . Every character of both and is either a lowercase English alphabet or .
First, before performing any operation, you must choose a single lowercase character from the English alphabet, and replace every occurrence of with this character. Note that every present in either or is replaced by the exact same character. This does not count as an operation.
Once the above step is done, you are allowed to perform the following two operations on any number of times:
- Pick an index such that is a vowel, and change to any consonant.
- Pick an index such that is a consonant, and change to any vowel.
Note: The vowels are the characters — the other are consonants.
Find the minimum number of operations required to convert into .
Input Format
- The first line of input contains a single integer , denoting the number of test cases. The description of test cases follows.
- The first line of each test case contains an integer , denoting the length of strings and .
- The second and third lines contain strings and respectively.
Output Format
For each test case, output in a single line the minimum number of operations required to convert into .
Constraints
- The sum of all across all test cases does not exceed .
- Every character of both and is either a lowercase English alphabet or .
- Every present in and should be assigned the same character.
Sample 1:
3 5 ab?c? aeg?k 6 abcde? ehio?? 4 abcd abcd
4 6 0
Explanation:
Test Case 1: First, replace every by . This gives us and . Now can be converted to as follows:
- Convert to in 1 operation.
- Convert to in 1 operation.
- Convert to in 1 operation.
- Convert to in 1 operation.
Test Case 3: The strings are already equal, so no operations are required.
Code(C++):-
Code(JAVA):-import java.util.*;import java.lang.*;import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */class Codechef{ //cases //1. both vowels =+2 //2. both consonents = +2 //3. both ? = nothing //4 one vowel one consonent =+1 // we also maintain count of ?-vowels and ?-consonents whichever is greater // cases 2 //?-vowels count == ?-consonents so we simply add public static void main (String[] args) throws java.lang.Exception { // your code goes here Scanner sc = new Scanner(System.in); int T= sc.nextInt(); while(T-->0){ int n = sc.nextInt(); String s = sc.next(); String p = sc.next(); int res =Integer.MAX_VALUE; for(int i=0;i<26;i++){ char[] s1 = s.toCharArray(); char[] p1 = p.toCharArray(); int cur = 0; for(int j=0;j<n;j++){ if(s1[j]=='?'){ s1[j] = (char)(i+97); } if(p1[j]=='?'){ p1[j] = (char)(i+97); } if(s1[j]==p1[j]){ continue; } // System.out.println(s1[j]+" "+p1[j]+" "+cur+" "+(char)(i+97)); if(isVowel(s1[j])&&!isVowel(p1[j])){ cur+=1; }else if(!isVowel(s1[j])&&isVowel(p1[j])){ cur+=1; }else if(isVowel(s1[j])&&isVowel(p1[j])){ cur+=2; }else if(!isVowel(s1[j])&&!isVowel(p1[j])){ cur+=2; } } // System.out.println(cur+" "+(char)(i+97)); res = Integer.min(res,cur); } System.out.println(res); } } public static boolean isVowel(char ch){ if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u'){ return true; } return false; }}
Recommended Post :-
- Swap the adjacent characters of the string
- Double the vowel characters in the string
- Character with their frequency
- Program to find the closest value
- Swap adjacent characters
- Double the vowel characters
- Check valid parenthesis
- Print the characters with their frequencies
- Find closest value
- Word Count
- Program of CaesarCipher
- Program to find the perfect city
- Annual Day | Tech Mahindra coding question
- Find the number of pairs in the array whose sum is equal to a given target.
Full C course:-
Key points:-
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.
Cracking the coding interview:-
Array and string:-
Tree and graph:-
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
MCQs:-
0 Comments