Hi, nice problem. It would be more interesting if you create a test condition with varying length and varying level of sub-string similarity. For example, {'1','2','1111','1112','1113','1121','1122','11111'} etc. That would force people to come up with a nice recursive algorithm.
Hi @rifat I am plesure that you like my problem also thanks for your recommendation I think that will be second questions
The problem description needs to specify the solution/output order or accept it in any order: I had to sort it in accordance with similarity-length (if someone is wondering). And I liked your problem, but I had to infer many aspects of it from the test suite. It is not clear by the problem description alone that the similarity-length may be greater than one.
306 Solvers
238 Solvers
154 Solvers
412 Solvers
436 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!