2185. Counting Words With a Given Prefix
Just practice writing Trie.
Month: January 2025
3402. Minimum Operations to Make Columns Strictly Increasing
Easy makes me happy.
3403. Find the Lexicographically Largest String From the Box I
Not hard. Should be aware of Boarder Cases ( numFrends == 1)
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…
1427. Perform String Shifts
Don’t forget mod when dealing with shifting. A negative number a: a % b = (a + b) % b Anyway, easy makes me…
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.
3407. Substring Matching Pattern
This easy is easier than yesterday’s easy. New tech: str.find(sub) / str.rfind(sub). find the first/last index of sub. if sub == “”, return 0/n;…
