Hey y’all, got a solution up for another Meta tagged question, Leetcode 339 Nested List Weight Sum as well as its 2 variants.

I don’t often see interviewers ask the original problem but rather, its 2 twists:

1. What if you had to implement your own schema?

Please make it simpler on your lives and reduce the scope of your schema.

2. What if you had to implement the solution with BFS?

Please note, the interviewer may ask you this as a follow-up if you don’t clearly explain the trade-offs between DFS and BFS approaches. All in all, you could very well be asked both variants in a single LC problem.

Check it out (or not!):

Leetcode 50, POW(x, n) (Link)

And if you haven't already, check out the previous one: Kth Smallest Digit Sums.

Reference to all of the Meta Variants, Playlists & Unknowns: https://leetcode.com/discuss/post/6615244/meta-variant-compilation-by-codingwithmi-0pm7/