🪟 Windows TippsThe Gemini desktop app is now available for Windows(11.09.2026 um 17:06 Uhr)
🔧 AI Nachrichten ChatGPT automatically logged out [Fix](12.09.2026 um 17:09 Uhr)
⚠️ Malware / Trojaner / VirenWindows 11 just dropped the tool ransomware abused, Microsoft says don’t restore WMIC(10.09.2026 um 20:11 Uhr)
🪟 Windows TippsServertimeout in Outlook über 10 Minuten verlängern(12.09.2026 um 15:10 Uhr)
🔧 AI Nachrichten Stealing AI Reasoning Traces(08.09.2026 um 12:20 Uhr)
🪟 Windows TippsThe Gemini desktop app is now available for Windows(11.09.2026 um 17:06 Uhr)
🔧 AI Nachrichten ChatGPT automatically logged out [Fix](12.09.2026 um 17:09 Uhr)
⚠️ Malware / Trojaner / VirenWindows 11 just dropped the tool ransomware abused, Microsoft says don’t restore WMIC(10.09.2026 um 20:11 Uhr)
🪟 Windows TippsServertimeout in Outlook über 10 Minuten verlängern(12.09.2026 um 15:10 Uhr)
🔧 AI Nachrichten Stealing AI Reasoning Traces(08.09.2026 um 12:20 Uhr)

🔧 Programmierung 🕛 vor 1 Jahr 3 Min Lesezeit
0

Day-26 List Comprehension

↗ Quelle (dev.to)
🗣️ Stimme:

List Comprehension:



It's a syntactically elegant method to create or manipulate lists in a single line of code.



Write a program to print the fruits contains letter 'a'(using for loop):




CODE
fruits = ["apple", "banana", "cherry", "kiwi", "mango"]
newlist = []

for x in fruits:
if "a" in x:
newlist.append(x)

print(newlist)










CODE
['apple', 'banana', 'mango']







(Using list comprehension):




CODE
fruits = ["apple", "banana", "cherry", "kiwi", "mango"]

newlist = [x for x in fruits if "a" in x]
print(newlist)










CODE
['apple', 'banana', 'mango']






Write a program to find the square root of given number:




CODE
l = [10,20,30,40]
newlist = []

#using for loop
for num in l:
newlist.append(num**2)
print(newlist)

#using loop in comprehensive way
newlist = [num**2 for num in l]
print(newlist)









CODE
[100, 400, 900, 1600]
[100, 400, 900, 1600]






Find similar numbers from 2 lists and different numbers from the same 2 lists:




CODE
l1 = [10,20,30,40]
l2 = [30,40,50,60]

#for loop
for num in l1:
for no in l2:
if num== no:
print(num,end=' ')
#comprehensive
print([num for num in l1 for no in l2 if num==no])










CODE
30 40 
[30, 40]









CODE
1 = [10,20,30,40]
l2 = [30,40,50,60]

#comprehensive
output = [num for num in l1 if num not in l2]

output = output + [num for num in l2 if num not in l1]
print(output)

#for loop
for num in l1:
if num not in l2:
print(num,end=' ')

for num in l2:
if num not in l1:
print(num,end=' ')









CODE
[10, 20, 50, 60]
10 20 50 60







Write a program for the given output in comprehensive approach:



l1 = [1,2,3]

l2 = [5,6,7]

Output:[(1, 5), (1, 6), (1, 7), (2, 5), (2, 6), (2, 7), (3, 5), (3, 6), (3, 7)]




CODE
l1 = [1,2,3]
l2 = [5,6,7]

l = [(i,j) for i in l1 for j in l2 if i!=j]
print(l)










CODE
[(1, 5), (1, 6), (1, 7), (2, 5), (2, 6), (2, 7), (3, 5), (3, 6), (3, 7)]






Write a program for the given output:

s = "a1b2c3"

output: abc123



Method:1




CODE
s= "a1b2c3"

