I have a theory that it's because generating all subsets is an older problem and at that time this was considered hard, but right now the expected difficult level, of easy, medium and hard questions are increasing.
How can I handle nervousness and anxiety during an interview? I messed up my last interview due to this, even though the questions that were asked weren't that difficult.
I have very limited interview experience, but I'd suggest mock interviews, talking out your solution while you are doing Leetcode problems on your own. And only start coding once you have an algo, or solution. I like to write out the inputs, output requested, what my solution is, and before I start coding, I'll comment the whole solution out (pseudocode), then it's just a matter of writing the code under said comments. In cross country running circles there's a quote "the hay is in the barn", which basically means you worked your ass off, you just need to trust in the training, and perform. Edit: also work on asking interviewers clarifying questions, even if it seems obvious, or trivial, and always go for the naive solution first, unless the more optimal solution comes to you right away, but I'd also explain that to them "the brute force is", but "I believe because of" "this approach will be better". It's all about communicating your intent. Also, it might be beneficial to mention the time/space complexity with your solution.
Just practice. Most of us have been there. Apply for jobs that you don't care about getting. Ask a friend to do a mock with you (but provide them the q without knowing the solution- I have asked people in the past and they have tried 'making up' questions, and ended up asking something that goes beyond hard, lol).
Just build a truth table and you will understand the last solution... this will help in getting why the 50% percent ratio still the same even if we added a number with a one bit in the position we are looking at....
Wow, it's crazy huh. I couldn't believe it the problem is an easy problem. it's worth it solving the problem though, I think that would be enough knowing how to work the recursive solution. var subsetXORSum = function(nums) { let answer = 0; const b = (initialNums, choices) => { let xor = 0; for (let i = 0; i < initialNums.length; i++) { xor ^= initialNums[i]; } answer += xor; while (choices.length > 0) { b(initialNums.concat(choices.shift()), [...choices]); } } b([],nums); return answer; }; This is my solution, which is less efficient than the solution shown up in this video. It get rid of an element from the list the func gets then will pass the new array. I think the solution you introduced in the video has a point to understand how recursive works. Thanks for the video! 👍 --- ps I think why it's a bit hard to understand the solution is because the concept of passing by value, the total. In the case where nums is [5, 1, 6]. dfs(i + 1, total ^ nums[i]) i == 4 -> returns 0 0 ^ 6 + 0 ^ 1 + 0 ^ 5 + 0 (0 ^ 1) + (0 ^ 1) ^ 6 + 0 (0 ^ 5) + (0 ^ 5) ^ 1 + (0 ^ 5) ^ 6 + 0 (0 ^ 5 ^ 1) + 0
Thank you neetcode, was able to come up with first solution. was wondering any trick to introduce caching but since there are 2^n different possibilities so caching won't be helpful but still i have this doubt in my mind, is there any way we can introduce caching?
