Find two elements with given sum in BST- expected answer in O(n) time ans O(1) space complexity. Java OOPS Singleton, Synchronized and Puzzles

Question

Find two elements with given sum in BST-  expected answer in O(n) time ans O(1) space complexity. Java OOPS Singleton, Synchronized and Puzzles

Anonymous · Accepted Answer

The key in these questions is to cover the fundamentals, and be ready for the back-and-forth with the interviewer.


Might be worth doing a mock interview with one of the MobiKwik or ex-MobiKwik  Senior Java Developer experts on Prepfully? They give real-world practice and guidance, which is pretty helpful.


prepfully.com/practice-interviews

Anonymous · Answer

Convert BST to DLL (sorted), and find the pair in linear time.

Mobikwik

Mobikwik interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches