Understanding O(log n) and O(n^2) time Complexity: Chess interview ep4

This video is the fourth day of a 30 days challenge to prepare mentally and otherwise for your technical interview in software development roles.

On day four here we dive deep into O(log n) and O(n^2) explains binary search , hash sets etc