## Distinct Primes Finder > 1000

0 likes • Nov 18, 2022
Python

## More Python Posts

### Hello, python

Ntindle
0 likes • Jan 20, 2021
Python
`print(“Hello World”)`
```my_list = [1, 2, 3, 4, 5]removed_element = my_list.pop(2)  # Remove and return element at index 2print(removed_element)  # 3print(my_list)  # [1, 2, 4, 5]
last_element = my_list.pop()  # Remove and return the last elementprint(last_element)  # 5print(my_list)  # [1, 2, 4]```
```mydict = {'carl':40, 'alan':2, 'bob':1, 'danny':0}
# How to sort a dict by value Python 3>sort = {key:value for key, value in sorted(mydict.items(), key=lambda kv: (kv[1], kv[0]))}print(sort)
# How to sort a dict by key Python 3>sort = {key:mydict[key] for key in sorted(mydict.keys())}print(sort)```
```import itertools
def compute_permutations(string):    # Generate all permutations of the string    permutations = itertools.permutations(string)
# Convert each permutation tuple to a string    permutations = [''.join(permutation) for permutation in permutations]
return permutations
# Prompt the user for a stringstring = input("Enter a string: ")
# Compute permutationspermutations = compute_permutations(string)
# Display the permutationsprint("Permutations:")for permutation in permutations:    print(permutation)```
```import random
class Node:
def __init__(self, c):
self.left = None        self.right = None        self.color = c        def SetColor(self,c) :        self.color = c
def PrintNode(self) :        print(self.color)
def insert(s, root, i, n):    if i < n:        temp = Node(s[i])         root = temp         root.left = insert(s, root.left,2 * i + 1, n)         root.right = insert(s, root.right,2 * i + 2, n)    return root
def MakeTree(s) :    list = insert(s,None,0,len(s))    return list

def MakeSet() :    s = []    count = random.randint(7,12)    for _ in range(count) :        color = random.randint(0,1) == 0 and "Red" or "White"        s.append(color)    return s
def ChangeColor(root) :    if (root != None) :        if (root.color == "White") :            root.SetColor("Red")        ChangeColor(root.left)        ChangeColor(root.right)

def PrintList(root) :    if root.left != None :        PrintList(root.left)    else :        root.PrintNode()    if root.right != None :        PrintList(root.right)    else :        root.PrintNode()

t1 = MakeTree(MakeSet())print("Original Colors For Tree 1:\n")PrintList(t1)ChangeColor(t1)print("New Colors For Tree 1:\n")PrintList(t1)
t2 = MakeTree(MakeSet())print("Original Colors For Tree 2:\n")PrintList(t2)ChangeColor(t2)print("New Colors For Tree 2:\n")PrintList(t2)
t3 = MakeTree(MakeSet())print("Original Colors For Tree 3:\n")PrintList(t3)ChangeColor(t3)print("New Colors For Tree 3:\n")PrintList(t3)```
```# Listlst = [1, 2, 3, 'Alice', 'Alice']
# One-Linerindices = [i for i in range(len(lst)) if lst[i]=='Alice']
# Resultprint(indices)# [3, 4]```