#Savol #Uzbek #LeetCode #Medium #String 1433. Check If a Str | Karimov Tech

#Savol #Uzbek #LeetCode #Medium #String

1433. Check If a String Can Break Another String

Ikkita bir xil usunlikdagi string berilgan. Agar stringlardagi harflar o'rnini almashtirganda s1[ i ] har doim s2[ i ] dan kichik bo'lmasa, yoki aksincha bo'lsa, ya'ni s2[ i ] har doim s1[ i ] dan kichik bo'lmasa stringlar bir-birini sindira oladi deyiladi. Berilgan stringlar bir-birini sindira olsa true, aks holda false qaytaring.

Masalan:

Input: s1 = "abc", s2 = "xya"
Output: true

Chunki s2 ni "xya" holatdan permutation (belgilar o'rnini almashtirish) orqali "ayx" ga o'tkazsak, shunda s2 [ i ] har odim s1 [ i ] dan katta yoki teng bo'ladi (a == a, b < y, c < x )

Input: s1 = "abe", s2 = "acd"
Output: false

Chunki s1: "abe", "aeb", "bae", "bea", "eab" va "eba"

s2: "acd", "adc", "cad", "cda", "dac" va "dca".

bu kambinatsiyalarning hech biri ikkinchisini sindira olmaydi.

https://leetcode.com/problems/check-if-a-string-can-break-another-string/

@KarimovTech