Divide String Problem Statement

You are given a string WORD consisting of lowercase alphabets. Your task is to divide WORD into N strings of equal length.

Input:

The first line contains an integer 'T' representing the number of test cases. Each test case consists of a string WORD and an integer N.

Output:

For each test case, output all strings formed by dividing WORD into N equal parts. If it is not possible, return an empty string array/list. Print the output for each test case on a new line.

Example:

Input:

WORD = "abcdefgh", N = 2

Output:

["abcd", "efgh"]

Explanation:

The string WORD is divided into two parts of equal length: "abcd" and "efgh".

Constraints:

• 1 <= T <= 100
• WORD consists of lowercase English alphabets
• 1 <= |WORD| <= 2000
• 1 <= N <= |WORD|

Note: You do not need to print anything; just implement the function.