> For the complete documentation index, see [llms.txt](https://dailyjournal.gitbook.io/solutions/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://dailyjournal.gitbook.io/solutions/hackerearth-solutions/practice/algorithms/searching/linear-search.md).

# Linear Search

## Last Occurrence

You have been given an array of size *N* consisting of integers. In addition you have been given an element *M* you need to find and print the index of the last occurrence of this element *M* in the array if it exists in it, otherwise print -1. Consider this array to be 1 indexed.

**Input Format**:

The first line consists of 2 integers *N* and *M* denoting the size of the array and the element to be searched for in the array respectively . The next line contains *N* space separated integers denoting the elements of of the array.

**Output Format**

Print a single integer denoting the index of the last occurrence of integer *M* in the array if it exists, otherwise print -1.

{% tabs %}
{% tab title="C++" %}

```cpp
#include <iostream>

using namespace std;
int main() {
    int size, target;
    cin >> size >> target;
    int arr[size];
    for (int i = 0; i < size; i++) {
        cin >> arr[i];
    }

    int lastIndex = -1;
    for (int i = 0; i < size; i++) {
        if (arr[i] == target)
            lastIndex = i + 1;
    }
    cout << lastIndex << endl;
    return 0;
}
```

{% endtab %}
{% endtabs %}