Count 'hello' Copies

Problem Statement

Count 'hello' Copies Problem Description Anaya runs a small print shop that creates custom banners using letter tiles. One afternoon, a customer arrives with a bag full of random lowercase letter (a-z) and asks her to print the word "hello" multiple times. To fulfill the request, Anaya needs to figure out how many complete copies of "hello" she can form using the available tiles. With several pending orders, she could use your help to quickly find the answer. Input Format A single line containing a string S, consisting only of lowercase English letters (a-z). Output Format An integer representing the maximum number of times the word "hello" can be formed using the characters from the given string. Examples Example 1: Input: helworld Output: 1 Explanation: From the string "helworld", one complete "hello" can be formed using 'h', 'e', 'l', 'l', 'o'. Example 2: Input: hbebhgtlellooffgf Output: 2 Explanation: From the string "hbebhgtlellooffgf", two complete "hello"s can be formed. Constra