Easy

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode 3507 note: n is tiny, so simulate; the right side of a slice assignment must be a list

LeetCode 3492 note: at most n² cells and at most maxWeight // w by weight, so take the smaller, using integer division

LeetCode 1768 note: take characters in turn with one index, then append whatever remains of the longer string

LeetCode 1431 note: compute the maximum once; a kid is True when their candies plus the extra reach >= the maximum, since a tie counts

LeetCode 3487 note: free deletion means picking distinct values; take every non-negative one, or only the maximum when all are negative

LeetCode 3136 note: length at least 3, alphanumeric only, at least one vowel and at least one consonant; digits are not consonants

LeetCode 2000 note: find the first index i of ch, reverse word[:i + 1] and append the rest; return the word unchanged if ch is absent

LeetCode 3131 note: every element gets the same x, so x is the difference of the two minimums (or of the sums divided by the length)

LeetCode 3120 note: collect the letters seen in lowercase and in uppercase; the size of their intersection is the answer