﻿ Python: Sort each sublist of strings in a given list of lists using lambda - w3resource

# Python: Sort each sublist of strings in a given list of lists using lambda

## Python Lambda: Exercise-27 with Solution

Write a Python program to sort each sublist of strings in a given list of lists using lambda.

Sample Solution:

Python Code :

``````def sort_sublists(input_list):
result = [sorted(x, key = lambda x:x[0]) for x in input_list]
return result
color1 = [["green", "orange"], ["black", "white"], ["white", "black", "orange"]]
print("\nOriginal list:")
print(color1)
print("\nAfter sorting each sublist of the said list of lists:")
print(sort_sublists(color1))
``````

Sample Output:

```Original list:
[['green', 'orange'], ['black', 'white'], ['white', 'black', 'orange']]

After sorting each sublist of the said list of lists:
[['green', 'orange'], ['black', 'white'], ['black', 'orange', 'white']]
```

## Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:

Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

What is the difficulty level of this exercise?

Test your Python skills with w3resource's quiz

﻿

## Python: Tips of the Day

Python: Cache results with decorators

There is a great way to cache functions with decorators in Python. Caching will help save time and precious resources when there is an expensive function at hand.

Implementation is easy, just import lru_cache from functools library and decorate your function using @lru_cache.

```from functools import lru_cache

@lru_cache(maxsize=None)
def fibo(a):
if a <= 1:
return a
else:
return fibo(a-1) + fibo(a-2)

for i in range(20):
print(fibo(i), end="|")

print("\n\n", fibo.cache_info())
```

Output:

```0|1|1|2|3|5|8|13|21|34|55|89|144|233|377|610|987|1597|2584|4181|

CacheInfo(hits=36, misses=20, maxsize=None, currsize=20)```