LogFAQs > #961137049

LurkerFAQs, Active DB, DB1, DB2, DB3, DB4, DB5, DB6, DB7, DB8, DB9, Database 10 ( 02.17.2022-12-01-2022 ), DB11, DB12, Clear
Topic List
Page List: 1
TopicAnother day, another rejection from a software developer position. Time to grind
BIueJay
12/22/21 5:28:44 PM
#39:


Day 20

Went back to complete the last question I struggled with yesterday. I had to look it up, and it turns out it's similar to a question I also had to look up long ago. I fully understand the solution now, but I guess I need to figure out when to apply this pattern. Because normally I'd be looking for some greedy solution from the way it's described. This answer is basically just find the best possible one by one by slowly moving to the correct solution. Hmm...

Second question is https://leetcode.com/problems/the-k-strongest-values-in-an-array/. Very straight forward using sorting and two pointers. Answered a bunch of these before.

Third question is https://leetcode.com/problems/most-frequent-subtree-sum/. Also very straight forward. I kinda yolo'd and submitted the solution once I finished coding it. Usually I'd do my own test cases. I was expecting at least a compile error, but I got it right. I'm definitely not doing that again, else I'll start to form bad habits.
... Copied to Clipboard!
Topic List
Page List: 1