{"id":455,"date":"2020-06-10T10:47:16","date_gmt":"2020-06-10T10:47:16","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=455"},"modified":"2023-07-24T07:31:02","modified_gmt":"2023-07-24T07:31:02","slug":"greater-than-neighbor","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/greater-than-neighbor\/","title":{"rendered":"Greater than Neighbor"},"content":{"rendered":"

\"\"<\/p>\n

In this article, we will be looking at how we can solve the problem Greater than neighbor, in which you are given an Array and you need to print all the indexes that have a value greater than its left and right neighbors. <\/p>\n

PROBLEM STATEMENT(<\/code>SIMPLIFIED)<\/code>:<\/h3>\n
\n

Given an array A<\/code> of N<\/code> elements, your task is to print all those indexes that have values greater than its left and right neighbors. In case of extreme indexes like 0<\/code> and N-1<\/code>, check with their single neighbor.<\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

For Example:<\/h4>\n

\"\"<\/p>\n

SOLVING APPROACH:<\/h3>\n
\n

The idea is to traverse the array from left and for each index, check if the value at it is greater than its neighbor. If Yes<\/code> print its index. If no such index is found, simply print -1<\/code>.<\/p>\n<\/blockquote>\n

SOLUTIONS:<\/h3>\n\t\t\t\t\t\t