Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1460 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1460 # by problem number
lcpy gen -s make_two_arrays_equal_by_reversing_subarrays # by problem name
target and arr. In one step, you can select any non-empty subarray of arr and reverse it. You are allowed to make any number of steps.
Return true if you can make arr equal to target or false otherwise.
Input: target = [1,2,3,4], arr = [2,4,1,3]
Output: true
Explanation: You can follow the next steps to convert arr to target:
1- Reverse subarray [2,4,1], arr becomes [1,4,2,3]
2- Reverse subarray [4,2], arr becomes [1,2,4,3]
3- Reverse subarray [4,3], arr becomes [1,2,3,4]
There are multiple ways to convert arr to target, this is not the only way to do so.
Input: target = [7], arr = [7]
Output: true
Explanation: arr is equal to target without any reverses.
Input: target = [3,7,9], arr = [3,7,11]
Output: false
Explanation: arr does not have value 9 and it can never be converted to target.
from collections import Counter
class Solution:
# Time: O(n)
# Space: O(n)
def can_be_equal(self, target: list[int], arr: list[int]) -> bool:
return Counter(target) == Counter(arr)
| Time | Space |
|---|---|
| O(n) | O(n) |