3403. Find the Lexicographically Largest String From the Box I
Not hard. Should be aware of Boarder Cases ( numFrends == 1)
Tag: Medium
3404. Count Special Subsequences
Point: Turn multiplication to fraction Hard to realize “for r in range(4, n – 2): q = r – 2” part.
2168. Unique Substrings With Equal Digit Frequency
Actually, brute force can work due to constrains. However, if we count the frequency every time, the time complexity will be O(n**3), which may…
3408. Design Task Manager
Point is: we don’t have to remove items immediately from heap after rmv / edit operation. Do it when we are going to execTop.
