H index | Leetcode #274

preview_player
Показать описание
This video explains the H-index problem of leetcode which is very similar to H-index 2 problem of leetcode 275.In this problem, we are given an array of unsorted citations and we need to find h-index while in the h-index 2 problem, the citations are provided in non-decreasing order.The challenge here is to find the maximum possible h-index value.We can use sorting and then apply linear search or binary search to solve the problem.I have shown the code for binary search technique.Please watch the h-index 2 video for better clarity and full explanation.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 :)

========================================================================
Join this channel to get access to perks:

=======================================================================

USEFUL VIDEOS:-
Рекомендации по теме
Комментарии
Автор

Bruh stop sending links. Just tell it here

DaksheshGusain
Автор

unrelated question, which tool are u using for making these videos ?

arsalalam
Автор

I'was just trying to sleep, then it comes 💚 #added another one to memory

designsrs
Автор

Nice video 😊 too much
Thank you so much sir ❤️😇💕

kunalsoni
Автор

Areee yar y you kept premimum for this this is not good

shivashooter
Автор

Sir, i think you have covered almost all topics...but haven't made any video on Segment Trees yet..sir, i hearty request you to cover this whole topic
I know this is not a giant topic...but no content is available on this topic on YouTube!

ayushgarg
Автор

What is #274 at the last of video title.

ArbitCode