sariedine

[sariedine @rsariedine]

Coding day 60:
def even_seq(n): return [i for i in range(2, n+1, 2)]
([Creates a logical sequence of even numbers up to n])

[sariedine @rsariedine]

Coding day 09:
def square_seq(n): return [i*i for i in range(1, n+1)]
([Returns list of squares from 1 to n efficiently using list comprehension])

[sariedine @rsariedine]

"Coding day 51:
```python
cache = {}
def memoize(func):
def wrapper(*args):
if args not in cache:
cache[args] = func(*args)
return cache[args]
return wrapper
```
( [Basic memoization decorator to cache function results] )

[sariedine @rsariedine]

Coding day 53:
```python
def check_balance(emails):
return sum('@' in e for e in emails)
```
( [Counts emails containing '@'.] )

[sariedine @rsariedine]

Coding day 09:
def memoize_noargs(func): cache = {}; def inner(): return cache.setdefault(func.__name__, func()); return inner
([Memoizes result for no-argument functions using function name as key])

[sariedine @rsariedine]

Coding day 10:
def power(x, n): return x**n
([Calculates x raised to n efficiently in one line])

[sariedine @rsariedine]

Coding day 09:
def any_lowercase(s): return any(c.islower() for c in s)
([Checks if any character in the string is lowercase])

[sariedine @rsariedine]

Coding day 58:
def factorial(n): return 1 if n == 0 else n * factorial(n-1)
([Recursive factorial calculation in one line])

[sariedine @rsariedine]

Coding day 57:
```python
def sum_n(n): return n * (n + 1) // 2
```
([Returns the sum of 1 to n using the arithmetic series formula])

[sariedine @rsariedine]

Coding day 56:
```python
def factorial_iter(n): r=1; [r:=r*i for i in range(2,n+1)]; return r
```
([Calculates factorial iteratively with assignment expression])

[sariedine @rsariedine]

Coding day 55:
```python
def is_leap(y): return y%4==0 and (y%100!=0 or y%400==0)
```
([Checks if year y is a leap year using concise logical conditions])

[sariedine @rsariedine]

Coding day 09:
def next_even(n): return n+2 if n%2==0 else n+1
([Returns the next even number after n])

[sariedine @rsariedine]

Coding day 09:
def is_power_of_two(n): return n > 0 and (n & (n-1)) == 0
([Checks if n is a power of two using bitwise AND])

[sariedine @rsariedine]

Coding day 54:
```python
def count_words(s): return len(s.split())
```
([Counts the number of words in a string efficiently])

[sariedine @rsariedine]

Coding day 09:
def count_vowels(s): return sum(1 for c in s.lower() if c in 'aeiou')
([Counts the vowels in a string efficiently])

[sariedine @rsariedine]

Coding day 53:
def max_abs_diff(a, b): return max(a-b, b-a)
([Returns the absolute difference between two numbers efficiently])

[sariedine @rsariedine]

Coding day 52:
```python
def max_of_three(a,b,c): return max(a,b,c)
```
([Returns the largest of three numbers in one line])

[sariedine @rsariedine]

Coding day 09:
def sum_unique(lst): return sum(set(lst))
([Returns the sum of unique elements in a list efficiently])

[sariedine @rsariedine]

Coding day 51:
def is_upper(s): return s.isupper()
([Checks if a string contains only uppercase letters])

[sariedine @rsariedine]

Coding day 48:
```python
def cube_sum(a, b): return a**3 + b**3
```
([Calculates sum of cubes of two numbers efficiently])