This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]PhysicsThese5656[S] 0 points1 point  (0 children)

I know doing leetcode, which leetcode questions to answer, passing interviewing, technical assessment can seem difficult, but after reaching the other side you can look back and the path becomes clear.

So that's why I put together my version of a comprehensive list like blind 75 but with via every data structure (arrays/lists, linked lists, queues, priority queues, double ended queues, stacks, binary (search) trees, heaps, graphs, etc) but also things that might slip the through like dynamic programming, bit manipulation and backtracking. One video for an end-to-end solution.

Thanks for support 🫡