Leetcode Problems
task id: leetcoding2024-11-17 08:47: 334: increasing triplet subsequence #leetcoding #timelog:00:45:10
2024-11-17 14:36: LC347: top k frequent elements #leetcoding #timelog:00:17:32
This is a variation of top K frequent words
2024-11-17 08:47: 334: increasing triplet subsequence #leetcoding #timelog:00:45:10
2024-11-17 14:36: LC347: top k frequent elements #leetcoding #timelog:00:17:32
This is a variation of top K frequent words
I glanced at this one I think. I don't think I ever actually tested it.
Well, I didn't understand this problem when I first read it. A subsequence doesn't have to be consecutive. Before I looked at the answer, I tried making it a sliding window problem, and it failed the edge cases.