Sort by

recency

|

1099 Discussions

|

  • + 0 comments

    string = input() lowerCase_list = [] upperCase_list = [] evenDigits_list = [] oddDigits_list = []

    for char in string: if char.islower(): lowerCase_list.append(char) if char.isupper(): upperCase_list.append(char) if char.isdigit(): char = int(char) if char%2==0: evenDigits_list.append(str(char)) char_in_str = str(char) elif char%2!=0: oddDigits_list.append(str(char)) char_in_str = str(char)

    sorted_string = ''.join(sorted(lowerCase_list)) + ''.join(sorted(upperCase_list)) + ''.join(sorted(oddDigits_list)) + ''.join(sorted(evenDigits_list))

    print(sorted_string)

  • + 0 comments

    if name == "main": intput_ = input() evenumbers = sorted([ ch for ch in intput_ if ch.isdigit() and int(ch)%2==0]) oddnumbers = sorted([ ch for ch in intput_ if ch.isdigit() and int(ch)%2!=0]) capital = sorted([ch for ch in intput_ if ch.isupper()]) letters = sorted([ch for ch in intput_ if ch.isalpha() and ch.islower()]) final = "".join(letters)+"".join(capital)+"".join(oddnumbers)+"".join(evenumbers) print(final)

  • + 0 comments
    S = input()
    low = ""
    up = ""
    odd = ""
    even = ""
    for i in S:
        if i.islower():
            low += i
        elif i.isupper():
            up += i
        elif i.isdigit():
            if int(i) % 2 == 1:
                odd += i
            else:
                even += i
                
    low = sorted(low)
    up = sorted(up)
    odd = sorted(odd)
    even = sorted(even)
    print("".join(low+up+odd+even))
    
  • + 0 comments

    Here is HackerRank ginortS in Python solution - https://programmingoneonone.com/hackerrank-ginorts-problem-solution-in-python.html

  • + 0 comments

    string = input() li = [] l1= [] l2 = [] l3 = [] for i in string: if i.islower() == True: li.append(i) li.sort() for i in string: if i.isupper()==True: l1.append(i) l1.sort() for i in string: if i.isdigit() == True: if float(i)%2 != 0: l2.append(i) l2.sort() for i in string: if i.isdigit() == True: if float(i)%2 == 0: l3.append(i) l3.sort()

    print(l2,l3)

    last = (li+l1+l2+l3) final = ''.join(last) print(final)