PROBLEM LINK:Div1, Div2 DIFFICULTY:Simple PREREQUISITES:None PROBLEM:You are given two array's $L$ and $G$ of $N$ integers. You need to check if $L[i] \le G[i]$ for all $1 \le i \le N$. You need to repeat this task after reversing $G$ too. EXPLANATION:This problem is really simple. You just need to implement whatever the problem states. For chef to wear the glove in "front" position, check if $L[i] \le G[i]$ for all $1 \le i \le N$. This can be done using a linear traversal of both the array. Similarly, for chef to wear the glove in "back" position just reverse the array $G$ and check if $L[i] \le G[i]$ for all $1 \le i \le N$. Now you just need to output "front", "back", "both", or "none" depending upon the conditions fulfilled. Time Complexity:$O(N)$ AUTHOR'S AND TESTER'S SOLUTIONS
This question is marked "community wiki".
asked 11 Mar, 17:56
