Given a string consisting of lowercase alphabets, write a function that returns 'yes' if the string contains all lowercase letters at least once. The solution should have O(N) time complexity and use no extra space.

Question

Accepted Answer

Function to check if a string has all lowercase letters appearing at least once without extra space in O(N) time.

Create a boolean array of size 26 to keep track of the occurrence of each letter.
Iterate through the string and mark the corresponding index in the array as true.
Check if all the elements in the array are true and return yes if so.
Alternatively, use a bit vector to keep track of the occurrence of each letter.

Accepted Answer

0 vote

Accepted Answer

#Code to check whether the string is in lowercase or not.
x=input("Enter a string: ")
flag= False
for i in x:
    if i.islower():
        flag=True
    else:
        break
if flag==True:
    print("Yes, the string is in lowercase")
else:
    print("No, the string is not in lowercase")

Given a string consisting of lowercase alphabets, write a function that returns 'yes' if the string contains all lowercase letters at least once. The solution should have O(N) time complexity and use no extra space.

Carwale SDE (Software Development Engineer) interview questions & answers

Popular interview questions of SDE (Software Development Engineer)