H Index - Leetcode 274 - Arrays & Strings (Python)

Master Data Structures & Algorithms for FREE at AlgoMap.io/
Code solutions in Python, Java, C++ and JS for this can be found at my GitHub repo here: github.com/gah...
Complete DSA Pathway Zero to Hero: • Data Structures & Algo...
Please check my playlists for free DSA problem solutions:
• Fundamental DSA Theory
• Array & String Questions
• 2 Pointers Questions
• Sliding Window Questions
• Binary Search Questions
• Stack Questions
• Linked List Questions
• Tree Questions
• Heap Questions
• Recursive Backtracking...
• Graph Questions
• Dynamic Programming (D...
My Data Science & ML KZbin Playlist: • Greg's Path to Become ...
Learn Python and Data Science FASTER at mlnow.ai :)
Support the content: / @greghogg
Follow me on Instagram: / greghogg5
Connect with me on LinkedIn: / greghogg
Follow me on TikTok: / greghogg5
Coursera Plus: imp.i384100.ne...
My Favorite Courses:
Data Structures & Algorithms:
UCalifornia San Diego DSA: imp.i384100.ne...
Stanford Algorithms: imp.i384100.ne...
Python Data Structures: imp.i384100.ne...
Meta Coding Interview Prep: imp.i384100.ne...
Python:
UMichigan Python for Everybody: imp.i384100.ne...
Python Mastery from MLNOW.ai: mlnow.ai/cours...
Google IT Automation w/ Python: imp.i384100.ne...
Web Dev / Full Stack:
Meta Front-End Developer: imp.i384100.ne...
IBM Full Stack Developer: imp.i384100.ne...
Meta Back-End Developer: imp.i384100.ne...
John Hopkins HTML, CSS & JS: imp.i384100.ne...
IBM DevOps: imp.i384100.ne...
Cloud Development:
AWS Fundamentals: imp.i384100.ne...
GCP Cloud Engineer: imp.i384100.ne...
Microsoft Azure Fundamentals: imp.i384100.ne...
Game Development:
Michigan State Unity Development: imp.i384100.ne...
UColorado C++ for Unreal Engine: www.coursera.o...
SQL & Data Science:
SQL by MLNOW.ai: mlnow.ai/cours...
Python for Data Science by MLNOW.ai: mlnow.ai/cours...
Google Data Analytics: imp.i384100.ne...
IBM Data Science: imp.i384100.ne...
IBM Data Engineer: imp.i384100.ne...
Machine Learning & AI:
ML Mastery at MLNOW.ai: mlnow.ai/cours...
ML w/ Andrew Ng: www.coursera.o...
Deep Learning w/ Andrew Ng: imp.i384100.ne...

[@GregHogg]

Master Data Structures & Algorithms for FREE at AlgoMap.io/

[@mohammadrafi895]

I think both Array and DP problems are equally hard. In DP, you have to catch the pattern which is the hardest bit. And for array problems, you never know when any concept out of the blue can be applied like Counting Sort.

[@NikitaNair]

Amazing logic using counting sort!!!

[@spacetime_wanderer]

Amazing explanation Greg! You helped me to build my intuition. Subscribed!

[@ackeman9386]

Teaching me as if I were dumb. I love that!

[@GregHogg]

This one is pretty tricky so I had to really dumb it down lol

[@survivourff7014]

Your dsa videos are really good…pls try to cover all the topics bro

[@alisheheryar1770]

Good job of Brute Force and Optimal solution.

[@dreadknot66]

Hey, Greg! Great explanation. Can you please make a video on LRU Cache?

[@pooyadehghani4324]

class Solution: def hIndex(self, citations: List[int]) -> int: n = len(citations) citations.sort() h_index = 0 for i in range(1,n+1): if citations[n - i] >= i: h_index += 1 return h_index

[@gopircr]

Nice explanation for a confusing problem

[@AdoniyasGetnet]

class Solution: def hIndex(self, citations): citations.sort(reverse=True) print(citations) j=0 n=len(citations) for i in citations: if i>j: j+=1 return j

[@the_dopekid9311]

Great solution, can you pls explain the logic here once.

[@sharpiemaster7351]

What drawing software do you use?

[@edwinantonius63]

I like this solution, my initial gut feeling made me thing about creating a dictionary of citation counts paired with a rank....

[@CyrusWong-yq4uw]

Hi Greg, can you please upload a tutorial about Leetcode Question 34 Find First and Last Position of Element in Sorted Array? I am struggling on it and I need some help. Thank you so much !

[@GuilhermeDugaichdeOliveira]

Great one! What is the app you use for drawing?

[@chisomedoka5651]

Mira

[@AnkitGupta-vg1uc]

Good explanation.

[@sekharkumar3824]

OMG if you start explaining even a small kid can understand any complex problem easy-peasy

[@Democratic_people]

amazing bro.

[@survivourff7014]

Bro…pls make a video on bit manipulation

[@adithyar3160]

hi @gregg buddy, can you do a video on LRU cache. Thank you in advance.

[@GregHogg]

Okay I'll try

[@HùngTô-i4d]

Thanks

[@mohammadrafi895]

You should start teaching online officially.

[@GregHogg]

What does that mean exactly haha

[@mohammadrafi895]

@@GregHogg Like starting your website where you offer paid courses. :)

[@mohammadrafi895]

@@GregHogg You have the most articulate way of teaching. I've seen any tutors that teach so elegantly. I'd love to see your courses where you go in-depth about concepts.

[@sammmywammmy]

good explanation but feels too fast

[@0xDomain]

I used sorting to solve this

[@xAllaboutx]

nice, I have got: "Beats 91%" with this, I kept using the n variable, skipping the h variable, no need for h = n

[@BraulioRojas-tf8pv]

I think it was only to make it clearer as they're asking for the H Index

[@freesoftwares6042]

oki got thru this , but how tf a test case [11,15] is supose to return 2 , is leetcode drunk orsomething?

[@ardenmatikyan9658]

There are 2 papers with at least 2 citations. The max h is 2