Generate the skills needed to solve the following coding problems.

Text: Write a function to generate a square matrix filled with elements from 1 to n raised to the power of 2 in spiral order.

Test Cases:
assert generate_matrix(3)==[[1, 2, 3], [8, 9, 4], [7, 6, 5]] 
assert generate_matrix(2)==[[1,2],[4,3]]
assert generate_matrix(7)==[[1, 2, 3, 4, 5, 6, 7], [24, 25, 26, 27, 28, 29, 8], [23, 40, 41, 42, 43, 30, 9], [22, 39, 48, 49, 44, 31, 10], [21, 38, 47, 46, 45, 32, 11], [20, 37, 36, 35, 34, 33, 12], [19, 18, 17, 16, 15, 14, 13]]

Skills:
1. Matrix Manipulation
2. Spiral Algorithm Design
3. Loop Control Flow
4. Boundary Handling
5. Efficient Implementation
6. Testing & Debugging
7. Sequence-to-Matrix Mapping

Text: Write a function to find three closest elements from three sorted arrays.

Test Cases:
assert find_closet([1, 4, 10],[2, 15, 20],[10, 12],3,3,2) == (10, 15, 10)
assert find_closet([20, 24, 100],[2, 19, 22, 79, 800],[10, 12, 23, 24, 119],3,5,5) == (24, 22, 23)
assert find_closet([2, 5, 11],[3, 16, 21],[11, 13],3,3,2) == (11, 16, 11)

Skills:
1. Two-Pointer Technique
2. Array Traversal
3. Distance Calculation
4. Comparative Logic
5. Edge Case Handling
6. Optimal Selection Strategy
7. Time Complexity Awareness
8. Testing & Debugging

Text: Write a function to sort the given array by using heap sort.

Test Cases:
assert heap_sort([12, 2, 4, 5, 2, 3]) == [2, 2, 3, 4, 5, 12]
assert heap_sort([32, 14, 5, 6, 7, 19]) == [5, 6, 7, 14, 19, 32]
assert heap_sort([21, 15, 29, 78, 65]) == [15, 21, 29, 65, 78]

Skills:
1. Heap Data Structure
2. Heapify Operation
3. Array Manipulation
4. Sorting Algorithm Design
5. In-Place Sorting
6. Loop Control Flow
7. Time Complexity Awareness
8. Testing & Debugging

Text: Write a function to display sign of the chinese zodiac for given year.

Test Cases:
assert chinese_zodiac(1997)==('Ox')
assert chinese_zodiac(1998)==('Tiger')
assert chinese_zodiac(1994)==('Dog')

Skills:
1. Modulo Arithmetic
2. Zodiac Cycle Understanding
3. Mapping Years to Zodiac Signs
4. Conditional Logic
5. Boundary Handling
6. Efficiency in Computation
7. Testing & Debugging

Text: Write a function to find the median of two sorted arrays of same size.

Test Cases:
assert get_median([1, 12, 15, 26, 38], [2, 13, 17, 30, 45], 5) == 16.0
assert get_median([2, 4, 8, 9], [7, 13, 19, 28], 4) == 8.5
assert get_median([3, 6, 14, 23, 36, 42], [2, 18, 27, 39, 49, 55], 6) == 25.0

Skills:
1. Binary Search
2. Array Traversal
3. Median Calculation
4. Merging Two Arrays
5. Edge Case Handling
6. Comparative Logic
7. Time Complexity Optimization
8. Testing & Debugging

Text: Write a function to find the minimum number of elements that should be removed such that amax-amin<=k.

Test Cases:
assert removals([1, 3, 4, 9, 10,11, 12, 17, 20], 9, 4) == 5
assert removals([1, 5, 6, 2, 8], 5, 2) == 3
assert removals([1, 2, 3 ,4, 5, 6], 6, 3) == 2

Skills:
1. Sorting Algorithms
2. Sliding Window Technique
3. Two-Pointer Technique
4. Comparative Logic
5. Edge Case Handling
6. Greedy Algorithms
7. Time Complexity Awareness
8. Testing & Debugging

Text: Write a function to return true if the password is valid.

Test Cases:
assert pass_validity("password")==False
assert pass_validity("Password@10")==True
assert pass_validity("password@10")==False

Skills:
1. String Manipulation
2. Regular Expressions
3. Conditional Logic
4. Pattern Matching
5. Validation Rules Implementation
6. Edge Case Handling
7. Time Complexity Awareness
8. Testing & Debugging

Text: Write a function to replace all spaces in the given string with character * list item * list item * list item * list item '%20'.

Test Cases:
assert replace_spaces("My Name is Dawood") == 'My%20Name%20is%20Dawood'
assert replace_spaces("I am a Programmer") == 'I%20am%20a%20Programmer'
assert replace_spaces("I love Coding") == 'I%20love%20Coding'

Skills:
1. String Manipulation
2. Character Replacement
3. Loop Control Flow
4. Efficient String Operations
5. Edge Case Handling
6. Time Complexity Awareness
7. In-Place Modifications (if applicable)
8. Testing & Debugging

Text: {{question}}

Skills: