SDE - 2

Ninja has an array, ‘S’, of ‘N’ words, each word consisting of lowercase English letters. An array of words is good if they are in lexicographical order. Ninja would like to make the array ‘S’ good. However, the only move Ninja can perform is to reverse any number of them as many times as he wants.

Let ‘A[i]’ be the cost to reverse the word ‘S[i]’. Let ‘C’ be the minimum total cost to make the array ‘S’ good. Calculate the value of ‘C’. If it’s impossible to make the array good, return the integer ‘-1’.

Example :

N = 3, A = [ 4, 8, 6 ], S = [ “tb”, “ay”, “yb” ]
For each string, we have 2 choices, whether to reverse it or not.
For [ “tb”, “ay”, “yb”], not sorted in lexicographical order.
For [ “tb”, “ay”, “by”], not sorted in lexicographical order.
For [ “tb”, “ya”, “yb”], sorted in lexicographical order and the cost is 0 + 8 + 0 = 8.
For [ “tb”, “ya”, “by”], not sorted in lexicographical order.
For [ “bt”, “ay”, “yb”], not sorted in lexicographical order.
For [ “bt”, “ay”, “by”], not sorted in lexicographical order.
For [ “bt”, “ya”, “yb”], sorted in lexicographical order and the cost is 4 + 8 + 0 = 12.
For [ “bt”, “ya”, “by”], not sorted in lexicographical order.
Hence, the answer is 8.

Inputs:-1. current position of person in x and y format
2. Current facing direction(East, West, North, South)
3. Some input array(M,M,M,L,M,R,M)
M- move
L - turn Left
R- turn Right

Output:- you need to tell the last position and direct of the person after iterating all inputs.

Design a parking lot.

Your communication skills are checked
How you handle the situation
Location constraints