Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given two strings: s1 and s2 with the same size, check if some permutation of string s1 can break some permutation of string s2 or vice-versa. In other words s2 can break s1 or vice-versa.
A string x can break string y (both of size n) if x[i] >= y[i] (in alphabetical order) for all i between 0 and n-1.
 
Please complete the following python code precisely:
```python
class Solution:
    def checkIfCanBreak(self, s1: str, s2: str) -> bool:
```