count triplets hackerrank solution java code example

Example 1: list hackerrank solution

list=[]
n=int(input())
for i in range(n):  
    p=input().split()
    if p[0]=="insert":
        list.insert(int(p[1]),int(p[2]))
    elif p[0]=="print":
        print(list)
    
    elif (p[0]=="remove"):
        list.remove(int(p[1]))
    elif p[0]=="append":
        list.append(int(p[1]))
    elif p[0]=="sort":
        list.sort()
    elif p[0]=="print":
        print(list)
    elif p[0]=="pop":
        list.pop()
    elif p[0]=="reverse":
        list.reverse()
    elif p[0]=="print":
        print(list)

Example 2: pangrams hackerrank solution in python

ascii_array = []
def pangram(string):
    lower_string = string.lower()
    for i in range(len(lower_string)):
        ascii_array.append(ord(lower_string[i]))
    for i in range(97, 123):
        if i not in ascii_array:
            return 'Not Pangram'
    return 'Pangram'