using System.Collections.Generic;
using System.Linq;

public class Kata
{
    /// <summary>
    /// Checks if two char arrays contain at least one common item.
    /// </summary>
    /// <param name="a">First char array</param>
    /// <param name="b">Second char array</param>
    /// <returns>True if the arrays have at least one common item, false otherwise</returns>
    public static bool ContainsCommonItem(char[] a, char[] b)
    {
        // If either input array is null, return false
        if (a == null || b == null) return false;

        // Create a HashSet from the first array to optimize lookup
        HashSet<char> setA = new HashSet<char>(a);

        // Use LINQ's Any method to check if any item in the second array is present in the HashSet
        return b.Any(item => setA.Contains(item));
    }
}

using System.Collections.Generic;

public class Kata
{
    public static bool ContainsCommonItem(char[] a, char[] b)
    {
        if (a == null || b == null) {
            return false;
        }
        
        HashSet<char> setA = new HashSet<char>(a);
        foreach (char item in b)
        {
            if (item != null && setA.Contains(item))
            {
                return true;
            }
        }
        return false;
    }
}

db = Connection()

def where_were_you_when_codewars_died(activity='codewars', location='127.0.0.1', food_source='coffee'):
    if not isinstance(activity, str) or not isinstance(location, str) or not isinstance(food_source, str):
        raise ValueError('activity, location, and food_source must be strings')
    record = f"I was at {location} consuming {food_source} when {activity} died."
    try:
        return db.add_record(record)
    except ConnectionError:
        print('Unable to connect to database')
    except Exception as e:
        print(f'An error occurred: {str(e)}')

def pyramid_of_x(n):
    if n < 2:
        return 'Not enough building blocks!'
    rows = ['*' * i for i in range(1, n + 1)]
    return '\n'.join(rows)

def pyramid_of_x(n):
    if n < 2:
        return 'Not enough building blocks!'
    
    rows = []
    for row in range(n):
        rows.append('*' * (row + 1))
    
    return '\n'.join(rows)

def pyramid_of_x(n):
    if n < 2:
        return 'Not enough building blocks!'
    return '\n'.join('*' * i for i in range(1, n + 1))