Given a string s which contains only lower alphabetic characters, check if it is possible to remove at most one character from this string in such a way that frequency of each distinct character becomes same in the string. Return true if it is possible to do else return false.Note: The driver code print 1 if the value returned is true, otherwise 0.

Sure, here is a Python solution for the problem:

def check_string(s):
    # Create a dictionary to store the frequency of each character
    freq = {}
    for char in s:
        if char in freq:
            freq[char] += 1
        else:
            freq[char] = 1

    # Create a list of the frequencies
    freq_list = list(freq.values())

    # Check if all frequencies are the same
    if len(set(freq_list)) == 1:
        return True

    # If not, check if it is possible to remove one character to make all frequencies the same
    for char in freq:
        freq[char] -= 1
        temp = list(freq.values())
        try:
            temp.remove(0)
        except:
            pass
        if len(set(temp)) == 1:
            return True
        freq[char] += 1

    # If it is not possible to make all frequencies the same by removing one character, return False
    return False

This function first counts the frequency of each character in the string. If all frequencies are the same, it returns True. If not, it checks if it is possible to make all frequencies the same by removing one character. If it is possible, it returns True. If not, it returns False.