×

# CHEGLOVE - Editorial

Div1, Div2
Practice

Author: Praveen Dhinwa
Tester: Triveni Mahatha

Simple

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".

294412
accept rate: 7%

18.4k347492528

 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×13,725
×946
×448
×243
×5