Please note, this is a STATIC archive of website www.w3resource.com from 19 Jul 2022, cach3.com does not collect or store any user information, there is no "phishing" involved.
w3resource

Python: Find the h-index, the largest positive number h such that h occurs in the sequence at least h times

Python Programming Puzzles: Exercise-49 with Solution

Write a Python program to find the h-index, the largest positive number h such that h occurs in the sequence at least h times. If there is no such positive number return h = -1.

Input:
[1, 2, 2, 3, 3, 4, 4, 4, 4]
Output:
4

Input:
[1, 2, 2, 3, 4, 5, 6]
Output:
2

Input:
[3, 1, 4, 17, 5, 17, 2, 1, 41, 32, 2, 5, 5, 5, 5]
Output:
5

Pictorial Presentation:

Python: Find the h-index, the largest positive number h such that h occurs in the sequence at least h times.

Sample Solution:

Python Code:

#License: https://bit.ly/3oLErEI

def test(nums):
    return max([-1] + [i for i in nums if i > 0 and nums.count(i) >= i])

nums =  [1, 2, 2, 3, 3, 4, 4, 4, 4]
print("Original list of numbers:")
print(nums)
print("h-index, the largest positive number h such that h occurs in the said sequence at least h times:")
print(test(nums))
nums =  [1,2,2,3,4,5,6]
print("\nOriginal list of numbers:")
print(nums)
print("h-index, the largest positive number h such that h occurs in the said sequence at least h times:")
print(test(nums))
nums = [3, 1, 4, 17, 5, 17, 2, 1, 41, 32, 2, 5, 5, 5, 5]
print("\nOriginal list of numbers:")
print(nums)
print("h-index, the largest positive number h such that h occurs in the said sequence at least h times:")
print(test(nums))

Sample Output:

Original list of numbers:
[1, 2, 2, 3, 3, 4, 4, 4, 4]
h-index, the largest positive number h such that h occurs in the said sequence at least h times:
4

Original list of numbers:
[1, 2, 2, 3, 4, 5, 6]
h-index, the largest positive number h such that h occurs in the said sequence at least h times:
2

Original list of numbers:
[3, 1, 4, 17, 5, 17, 2, 1, 41, 32, 2, 5, 5, 5, 5]
h-index, the largest positive number h such that h occurs in the said sequence at least h times:
5

Flowchart:

Flowchart: Python - Find the h-index, the largest positive number h such that h occurs in the sequence at least h times.

Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:


Python Code Editor :

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Find the indices of two entries that show that the list is not in increasing order.
Next: Find the even-length words and sort them by length.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Python: Tips of the Day

Find current directory and file's directory:

To get the full path to the directory a Python file is contained in, write this in that file:

import os 
dir_path = os.path.dirname(os.path.realpath(__file__))

(Note that the incantation above won't work if you've already used os.chdir() to change your current working directory, since the value of the __file__ constant is relative to the current working directory and is not changed by an os.chdir() call.)

To get the current working directory use

import os
cwd = os.getcwd()

Documentation references for the modules, constants and functions used above:

  • The os and os.path modules.
  • The __file__ constant
  • os.path.realpath(path) (returns "the canonical path of the specified filename, eliminating any symbolic links encountered in the path")
  • os.path.dirname(path) (returns "the directory name of pathname path")
  • os.getcwd() (returns "a string representing the current working directory")
  • os.chdir(path) ("change the current working directory to path")

Ref: https://bit.ly/3fy0R6m