Your Facebook account has just been hacked and you want to change its password. To create a strong password, Facebook just recommended you two strings S and T, each contains N lowercase English letters. You want to choose a password containing N lowercase English letters such that the i th character is either the i th character of S or the i th character of T. For example, if S = icyz and T = ixpc, then there are 8 different passwords that you can choose: icyz, icyc, icpz, icpc, ixyz, ixyc, ixpz, ixpc. The strength of your password is defined as the number of occurences of the most frequent letter. For example, the strength of icyz is 1 and the strength icpc is 2. You are wondering what is the strength of the strongest password that you can choose. Input Input begins with a line containing an integer N (1 ≤ N ≤ 100 000) representing the length of the passwords. The second line contains a string S containing N lowercase English letters. The third line contains a string S containing N lowercase English letters. Output Output contains an integer in a line representing the strength of the strongest password that you can choose. Sample Input #1 4 icyz ixpc Sample Output #1 2 Explanation for the sample input/output #1 This sample is illustrated by the example given in the problem description above. There is no password with a strength of greater than 2 that you can choose. Sample Input #2 11 goodluckfor contestants Sample Output #2 3 Sample Input #3 14 helpiamtrapped inanincfactory Sample Output #3 4

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Your Facebook account has just been hacked and you want to change its password. To create a strong
password, Facebook just recommended you two strings S and T, each contains N lowercase English letters.
You want to choose a password containing N lowercase English letters such that the i
th character is either
the i
th character of S or the i
th character of T.
For example, if S = icyz and T = ixpc, then there are 8 different passwords that you can choose: icyz,
icyc, icpz, icpc, ixyz, ixyc, ixpz, ixpc.
The strength of your password is defined as the number of occurences of the most frequent letter. For
example, the strength of icyz is 1 and the strength icpc is 2. You are wondering what is the strength of
the strongest password that you can choose.
Input
Input begins with a line containing an integer N (1 ≤ N ≤ 100 000) representing the length of the passwords.
The second line contains a string S containing N lowercase English letters. The third line contains a string
S containing N lowercase English letters.
Output
Output contains an integer in a line representing the strength of the strongest password that you can choose.
Sample Input #1
4
icyz
ixpc
Sample Output #1
2
Explanation for the sample input/output #1
This sample is illustrated by the example given in the problem description above. There is no password with
a strength of greater than 2 that you can choose.
Sample Input #2
11
goodluckfor
contestants

Sample Output #2
3
Sample Input #3
14
helpiamtrapped
inanincfactory
Sample Output #3

Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Public key encryption
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education