SDE - 1

Identify the input parameters: Determine the given array and the number of left rotations to be performed.

Handle edge cases: Check if the number of rotations is greater than the length of the array. If so, perform a modulo operation (numRotations = numRotations % arrayLength) to bring it within the valid range.

Perform left rotations: Create a temporary array to store the rotated elements. Iterate through the original array from the numRotations index to the end, and copy each element to the temporary array. Then, iterate from the beginning of the original array to the numRotations - 1 index and copy each element to the temporary array. This way, the left-rotated array will be stored in the temporary array.

Return the result: Once the rotations are complete, return the temporary array as the result.

Initialize an empty stack to store the opening parentheses.
Iterate through each character in the given string.
If the current character is an opening parenthesis (i.e., '(', '{', or '['), push it onto the stack.
If the current character is a closing parenthesis (i.e., ')', '}', or ']'), check if the stack is empty. If it is, or if the top element of the stack does not match the current closing parenthesis, the parentheses are not valid.
If the stack is not empty and the top element matches the current closing parenthesis, pop the top element from the stack.
After iterating through all the characters, check if the stack is empty. If it is, the parentheses are valid; otherwise, they are not.

Generate permutations: Generate all possible permutations of the given array elements. You can use backtracking or recursion to create these permutations.

Check for the squareful property: For each permutation, check if it satisfies the squareful property. A squareful array is one in which the sum of adjacent elements is a perfect square. Iterate through the permutation and calculate the sum of adjacent elements. Use a helper function to determine whether the sum is a perfect square.

Count valid arrays: Keep track of the number of valid squareful arrays.

Handle duplicate elements: If the given array contains duplicate elements, handle them appropriately. Avoid generating duplicate permutations by skipping redundant iterations. You can achieve this by keeping track of visited elements or by sorting the array and skipping duplicates during the permutation generation step.

Return the count: After checking all permutations, return the count of valid squarely arrays.