Loading...
Engaged Employer
Conversion of tree to doubly linked list.
Anonymous
Can be done simply using stack. Try to make your algo as efficient as possible. O(n^2) is okayish. O(n) Is cool.
Check out your Company Bowl for anonymous work chats.
Get actionable career advice tailored to you by joining more bowls.
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalized job recommendations and updates by starting your searches.