alpha_list = []
num_list = []

for letter in s:
if letter.isalpha():
alpha_list.append(letter)
else:
num_list.append(letter)

print("".join(alpha_list+num_list))







Method:2




CODE
s = "a1b2c3"
letter=''.join([i for i in s if i.isalpha()])
no=''.join([i for i in s if i.isdigit()])

print(letter+no)









CODE
abc123






Write a program for the given output:



s = "a4k3b2"

output: aeknbd




CODE
s = "a4k3b2"
i = 0
while i<len(s):
first = s[i]
second = int(s[i+1])
print(first, chr(ord(first)+second),sep='',end='')
i+=2










CODE
aeknbd






Task:



1) Write a program to get the output 'abbbbklllbcc'




CODE
s = "a4k3b2"
i = 0

while i < len(s):
first = s[i]
second =int(s[i + 1])
print(first,chr(ord(first)+1)*second,sep='',end='')
i+=2










CODE
abbbbklllbcc






2) Write a program to get the output 'aaaaakkkkbbb'




CODE
s = "a4k3b2"
i = 0

while i < len(s):
first = s[i]
second =int(s[i + 1])
print(first,chr(ord(first))*second,sep='',end='')
i+=2









CODE
aaaaakkkkbbb







3.Join the given matrix into single list using comprehensive for and normal for loop.



Method:1(Using for loop)




CODE
matrix = [[10,20,30], [40,50,60], [70,80,90]]
output=[]

for i in matrix:
for j in i:
output.append(j)
print(output)







Method:2(Using comprehensive for loop)




CODE
matrix = [[10, 20, 30], [40, 50, 60], [70, 80, 90]]

output = [j for i in matrix for j in i]
print(output)










CODE
[10, 20, 30, 40, 50, 60, 70, 80, 90]







4.l = ['ABC','DEF', 'GHI', 'JKL']

Get OUTPUT: ['ABC', 'def','GHI', 'jkl']




CODE
l = ['ABC', 'DEF', 'GHI', 'JKL']

output = []
for i, alpha in enumerate(l):
if i % 2 != 0:
output.append(alpha.casefold())
else:
output.append(alpha)
print(output)









CODE
['ABC', 'def', 'GHI', 'jkl']



Vollständiger Original-Bericht
Ausführliche Details, Code-Beispiele & Hersteller-Stellungnahme auf dev.to.
↗ Original-Artikel auf dev.to lesen
Wie bewertest du diesen Beitrag?
1 Klick Feedback
Teilen mit Netzwerk & Team:

Community-Analysen & Experten-Meinungen 0

Verfasse deine eigene Analyse, teile Workarounds oder diskutiere diesen Vorfall im Blog.
Noch keine Community-Analyse verfasst. Markiere einen Textabschnitt oder klicke oben auf Eigene Analyse verfassen“!
Community Pulse: Relevanz-Einschätzung
1 Klick Experten-Votum
🔴 Akute Relevanz 0%
🟡 In Evaluierung 0%
🟢 Keine Auswirkung 0%
Spannende Innovation 0%
Verwandte Story-Cluster & Quellen (Vektor-KI)
Port 8095 Engine
1 Quelle
The Gemini desktop app is now available for Windows
1 Quelle
ChatGPT automatically logged out [Fix]
1 Quelle
Windows 11 just dropped the tool ransomware abused, Microsoft says don’t restore WMIC
Ähnliche Beiträge
🔍 Verwandte News

Auch interessante Nachrichten Day-26 List Comprehension

Thematisch verwandte Begriffe: Day26, List, Comprehension · 6 Treffer

Laden...

Videos werden geladen ...

Laden...

Beiträge werden geladen ...

Laden...

Videos werden geladen ...

Laden...

Beiträge werden geladen ...

Laden...

Videos werden geladen ...

Laden...

Beiträge werden geladen ...

Laden...

Videos werden geladen ...