2 ms·
> Off the top of my head, possible problems here might be: > 1. To handle trees easily you have to understand recursion. Well that's the point of the exercise
by lelanthran 11mo ago
> Off the top of my head, possible problems here might be:
> 1. To handle trees easily you have to understand recursion.
Well that's the point of the exercises I suggest - to learn recursion :-/
> No Big-O notation. Interviewers usually ask questions about time/space complexity
Well, that's the other half of the interview, I only promised that my method will cover half the questions :-)
- kubanczyk 11mo ago> Well that's the point of the exercises I suggest - to learn recursion :-/ Then we must have been talking past each other. We are considering this problem here: >> I never took affinity to computer science/math, but I love building real world products with software. [...] I am struggling with all the interviews that have these leetcode problems. Then your advice to these interview problem is to learn some CS - the useful parts of it? E.g. recursion is CS.
- lelanthran 11mo ago>>>but I love building real world products with software. > Then your advice to these interview problem is to learn some CS - the useful parts of it? Theory was not my advice. My advice was to do practical things with trees; I felt it would fit his love of building real things. I mean, I didn't recommend doing problems out of a textbook, did I?