Techdose

This video explains a very unique programming interview problem which is based on binary search algorithm.The problem is to find the H index of the papers given the citations of each paper in ascending order.We are required to find the maximum value V such that there are atleast V number of papers having atleast V citations.Linear search is a trivial approach for this problem and may lead to TLE.We cannot apply simple binary to find the optimal result.We need to make use of some observations in order to apply the binary search.I have shown all the observations and have solved the problem using simple binary search.I have explained it with example and have also explained code walk through at the end.I have solved using nested binary search technique as well and the code for both methods are provided in the same link.CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

=================================================================
INSTAGRAM: https://www.instagram.com/surya.pratap.k/
LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168
=================================================================

CODE LINK: https://gist.github.com/SuryaPratapK/6545cceae867c0940b227dbf68b23f38
SIMILAR PROBLEMs:-
Aggressive Cow: https://youtu.be/SiE1XFhYoaA
Search Insert Position: https://youtu.be/0A40XJH_VvE

programming interview questionscoding interview questionsprogramming tutorialscomputer sciencegeeksforgeeksprogrammingleetcodeleetcode solutiontech doseH Index IIbinary searchleetcode #275nested binary searchmodified binary searchupper boundlower bounddivide and conquerfind indexH indexh index problemday 18june challengebinary search interview problemsearching algorithmsearching interview problem