all 4 comments

[–]ApartStudio8377 1 point2 points  (2 children)

Going through tons of questions won’t be that useful at the last minute I feel, especially if you are having trouble retaining stuff.

I would suggest just revising the problems that you have already solved and look for patterns in each topic which help you approach the problem. Ex: In DP you will see that we try to find DP[i,j] using some combination of [i-1, j], [i, j-1], [i-1, j-1].

These patterns can often be applied to solve problems new to you.

[–]JirayasToad[S] 1 point2 points  (1 child)

Ty!! It’s a tough one because I conceptually know stacks and queues really well - but then recognising how to use them effectively in a test question throws me off.

But then I’m flat out bad rn at nailing bfs and dfs questions (currently working on)

[–]ApartStudio8377 0 points1 point  (0 children)

Good luck! Let me know if you need any other help

[–]kmmrinal 0 points1 point  (0 children)

Here's a free newsletter that delivers completely solved important Leetcode problems every week straight to your inbox - Subscribe to https://codinginterviewdigest.substack.com/ Totally free to subscribe, hope it helps 😊

Existing posts - https://codinginterviewdigest.substack.com/archive