I’m aiming google/fb london/zurich. The problem is to create an iterator for binary search tree. To solve this problem I’ve implemented morris traversal but it’s a bit tricky algo so took a lot of time to debug and make all testcases pass. Am i so far behind the hiring bar?
There are so many Asian kids who can solve this problem just if you give the problem number.