Leetcode Weekly contest 320 - Medium - Closest Nodes Queries in a Binary Search Tree

In this video we discuss the second problem of Leetcode Weekly contest 320

[comedyz]

What would be interesting to understand here is why use binary search explicitly on an array? Why not search a bst? That logical jump will help programmers so much during a contest

[nitinkukreti]

I missed today contest but after contest I did only hard one

[sabarivenkateshk]

Hello there !!
Have u done any videos for the other two problems Minimum Fuel Cost to Report to the Capital and Number of Beautiful Partitions ???

[shubamgoswami]

solved with recursion in java gives tle passed in c++ for me java is like love hate relationship for me