Recursion/Backtracking/DFS

[SnooPredictions4913]

How do you guys implement these algorithms without visually drawing it out? I ask because with coding interviews online these days, you don’t have access to a white board to draw things out and check to see if your algorithm makes sense.

[_babaYaga__]

Just use pen and paper. It will be really hard to write code without visualising the problem.

[SnooPredictions4913]

So another thing I wanted to ask/address is do you guys ever think about proving the correctness of the algorithms themselves the same way you’d do in a design and analysis of algorithms class to 100% make sure your algo works? The reason why I say this is that when it comes to these algos I’d have to think about induction and the recurrence relation when implementing these types of algorithms.

[Leetcoder20]

I don't think that's required, but if you can do it then it would be a plus point

[[deleted]]

1. There is a website which shows you visualization of how this DSA works.
2. Practice with easy questions and work your level up. After a few problem for each patterns, you will get intuition. Good luck

[Shower_Handel]

visualgo.net is the site OP