2
Could Someone tell the optimal approach
source link: https://codeforces.com/blog/entry/116941
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Could Someone tell the optimal approach
You are given an array of strings A of size N. You need to pick two strings Ai and Aj such that len(Ai)* len(Aj) is maximized. Thanks in advance. Edit : Sry, forgot to add the constraints : there was a condition stating those two strings should have no common characters, then what would be the optimal solution ?
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK