Maximum Palindromes After Operations at MathWorks

Medium45.6% acceptance

This problem has 100.0% frequency at MathWorks.

Problem Description

You are given a **0-indexed** string array `words` having length `n` and containing **0-indexed** strings. You are allowed to perform the following operation **any** number of times (**including** **zero**): * Choose integers `i`, `j`, `x`, and `y` such that `0 <= i, j < n`, `0 <= x < words[i].l...

Read full problem and hints

Topics

Array Hash Table String Greedy Sorting Counting

Also asked at 6 companies

Bloomberg Expedia Grammarly Microsoft Salesforce Squarepoint Capital

View Full Problem

Problem Description

Topics

Also asked at 6 companies

More MathWorks Questions